00:00:00 / 00:00:00
14 28

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 combinatorial difference condition on the weight function, these sequences can be interpreted as generalised Rudin–Shapiro sequences. We prove that these sequences have the same two-term correlations as sequences of symbols chosen uniformly and independently at random. The speed of convergence is independent of the prime factor decomposition of k. This extends work by E. Grant, J. Shallit, T. Stoll, and by P.-A. Tahay.

Information about the video

Citation data

  • DOI 10.24350/CIRM.V.19689403
  • Cite this video Stoll, Thomas (26/11/2020). On generalised Rudin-Shapiro sequences. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.19689403
  • URL https://dx.doi.org/10.24350/CIRM.V.19689403

Bibliography

  • GRANT, E., SHALLIT, J., et STOLL, T. Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences. Acta Arithmetica, 2009, vol. 140, no 4, p. 345-368. - http://dx.doi.org/10.4064/aa140-4-5
  • Tahay, P. (2020). Discrete Correlation of Order 2 of Generalized Rudin-Shapiro Sequences on Alphabets of Arbitrary Size, Uniform distribution theory, 15(1), 1-26 - https://doi.org/10.2478/udt-2020-0001
  • MARCOVICI, Irène, STOLL, Thomas, et TAHAY, Pierre-Adrien. Discrete correlations of order 2 of generalised Rudin-Shapiro sequences: a combinatorial approach. arXiv preprint arXiv:2006.13162, 2020. - https://arxiv.org/abs/2006.13162

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback