arXiv (All)
open access
Enumerating pattern-avoiding translation-invariant total orders
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 bi
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Conway Symbols of Frieze Patterns of Dynkin Types#1084852
- Computing Bogomolov multipliers and finitary Bogomolov multipliers of infinite groups#1050062
- The insertion encoding of Cayley permutations#179156
- The sequence alignment problem: boundary conditions as the unifying principle.#301593
- On permutation-invariant construction of glued lattices#1034926
Record · ID 1061292
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive