DeepAI AI Chat
Log In Sign Up

Discrete correlations of order 2 of generalised Rudin-Shapiro sequences: a combinatorial approach

by   Irène Marcovici, et al.

We introduce a family of block-additive automatic sequences, that are obtained by allocating a weight to each couple of digits, and defining the nth term of the sequence as being the total weight of the integer n written in base k. Under an additional difference condition on the weight function, these sequences can be interpreted as generalised Rudin-Shapiro sequences, and we prove that they have the same correlations of order 2 as sequences of symbols chosen uniformly and independently at random. The speed of convergence is very fast and is independent of the prime factor decomposition of k. This extends recent work of Tahay. The proof relies on direct observations about base-k representations of integers and combinatorial considerations. We also provide extensions of our results to higher-dimensional block-additive sequences.


On sequences associated to the invariant theory of rank two simple Lie algebras

We study two families of sequences, listed in the On-Line Encyclopedia o...

Quadratic sequences with prime power discriminators

The discriminator of an integer sequence s = (s(i))_i ≥ 0, introduced by...

Emergence of functional information from multivariate correlations

The information content of symbolic sequences (such as nucleic- or amino...

A Combinatorial Interpretation for the Shor-Laflamme Weight Enumerators of CWS Codes

We show that one of the Shor-Laflamme weight enumerators of a codeword s...

Shift-Inequivalent Decimations of the Sidelnikov-Lempel-Cohn-Eastman Sequences

We consider the problem of finding maximal sets of shift-inequivalent de...

Covariance within Random Integer Compositions

Fix a positive integer N. Select an additive composition ξ of N uniforml...

On Discovering Interesting Combinatorial Integer Sequences

We study the problem of generating interesting integer sequences with a ...