English
Related papers

Related papers: Rudin-Shapiro-Like Sequences with Maximum Asymptot…

200 papers

In this work we investigate greedy energy sequences on the unit circle for the logarithmic and Riesz potentials. By definition, if $(a_n)_{n=0}^{\infty}$ is a greedy $s$-energy sequence on the unit circle, the Riesz potential…

Classical Analysis and ODEs · Mathematics 2023-08-30 Abey López-García , Ryan E. McCleary

Following Inoue et al., we define a word to be a repetition if it is a (fractional) power of exponent at least 2. A word has a repetition factorization if it is the product of repetitions. We study repetition factorizations in several…

Formal Languages and Automata Theory · Computer Science 2023-11-30 Jeffrey Shallit , Xinhao Xu

We give a new characterization of biinfinite Sturmian sequences in terms of indistinguishable asymptotic pairs. Two asymptotic sequences on a full $\mathbb{Z}$-shift are indistinguishable if the sets of occurrences of every pattern in each…

Combinatorics · Mathematics 2021-03-18 Sebastián Barbieri , Sébastien Labbé , Štěpán Starosta

We study families of subsets of $\omega$ which are independent with respect to the asymptotic density $\mathsf{d}$. We show, for instance, that there exists a maximal $\mathsf{d}$-independent family $\mathcal{A}$ such that…

Logic · Mathematics 2026-04-01 Jonathan M. Keith , Paolo Leonetti

A sequence in the additive group ${\mathbb Z}_n$ of integers modulo $n$ is called $n$-zero-free if it does not contain subsequences with length $n$ and sum zero. The article characterizes the $n$-zero-free sequences in ${\mathbb Z}_n$ of…

Combinatorics · Mathematics 2007-05-23 Svetoslav Savchev , Fang Chen

We exhibit a three parameter infinite family of quadratic recurrence relations inspired by the well known Somos sequences. For one infinite subfamily we prove that the recurrence generates an infinite sequence of integers by showing that…

Combinatorics · Mathematics 2009-04-07 Paul Heideman , Emilie Hogan

Combining a modular approach to the $abc$ conjecture developed by the second author with the classical method of linear forms in logarithms, we obtain improved unconditional bounds for two classical problems. First, for Szpiro's conjecture…

Number Theory · Mathematics 2025-09-09 José Cuevas Barrientos , Hector Pasten

Given a sequence of real rooted polynomials $\{p_n\}_{n\geq 1}$ with a fixed asymptotic root distribution, we study the asymptotic root distribution of the repeated polar derivatives of this sequence. This limiting distribution can be seen…

Probability · Mathematics 2025-08-27 Daniel Perales , Zhiyuan Yang

Odlyzko and Stanley introduced a greedy algorithm for constructing infinite sequences with no 3-term arithmetic progressions when beginning with a finite set with no 3-term arithmetic progressions. The sequences constructed from this…

Combinatorics · Mathematics 2017-08-08 Richard Moy , Mehtaab Sawhney , David Stoner

We study the relationship between two measures of pseudorandomness for families of binary sequences: family complexity and cross-correlation measure introduced by Ahlswede et al.\ in 2003 and recently by Gyarmati et al., respectively. More…

Number Theory · Mathematics 2014-08-22 Arne Winterhof , Oğuz Yayla

Spread spectrum multiple access systems demand minimum possible cross-correlation between the sequences within a set of sequences having good auto-correlation properties. Through a connection between generalised Frank sequences and…

Information Theory · Computer Science 2023-08-10 Dan Zhang , Staal A. Vinterbo

Both the Thue-Morse and Rudin-Shapiro sequences are not suitable sequences for cryptography since their expansion complexity is small and their correlation measure of order 2 is large. These facts imply that these sequences are highly…

Number Theory · Mathematics 2020-11-09 Pierre Popoli

By using the work of Frantzikinakis and Wierdl, we can see that for all $d\in\mathbb{N}$, $\alpha\in(d,d+1)$, and integers $k\ge d+2$ and $r\ge1$, there exist infinitely many $n\in\mathbb{N}$ such that the sequence…

Number Theory · Mathematics 2021-02-16 Kota Saito , Yuuya Yoshida

We show that the family of pseudo-random matrices recently discovered by Soloveychik, Xiang, and Tarokh in their work `Symmetric Pseudo-Random Matrices' exhibits asymptotic independence. More specifically, any two sequences of matrices of…

Probability · Mathematics 2018-10-31 Ilya Soloveychik , Vahid Tarokh

We define the resurgence and asymptotic resurgence numbers associated to a pair of graded families of ideals in a Noetherian ring. These notions generalize the well-studied resurgence and asymptotic resurgence of an ideal in a polynomial…

Commutative Algebra · Mathematics 2023-09-01 Tài Huy Hà , Arvind Kumar , Hop D. Nguyen , Thai Thanh Nguyen

This article focuses on the existence of asymptotic colengths for families of $\fm_{R}$-primary ideals in a Noetherian local ring $(R,\fm)$. In any characteristic, we generalize graded families to weakly graded families of ideals, and in…

Commutative Algebra · Mathematics 2024-10-17 Sudipta Das , Cheng Meng

In this paper, we prove an asymptotic formula for the number of relatively prime pairs in the Piatetski-Shapiro sequence of arbitrarily large order. This improves the result of Pimsert, Srichan and Tangsupphathawat (2023), the order of…

Number Theory · Mathematics 2024-03-19 Yuta Suzuki

Littlewood polynomials are polynomials with each of their coefficients in {-1,1}. A sequence of Littlewood polynomials that satisfies a remarkable flatness property on the unit circle of the complex plane is given by the Rudin-Shapiro…

Complex Variables · Mathematics 2014-06-10 Tamas Erdelyi

We colour the Fibonacci sequence by suitable constant gap sequences to provide an upper bound on the asymptotic repetitive threshold of $d$-ary balanced sequences. The bound is attained for $d=2, 4$ and $8$ and we conjecture that it happens…

Combinatorics · Mathematics 2022-11-23 Lubomíra Dvořáková , Edita Pelantová

Via interleaving Ding-Helleseth-Lam sequences, a class of binary sequences of period $4p$ with optimal autocorrelation magnitude was constructed in \cite{W. Su}. Later, Fan showed that the linear complexity of this class of sequences is…

Information Theory · Computer Science 2019-05-01 Minghui Yang , Lulu Zhang , Keqin Feng