The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Let be integers, and let be a sequence of real numbers. In this paper we prove that the lower bound of the discrepancy of the double sequence
coincides (up to a logarithmic factor) with the lower bound of the discrepancy of ordinary sequences in -dimensional unit cube . We also find a lower bound of the discrepancy (up to a logarithmic factor) of the sequence (Korobov’s problem).
We construct a Markov normal sequence with a discrepancy of . The estimation of the discrepancy was previously known to be .
We prove the central limit theorem for the multisequence
where , are reals, are partially hyperbolic commuting s × s matrices, and x is a uniformly distributed random variable in . The main tool is the S-unit theorem.
In this paper we extend Champernowne’s construction of normal numbers in base to the case and obtain an explicit construction of the generic point of the shift transformation of the set . We prove that the intersection of the considered lattice configuration with an arbitrary line is a normal sequence in base .
We extend Champernowne’s construction of normal numbers to base b to the case and obtain an explicit construction of a generic point of the shift transformation of the set .
Download Results (CSV)