Partition theorems for factorizations of ascending parameter words
type: Item
instance of: scholarly article
title: Partition theorems for factorizations of ascending parameter words
zbMATH Open document ID: 0927.68073
DOI: 10.1016/S0012-365X(99)90083-3
author: Willem Louw Fouché
author: L. M. Pretorious
author: C. J. Swanepoel
published in: Discrete Mathematics
publication date: 1999-11-29T00:00:00Z
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 05D10
zbMATH DE Number: 1322022
zbMATH Keywords: dynamic Ramsey theory
zbMATH Keywords: fixed rank partitions
MaRDI profile type: Publication
cites work: Combinatorial Theorems on Classifications of Subsets of a Given Set
cites work: REFLECTIVE PROPERTIES OF FREE SEMIGROUPS
cites work: Q3997075
cites work: A Ramsey theorem for trees
cites work: Q3298208
cites work: Baire Sets of k-Parameter Words are Ramsey
cites work: Q3972755
cites work: Primitive Recursive Bounds for Van Der Waerden Numbers
cites work: Q3992696
cites work: Bounds for the disjoint unions theorem
full work available at URL: s0012-365x(99)90083-3
OpenAlex ID: W4231339168
Recommended article: Partitions of factorisations of parameter words
Recommended article: Factor-complement partitions of ascending \(k\)-parameter words
Recommended article: Partial words and the critical factorization theorem
Recommended article: Partial words and the critical factorization theorem revisited
Recommended article: Partition Theorems for Spaces of Variable Words
Recommended article: Partition theorems for left and right variable words
Recommended article: Partitioned factors in Christoffel and Sturmian words
Recommended article: Variety and multiplicity for partitioned factors in Christoffel and Sturmian words
Recommended article: Graham-Rothschild parameter words and measurable partitions
Recommended article: Generalized factorizations of words and their algorithmic properties
description: scientific article; zbMATH DE number 1322022