Metraipolis › archive › dc_469dcf06fb25

Polynomial complexity, random graphs, and strict ergodicity — arXiv:2611.08973

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.08973
License (as archived)
CC0-1.0
Archived
2026-11-09T22:43:55.275Z
SHA-256 of the archived text
0bc6c65681a548d83d980a35c14df79a982b96387e33553d8a816239e60a5b52
Stable URL of this page
https://metraipolis.com/documento/dc_469dcf06fb25

How to cite

Polynomial complexity, random graphs, and strict ergodicity — arXiv:2611.08973 — arXiv (en), https://arxiv.org/abs/2611.08973 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_469dcf06fb25 (Metraipolis archive dc_469dcf06fb25, sha256 0bc6c65681a548d83d980a35c14df79a982b96387e33553d8a816239e60a5b52)
BibTeX
@misc{dc469dcf06fb25,
  title = {Polynomial complexity, random graphs, and strict ergodicity — arXiv:2611.08973},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.08973},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_469dcf06fb25; sha256 0bc6c65681a548d83d980a35c14df79a982b96387e33553d8a816239e60a5b52},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.08973. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We construct infinite words $w$ whose complexity functions are quadratically bounded, but whose discrete derivatives are not linearly bounded, resolving a question of Cassaigne. Moreover, we construct infinite words of polynomially bounded complexity, and subshifts of quasi-linear complexity, whose discrete derivatives do not decay compared to their complexity functions, thus exhibiting a typical exponentially-growing behavior. As an application, we give the first examples of subshifts of polynomial complexity whose Rauzy graphs do not have Benjamini-Schramm limits. Finally, we realize (up to an inevitable linear error factor) every function satisfying the necessary conditions, as the complexity function of a minimal, uniquely ergodic, cube-free subshift, strengthening previous realization results in this direction, and derive consequences for the growth of simple algebras and just-infinite semigroups satisfying nontrivial laws.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Dynamical Systems (math.DS) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.08973 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-09T22:36:32.162Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).