Partition theorems for factorizations of ascending parameter words
From MaRDI portal
Recommendations
- Partitions of factorisations of parameter words
- Factor-complement partitions of ascending \(k\)-parameter words
- Partial words and the critical factorization theorem
- Partial words and the critical factorization theorem revisited
- Partition Theorems for Spaces of Variable Words
- Partition theorems for left and right variable words
- Partitioned factors in Christoffel and Sturmian words
- Variety and multiplicity for partitioned factors in Christoffel and Sturmian words
- Graham-Rothschild parameter words and measurable partitions
- Generalized factorizations of words and their algorithmic properties
Cites work
- scientific article; zbMATH DE number 7223953 (Why is no real title available?)
- scientific article; zbMATH DE number 16107 (Why is no real title available?)
- scientific article; zbMATH DE number 43004 (Why is no real title available?)
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- A Ramsey theorem for trees
- Baire Sets of k-Parameter Words are Ramsey
- Bounds for the disjoint unions theorem
- Combinatorial Theorems on Classifications of Subsets of a Given Set
- Primitive Recursive Bounds for Van Der Waerden Numbers
- REFLECTIVE PROPERTIES OF FREE SEMIGROUPS
Cited in
(2)
This page was built for publication: Partition theorems for factorizations of ascending parameter words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292842)
