Metraipolis › archive › dc_993b2185d169

Enumerating pattern-avoiding translation-invariant total orders — arXiv:2609.25656

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.25656
License (as archived)
CC0-1.0
Archived
2026-10-08T15:55:52.918Z
SHA-256 of the archived text
8699d8cf4bbf8dc07ca27e9d051b0a90da9bec4c2e70983f5d41a1b5707323e8
Stable URL of this page
https://metraipolis.com/documento/dc_993b2185d169

How to cite

Enumerating pattern-avoiding translation-invariant total orders — arXiv:2609.25656 — arXiv (en), https://arxiv.org/abs/2609.25656 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_993b2185d169 (Metraipolis archive dc_993b2185d169, sha256 8699d8cf4bbf8dc07ca27e9d051b0a90da9bec4c2e70983f5d41a1b5707323e8)
BibTeX
@misc{dc993b2185d169,
  title = {Enumerating pattern-avoiding translation-invariant total orders — arXiv:2609.25656},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.25656},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_993b2185d169; sha256 8699d8cf4bbf8dc07ca27e9d051b0a90da9bec4c2e70983f5d41a1b5707323e8},
  year = {2026}
}

Archived text

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

Let $n$ be a positive integer. A translation-invariant total order (TITO) with period $n$ is a total order of the integers that is invariant under translations by multiples of $n$. These structures arise naturally in the study of Coxeter groups. In particular, real $n$-TITOs are in bijection with biclosed sets of positive roots of the affine symmetric group $\widetilde S_n$. Barkley and Defant recently introduced pattern avoidance for TITOs and used it to define the affine Tamari lattice. The enumeration of TITOs avoiding a single pattern of length $3$ is due to Crites and Barkley--Defant. We extend this work to TITOs avoiding two patterns. Our main results include a complete enumeration of TITOs that avoid a pair of patterns in $S_3\times S_3$, as well as of TITOs that avoid a pair $(p, q)$ with $p \in S_3 \setminus \{123, 321\}$ and $q \in S_4$. Furthermore, we provide an explicit construction of the inverse of the bijection between $312$-avoiding TITOs and noncrossing arc diagrams, thereby extending the combinatorial framework introduced by Barkley.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-23 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.25656 — 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-10-08T15:16:21.675Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).