M. Levin

activity

20112020

most citedOn the lower bound of the discrepancy of

(t, s)

sequences: II

6 citations · 8 across the 10 of their papers we have counts for

collaborators

Showing 2020Show all

3 papers · 1 filter

math.NT2020

Central Limit Theorem for $(t, s)$ -sequences, I

Mordechay B. Levin

Let $(X_{n})_{n \geq 0}$ be a digital $(t, s)$ -sequence in base $2$ , $P_{m} = (X_{n})_{n = 0}^{2^{m} - 1}$ , and let $D (P_{m}, Y)$ be the local discrepancy of $\mathcal{P}_m…

math.NT2020

On the upper bound of the $L_{2}$ -discrepancy of Halton's sequence

Mordechay B. Levin

Let $(H (n))_{n \geq 0}$ be a $2 -$ dimensional Halton's sequence. Let $D_{2} ((H (n))_{n = 0}^{N - 1})$ be the $L_{2}$ -discrepancy of $(H_{n})_{n = 0}^{N - 1}$ . It is known that $\limsup_{N…

math.NT2020

Temporal Central Limit Theorem for Multidimensional Adding Machine

Mordechay B. Levin

Let $p_{1}, ..., p_{s + 1}$ be distinct primes and let $T_{p_{i}}$ be the von Niemann - Kakutani adding machine $(1 \leq i \leq s)$ , $T_{\mathcal{P}}(\mathbf{x}) =(T_{p_1}(x_1),..., T_{p_s…

Central Limit Theorem for (t,s)-sequences, I

On the upper bound of the L2​-discrepancy of Halton's sequence

Temporal Central Limit Theorem for Multidimensional Adding Machine

Central Limit Theorem for $(t, s)$ -sequences, I

On the upper bound of the $L_{2}$ -discrepancy of Halton's sequence