Searcharxiv⌕ Search

arXiv subjects

Mordechay B. Levin

Publications and source records attributed to Mordechay B. Levin.

13 recordsLinked to original sources
arXiv2023

On the upper bound of the $L_p$ discrepancy of Halton's sequence and the Central Limit Theorem for Hammersley's net

Let $(H_s(n))_{n \geq 1}$ be an $s-$dimensional Halton's sequence, and let ${\mathcal{H}}_{s+1,N}=(H_s(n),n/N)_{n=0}^{N-1}$ be the $s+1-$dimensional Hammersley point set. Let $D(\mathbf{x},(H_n)_{n=0}^{N-1} )$ be the local discrepancy of $(H_n)_{n=0}^{N-1}$, and let $D_{s,p} ( (H_n)_{n=0}^{N-1}) $ be the $L_p$ discrepancy of $(H_n)_{n=0}^{N-1} $. It is known that $\limsup_{N \to \infty} N (\log N)^{-s/2} D_{s,p} (H_s(N))_{n=0}^{N-1} >0$. In this paper, we prove that $$D_{s,p} ((H_s(N))_{n=0}^{N-1}) = O(N^{-1} \log^{s/2} N) \quad {\rm for} \; \; N \to \infty.$$ I.e., we found the smallest possible order of magnitude of $L_p$ discrepancy of Halton's sequence. Then we prove the Central Limit Theorem for Hammersley net : \begin{equation}\nonumber N^{-1} D(\bar{\mathbf{x}},\mathcal{H}_{s+1,N} )/ D_{s+1,2}(\mathcal{H}_{s+1,N}) \stackrel{w}{\rightarrow} \mathcal{N}(0,1), \end{equation} where $\bar{\mathbf{x}}$ is a uniformly distributed random variable in $[0,1]^{s+1}$. The main tool is the theorem on $p$-adic logarithmic forms.

math.NT↗
arXiv2020

On the upper bound of the $L_2$-discrepancy of Halton's sequence

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 \to \infty } (\log N)^{-1} D_{2} ( H(n) )_{n=0}^{N-1} >0$. In this paper, we prove that $$D_{2} (( H(n) )_{n=0}^{N-1}) =O( \log N) \quad {\rm for} \; \; N \to \infty ,$$ i.e., we found the smallest possible order of magnitude of $L_2$-discrepancy of a 2-dimensional Halton's sequence. The main tool is the theorem on linear forms in the $p$-adic logarithm.

math.NT↗
arXiv2020

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

Let $ (X_n)_{n \geq 0} $ be a digital $(t,s)$-sequence in base $2$, $\mathcal{P}_m =(X_n)_{n=0}^{2^m-1} $, and let $D(\mathcal{P}_m, Y )$ be the local discrepancy of $\mathcal{P}_m$. Let $T \oplus Y$ be the digital addition of $T$ and $Y$, and let $$\mathcal{M}_{s,p} (\mathcal{P}_m) =\Big( \int_{[0,1)^{2s}} |D(\mathcal{P}_m \oplus T , Y ) |^p \mathrm{d}T \mathrm{d}Y \Big)^{1/p} .$$ In this paper, we prove that $D(\mathcal{P}_m \oplus T , Y ) / \mathcal{M}_{s,2} (\mathcal{P}_m)$ weakly converge to the standard Gaussisian distribution for $m \rightarrow \infty$, where $T,Y$ are uniformly distributed random variables in $[0,1)^s$. In addition, we prove that \begin{equation} \nonumber \mathcal{M}_{s,p} (\mathcal{P}_m) / \mathcal{M}_{s,2} (\mathcal{P}_m) \to \frac{1}{\sqrt{2π}}\int_{-\infty}^{\infty} |u|^p e^{-u^2/2} \mathrm{d}u \quad {\rm for} \; \; m \to \infty , \;\; p>0. \end{equation}

math.NT↗
arXiv2020

Temporal Central Limit Theorem for Multidimensional Adding Machine

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}(x_s))$. Let $y_i \in (0,1)$ be a $p_{s+1}$-rational $(1 \leq i \leq s)$, $\mathbf{1}_{[0,\mathbf{y})}$ the indicator function of the box $[0,y_1) \times \cdots\times [0,y_s)$. In this paper, we prove the following central limit theorem: \begin{equation} \nonumber \frac{ \sum_{k=-n}^{n-1} \mathbf{1}_{[0,\mathbf{y})}(T^k_P(\mathbf{x})) -2n y_1 y_2\dots y_s }{\mathcal{H}_N(\mathbf{x}) \log_2^{s/2} N} \; \stackrel{w}{\longrightarrow} \;\mathcal{N}(0,1), \end{equation} when $n$ is sampled uniformly from $\{ 1,...,N\}$, $\mathcal{H}_N(\mathbf{x}) \in [\upsilon_1, \upsilon_2]$ with some $\upsilon_1, \upsilon_2 >0$, for almost all $\mathbf{x} \in [0,1)^s$.

math.NT↗
arXiv2019

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

