Canonizing partition theorems: Diversification, products, and iterated versions

DOI10.1016/0097-3165(85)90096-2zbMath0577.05006OpenAlexW2062450170MaRDI QIDQ1065802

Bernd Voigt

Publication date: 1985

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(85)90096-2

zbMATH Keywords

partitionsarithmetic progressionsFinite sets

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05) Elementary theory of partitions (11P81)

Related Items (5)

Hereditary attributes of surjections and parameter sets ⋮ Nondiversity in substructures ⋮ A dual form of Erdős-Rado's canonization theorem ⋮ Canonizing Ramsey theorems for finite graphs and hypergraphs ⋮ A canonical version for partition regular systems of linear equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Canonization theorems for finite affine and linear spaces
• Canonical partition theorems for parameter sets
• A canonical partition theorem for equivalence relations on \(Z^ n\).
• Recent results in partition (Ramsey) theory for finite lattices
• On van der Waerden's theorem on arithmetic progressions
• Mappings of subspaces into subsets
• Canonical configurations
• Subspaces, subsets, and partitions
• Ramsey's theorem for a class of categories
• A Combinatorial Theorem
• On the representation of lattices
• Direct Decomposition of Partitions

This page was built for publication: Canonizing partition theorems: Diversification, products, and iterated versions