On the maximal autocorrelation of Rudin-Shapiro sequences

02/11/2022
by   Daniel Tarnu, et al.
0

In this paper, we prove that the maximal aperiodic autocorrelation of the m-th Rudin-Shapiro sequence is of the same order as λ^m, where λ is the real root of x^3 + x^2 - 2x - 4. This proof was developed independently of the recently published proof given by Katz and van der Linden (2021). A proof of this result for the related periodic autocorrelation is given by Allouche, Choi, Denise, Erdélyi, and Saffari (2019) and Choi (2020) using a translation of the problem into linear algebra. Our approach modifies this linear algebraic translation to deal with aperiodic autocorrelation and provides an alternative method of dealing with the computations given by Choi.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/31/2019

A note on commutative Kleene algebra

In this paper we present a detailed proof of an important result of alge...
research
06/29/2018

Proof-of-work certificates that can be efficiently computed in the cloud

In an emerging computing paradigm, computational capabilities, from proc...
research
10/12/2021

Algebra of Data Reconciliation

With distributed computing and mobile applications becoming ever more pr...
research
09/24/2019

Completely uniformly distributed sequences based on de Bruijn sequences

We study a construction published by Donald Knuth in 1965 yielding a com...
research
03/14/2022

On the Skolem Problem for Reversible Sequences

Given an integer linear recurrence sequence ⟨ X_n ⟩_n, the Skolem Proble...
research
07/27/2018

Tropical recurrent sequences

Tropical recurrent sequences are introduced satisfying a given vector (b...
research
01/17/2021

A bi-directional extensible interface between Lean and Mathematica

We implement a user-extensible ad hoc connection between the Lean proof ...

Please sign up or login with your details

Forgot password? Click here to reset