Mordechay B. Levin

activity

20142020

most citedOn the lower bound of the discrepancy of Halton's sequence

1 citations · 1 across the 4 of their papers we have counts for

collaborators

4 papers

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…

math.NT2019

On a bounded remainder set for $(t, s)$ sequences I

Mordechay B. Levin

Let $x_{0}, x_{1}, ...$ be a sequence of points in $[0, 1)^{s}$ . A subset $S$ of $[0, 1)^{s}$ is called a bounded remainder set if there exist two real numbers $a$ and $C$ such tha…

math.NT2018

On a bounded remainder set for a digital Kronecker sequence

Mordechay B. Levin

Let $x_{0}, x_{1}, ...$ be a sequence of points in $[0, 1)^{s}$ . A subset $S$ of $[0, 1)^{s}$ is called a bounded remainder set if there exist two real numbers $a$ and $C$ such tha…

math.NT2014★ 1 cited

On the lower bound of the discrepancy of Halton's sequence

Mordechay B. Levin

Let $(H_{s} (n))_{n \geq 1}$ be an $s -$ dimensional Halton's sequence. Let $D_{N}$ be the discrepancy of the sequence $(H_{s} (n))_{n = 1}^{N}$ . It is known that $N D_{N} = O (ln^{s} N)$ as $…

Temporal Central Limit Theorem for Multidimensional Adding Machine

On a bounded remainder set for (t,s) sequences I

On a bounded remainder set for a digital Kronecker sequence

On the lower bound of the discrepancy of Halton's sequence

On a bounded remainder set for $(t, s)$ sequences I