Search arXivSearch

arXiv · 2111.05662

Balance and pattern distribution of sequences derived from pseudorandom subsets of $\mathbb{Z}_q$

Abstract

Let $q$ be a positive integer and $\mathcal{S}=\left\{x_0,x_1,\ldots,x_{T-1}\right\}\subseteq\mathbb{Z}_q=\{0,1,\ldots,q-1\}$ with $$0\leq x_0<x_1<\ldots< x_{T-1}\leq q-1.$$ We derive from $\mathcal{S}$ three (finite) sequences. 1. For an integer $M\geq 2$ let $(s_n)$ be the $M$-ary sequence defined by \begin{eqnarray*} s_n\equiv x_{n+1}-x_n \bmod M, \qquad n=0,1,\ldots, T-2. \end{eqnarray*} 2. For an integer $m\geq 2$ let $(t_n)$ be the binary sequence defined by \begin{eqnarray*} t_n=\left\{\begin{array}{ll} 1, & \hbox{if } 1\leq x_{n+1}-x_n\leq m-1, \\ 0, & \hbox{otherwise}, \end{array}\right. \qquad n=0,1,\ldots, T-2. \end{eqnarray*} 3. Let $(u_n)$ be the characteristic sequence of $\mathcal{S}$, \begin{eqnarray*} u_n=\left\{\begin{array}{ll} 1, & \hbox{if } n\in \mathcal{S}, \\ 0, & \hbox{otherwise}, \end{array}\right. \qquad n=0,1,\ldots, q-1. \end{eqnarray*} We study the balance and pattern distribution of the sequences $(s_n)$, $(t_n)$ and $(u_n)$. For sets $\mathcal{S}$ with desirable pseudorandom properties, more precisely, sets with low correlation measures, we show the following: 1. The sequence $(s_n)$ is (asymptotically) balanced and has uniform pattern distribution if $T$ is of smaller order of magnitude than $q$. 2. The sequence $(t_n)$ is balanced and has uniform pattern distribution if $T$ is approximately $\left(1-\frac{1}{2^{1/(m-1)}}\right)q$. 3. The sequence $(u_n)$ is balanced and has uniform pattern distribution if $T$ is approximately $\frac{q}{2}$. These results are motivated by earlier results for the sets of quadratic residues and primitive roots modulo a prime. We unify these results and derive many further (asymptotically) balanced sequences with uniform pattern distribution from pseudorandom subsets.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Huaning Liu, Arne Winterhof. 2021-11-10. Balance and pattern distribution of sequences derived from pseudorandom subsets of $\mathbb{Z}_q$. https://arxiv.org/abs/2111.05662

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT