PreprintCC0arXiv
An example of an automatic sequence with non-regular abelian complexity
Abstract
Answering a question of Madill and Rampersad, we give an example a of a $2$-automatic sequence whose abelian complexity is not $2$-regular.
Related
- Bayesian Tensor Train Kernel Machines with Automatic Model Complexity Inference
- Abelian maximal pattern complexity of two-dimensional words
- Linear-exponent bounds for the automatic complexity of rational diagonals modulo prime powers
- Analysis of Polynomial Threshold Functions on Random Regular Graphs: Computational Complexity of Detecting Noisy Random Lifts
- Defining the Crick-Franklin-Watson genes of any robot (equals a finite state machine) and defining the Shannon genetic code attached to each gene. We also define the Krohn-Rhodes complexity of any regular maximal prefix code
BibTeX
@misc{allouche2026example,
title = {{An example of an automatic sequence with non-regular abelian complexity}},
author = {Jean-Paul Allouche and Narad Rampersad and Michel Rigo and Jeffrey Shallit and Manon Stipulanti},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.03837},
eprint = {2610.03837},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.03837},
note = {CC0},
}
RIS
TY - UNPB
TI - An example of an automatic sequence with non-regular abelian complexity
AU - Jean-Paul Allouche
AU - Narad Rampersad
AU - Michel Rigo
AU - Jeffrey Shallit
AU - Manon Stipulanti
PY - 2026
DA - 2026/10/02
PB - arXiv
DO - 10.48550/arxiv.2610.03837
UR - https://arxiv.org/abs/2610.03837
AB - Answering a question of Madill and Rampersad, we give an example a of a $2$-automatic sequence whose abelian complexity is not $2$-regular.
ER -