Let ${\bf x}_0,{\bf 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 that, for every integer $N$, $$ | {\rm card}\{n <N \; | \; {\bf x}_{n} \in S\} - a N| <C . $$ Let $ ({\bf x}_n)_{n \geq 0} $ be an $s-$dimensional Halton-type sequence obtained from a global function field, $b \geq 2$, ${\bf γ} =(γ_1,...,γ_s)$, $γ_i \in [0, 1)$, with $b$-adic expansion $γ_i= γ_{i,1}b^{-1}+ γ_{i,2}b^{-2}+...$, $i=1,...,s$. In this paper, we prove that $[0,γ_1) \times ...\times [0,γ_s)$ is the bounded remainder set with respect to the sequence $({\bf x}_n)_{n \geq 0}$ if and only if \begin{equation} \nonumber \max_{1 \leq i \leq s} \max \{ j \geq 1 \; | \; γ_{i,j} \neq 0 \} < \infty. \end{equation} We also obtain the similar results for a generalized Niederreiter sequences, Xing-Niederreiter sequences and Niederreiter-Xing sequences.

math.NT↗
arXiv2018

On a bounded remainder set for a digital Kronecker sequence

Let ${\bf x}_0,{\bf 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 that, for every integer $N$, $$ | {\rm card}\{n <N \; | \; {\bf x}_{n} \in S \} - a N| <C . $$ Let $ ({\bf x}_n)_{n \geq 0} $ be an $s-$dimensional digital Kronecker-sequence in base $b \geq 2$, ${\bf γ} =(γ_1,...,γ_s)$, $γ_i \in [0, 1)$ with $b$-adic expansion\\ $γ_i= γ_{i,1}b^{-1}+ γ_{i,2}b^{-2}+...$, $i=1,...,s$. In this paper, we prove that $[0,γ_1) \times ...\times [0,γ_s)$ is the bounded remainder set with respect to the sequence $({\bf x}_n)_{n \geq 0}$ if and only if \begin{equation} \nonumber \max_{1 \leq i \leq s} \max \{ j \geq 1 \; | \; γ_{i,j} \neq 0 \} < \infty. \end{equation}

math.NT↗
arXiv2015

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

Let $ (H_s(n))_{n \geq 1} $ be an $s-$dimensional generalized Halton's sequence. Let $\emph{D}^{*}_N$ be the discrepancy of the sequence $ (H_s(n) )_{n = 1}^{N} $. It is known that $D^{*}_{N} =O(\ln^s N)$ as $N \to \infty $. In this paper, we prove that this estimate is exact. Namely, there exists a constant $C(H_s)>0$, such that $$ \max_{1 \leq M \leq N} M \emph{D}^{*}_{M} \geq C(H_s) \log_2^s N \quad {\rm for} \; \; N=2,3,... \; . $$

math.NT↗
arXiv2015

On the lower bound of the discrepancy of $(t,s)$ sequences: II

Let $ (\bx(n))_{n \geq 1} $ be an $s-$dimensional Niederreiter-Xing sequence in base $b$. Let $D((\bx(n))_{n = 1}^{N})$ be the discrepancy of the sequence $ (\bx(n))_{n = 1}^{N} $. It is known that $N D((\bx(n))_{n = 1}^{N}) =O(\ln^s N)$ as $N \to \infty $. In this paper, we prove that this estimate is exact. Namely, there exists a constant $K>0$, such that $$ \inf_{\bw \in [0,1)^s} \sup_{1 \leq N \leq b^m} N D((\bx(n)\oplus \bw)_{n = 1}^{N}) \geq K m^s \quad {\rm for} \; \; m=1,2,...\;. $$ We also get similar results for other explicit constructions of $(t,s)$ sequences.

math.NT↗
arXiv2014

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

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 $ND_N =O(\ln^s N)$ as $N \to \infty $. In this paper we prove that this estimate is exact: $$ \overline{\lim}_{ N \to \infty} N \ln^{-s}(N) D_N >0. $$

math.NT↗
arXiv2013

On the Gaussian limiting distribution of lattice points in a parallelepiped

Let $ Γ\subset \RR^s $ be a lattice obtained from a module in a totally real algebraic number field. Let $\cR(\btheta, \bN)$ be an error term in the lattice point problem for the parallelepiped $[-θ_1 N_1,θ_1 N_1] \times ... \times [-θ_s N_s,θ_s N_{s}]$. In this paper, we prove that $\cR(\btheta, \bN)/σ(\cR,\bN) $ have Gaussian limiting distribution as $N \to \infty$, where $\btheta=(θ_1,...,θ_s)$ is a uniformly distributed random variable in $[0,1]^s$, $N=N_1 ... N_s$ and $σ(\cR,\bN) \asymp (\log N)^{(s-1)/2}$. We obtain also a similar result for the low discrepancy sequence corresponding to $Γ$.

math.NT↗
arXiv2013

On the lower bound in the lattice point remainder problem for a parallelepiped

Let $ Γ\subset \RR^s $ be a lattice, obtained from a module in a totally real algebraic number field. Let $G$ be an axis parallel parallelepiped, and let $|G|$ be a volume of $G$. In this paper we prove that $\limsup_{|G| \to \infty} (\det Γ\#(Γ\cap G)-|G|)/\ln^{s-1} |G| >0.$ Thus the known estimate $\det Γ\#(Γ\cap G)=|G| +O(\ln^{s-1} |G|)$ is exact. We obtain also a similar result for the low discrepancy sequence corresponding to $Γ$.

math.NT↗
arXiv2011

On the Statistical Independence of Shift-Register Pseudorandom Multisequence over Part of the Period

In this paper we construct a pseudorandom multisequence $(x_{n_1,...,n_r})$ based on $k$th-order linear recurrences modulo $p$, such that the discrepancy of the $s$-dimensional multisequence $(x_{n_1+i_1,...,n_r+i_r})_{1 \leq i_j \leq s_j, 1 \leq j \leq r}$ $1 \leq n_j \leq N_j, 1 \leq j \leq r$ is equal to $O((N_1 ... N_r)^{-1/2} \ln^{s+3r}(N_1 ... N_r))$, where $s=s_1 ... s_r$, for all $N_1,...,N_r$ with $1 < N_1 ... N_r \leq p^k

math.NT↗