Canonical Theorems for Colored Integers with Respect to Some Linear Combinations

DOI10.1137/21m1454195arXiv2109.10249OpenAlexW3199139785WikidataQ128905686 ScholiaQ128905686MaRDI QIDQ6188519

Hanno Lefmann, Maria A. Axenovich

Publication date: 7 February 2024

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.10249

zbMATH Keywords

canonical partitionsolutions of linear equationscoloring of integersunavoidable pattern

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81) Ramsey theory (05D10) Combinatorial aspects of packing and covering (05B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A canonical version for partition regular systems of linear equations
• Ramsey's theorem with sums or unions
• A canonical partition relation for finite subsets of \(\omega\)
• Studien zur Kombinatorik
• Finite sums from sequences within cells of a partition of N
• Partitionen und lineare Gleichungssysteme
• Image Partition Regularity of Matrices
• A Combinatorial Theorem

This page was built for publication: Canonical Theorems for Colored Integers with Respect to Some Linear Combinations