arXiv (All)
open access
Uniform Factor-Balancedness in Arnoux-Rauzy Words
We characterize uniform factor-balancedness in Arnoux-Rauzy words, generalizing the work of Espinoza, Popoli, and Stipulanti on ternary alphabets to finite alphabets of any size. In particular, we prove that an Arnoux-Rauzy word $\mathbf{x}$ is uniformly factor-balanced if and only if $\mathbf{x}$ h
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
- Avoiding patterns with three distinct letters in Canon permutations#821487
- Synchronization Strings over the Optimal Alphabet#984257
- On the Number of Words of Length $N$ over a Three-Letter Alphabet#1104932
- The Density of Symbol Systems – A Critique of Nelson Goodman’s Notion#725284
- The Logical Space of Democracy#748782
Record · ID 1118992
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