Related papers: On Finite Pseudorandom Binary Sequences: Functions…
Three measures of pseudorandomness of finite binary sequences were introduced by Mauduit and S\'ark\"ozy in 1997 and have been studied extensively since then: the normality measure, the well-distribution measure, and the correlation measure…
The correlation measure is a testimony of the pseudorandomness of a sequence $\infw{s}$ and provides information about the independence of some parts of $\infw{s}$ and their shifts. Combined with the well-distribution measure, a sequence…
Many automatic sequences, such as the Thue-Morse sequence or the Rudin-Shapiro sequence, have some desirable features of pseudorandomness such as a large linear complexity and a small well-distribution measure. However, they also have some…
Correlation measure of order $k$ is an important measure of randomness in binary sequences. This measure tries to look for dependence between several shifted version of a sequence. We study the relation between the correlation measure of…
We study the pseudorandomness of automatic sequences in terms of well-distribution and correlation measure of order 2. We detect non-random behavior which can be derived either from the functional equations satisfied by their generating…
Gyarmati, Mauduit and S\'ark\"ozy introduced the cross-correlation measure $\Phi_k(G)$ of order $k$ to measure the level of pseudorandom properties of families of finite binary sequences. In an earlier paper we estimated the…
In this survey we summarize properties of pseudorandomness and non-randomness of some number-theoretic sequences and present results on their behaviour under the following measures of pseudorandomness: balance, linear complexity,…
It is known that Hall's sextic residue sequence has some desirable features of pseudorandomness: an ideal two-level autocorrelation and linear complexity of the order of magnitude of its period $p$. Here we study its correlation measure of…
The normality measure $\mathcal{N}$ has been introduced by Mauduit and S{\'a}rk{\"o}zy in order to describe the pseudorandomness properties of finite binary sequences. Alon, Kohayakawa, Mauduit, Moreira and R{\"o}dl proved that the minimal…
We prove a variant of the multidimensional polynomial Szemer\'edi theorem of Bergelson and Leibman where one replaces polynomial sequences with other sparse sequences defined by functions that belong to some Hardy field and satisfy certain…
In this paper, a new two-dimensional Hardy type inequality is given in terms of pseudo-analysis dealing with set-valued functions. The first one is given for a pseudo-integral of set-valued function where pseudo-addition and…
We introduce sufficient conditions on discrete singular integral operators for their maximal truncations to satisfy a sparse bound. The latter imply a range of quantitative weighted inequalities, which are new. As an application, we prove…
A histogram estimate of the Radon-Nikodym derivative of a probability measure with respect to a dominating measure is developed for binary sequences in $\{0,1\}^{\mathbb{N}}$. A necessary and sufficient condition for the consistency of the…
We study relative differential closure in the context of Hardy fields. Using our earlier work on algebraic differential equations over Hardy fields, this leads to a proof of a conjecture of Boshernitzan (1981): the intersection of all…
We propose a new method to construct a stationary process and random field with a given decreasing covariance function and any one-dimensional marginal distribution. The result is a new class of stationary processes and random fields. The…
Title: On linear extension for interpolating sequences. Author: Eric Amar Abstract: Let A be a uniform algebra on the compact space X and $\sigma $ a probability measure on X. We define the Hardy spaces $H^{p}(\sigma)$ and the…
The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that…
In 1985, Boshernitzan showed that a minimal (sub)shift satisfying a linear block growth condition must have a bounded number of ergodic probability measures. Recently, this bound was shown to be sharp through examples constructed by Cyr and…
In [1], Y. Belov, K. Seip, and the author studied the Carleson measures for certain spaces of analytic functions of which the de Branges spaces and the model subspaces of the Hardy space H2 are the prime examples. In this paper, we continue…
The correlation measure of order $k$ is a measure of pseudorandomness that quantifies the similarity between a sequence and its shifts. It is known that the correlation of order 4 is large for the Rudin-Shapiro sequence despite having nice…