Related papers: Rudin-Shapiro-Like Sequences with Maximum Asymptot…
A family of binary sequences is presented and proved to have optimal correlation property and large linear span. It includes the small set of Kasami sequences, No sequence set and TN sequence set as special cases. An explicit lower bound…
We investigate the ratio asymptotic behavior of the sequence $(Q_{n})_{n=0}^{\infty}$ of multiple orthogonal polynomials associated with a Nikishin system of $p\geq 1$ measures that are compactly supported on the star-like set of $p+1$ rays…
Recently, Okounkov, Lazarsfeld and Mustata, and Kaveh and Khovanskii have shown that the growth of a graded linear series on a projective variety over an algebraically closed field is asymptotic to a polynomial. We give a complete…
The critical exponent $E(\mathbf u)$ of an infinite sequence $\mathbf u$ over a finite alphabet expresses the maximal repetition of a factor in $\mathbf u$. By the famous Dejean's theorem, $E(\mathbf u) \geq 1+\frac1{d-1}$ for every $d$-ary…
Expansion complexity and maximum order complexity are both finer measures of pseudorandomness than the linear complexity which is the most prominent quality measure for cryptographic sequences. The expected value of the $N$th maximum order…
In signal processing the Rudin-Shapiro polynomials have good autocorrelation properties and their values on the unit circle are small. Binary sequences with low autocorrelation coefficients are of interest in radar, sonar, and communication…
We show that polynomials associated with automatic sequences satisfy a certain recurrence relation when evaluated at a root of unity, which generalizes a result of Brillhart, Lomont and Morton on the Rudin--Shapiro polynomials. We study the…
In this paper we study almost $p$-ary sequences and their autocorrelation coefficients. We first study the number $\ell$ of distinct out-of-phase autocorrelation coefficients for an almost $p$-ary sequence of period $n+s$ with $s$…
Let $q$ be any prime power and let $d$ be a positive integer greater than 1. In this paper, we construct a family of $M$-ary sequences of period $q-1$ from a given $M$-ary, with $M|q-1$, Sidelikov sequence of period $q^d-1$. Under mild…
Stanley and Odlyzko proposed a method for greedily constructing sets with no 3-term arithmetic progressions. It is conjectured that there is a dichotomy between such sequences: those that have a periodic structure as the sequence satisfies…
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…
For the Riesz and logarithmic energies, we consider a greedy sequence $(a_n)_{n=0}^\infty$ of points on the unit circle $S^1$ constructed in such a way that for every integer $N\geq 2$, the energy of the configuration…
The merit factor problem is of practical importance to manifold domains, such as digital communications engineering, radars, system modulation, system testing, information theory, physics, chemistry. However, the merit factor problem is…
We introduce the sequence $(i_n)_{n \geq 0}$ defined by $i_n = (-1)^{inv_2(n)}$, where $inv_2(n)$ denotes the number of inversions (i.e., occurrences of 10 as a scattered subsequence) in the binary representation of n. We show that this…
In the proof of the irrationality of $\zeta(3)$ and $\zeta(2)$, Ap\'ery defined two integer sequences through $3$-term recurrences, which are known as the famous Ap\'ery numbers. Zagier, Almkvist--Zudilin and Cooper successively introduced…
We study the autocorrelation coefficients of the Rudin-Shapiro polynomials, proving in particular that their maximum on the interval $[1, 2^n)$ is bounded from below by $C_1 2^{\alpha n}$ and is bounded from above by $C_2 2^{\alpha' n}$…
In this paper we present a new family of discrete sequences having "random like" uniformly decaying auto-correlation properties. The new class of infinite length sequences are higher order chirps constructed using irrational numbers.…
In this paper, we study the sequences with (non-consecutive) two zero-symbols and ideal autocorrelation, which are also known as almost $m$-ary nearly perfect sequences. We show that these sequences are equivalent to $\ell$-partial direct…
Monadic second order logic can be used to express many classical notions of sets of vertices of a graph as for instance: dominating sets, induced matchings, perfect codes, independent sets or irredundant sets. Bounds on the number of sets…
An integer sequence is said to be 3-free if no three elements form an arithmetic progression. Following the greedy algorithm, the Stanley sequence $S(a_0,a_1,\ldots,a_k)$ is defined to be the 3-free sequence $\{a_n\}$ having initial terms…