An automated approach to structure theorems for minimally repetitive rich words
math.CO
Submitted: 2026-11-10
Updated: 2026-11-10
Code: https://github.com/lgmol/Structure-Theorems-for-Rich-Words
Terminology
Sources
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality