Canonical Theorems for Colored Integers with Respect to Some Linear Combinations
From MaRDI portal
(Redirected from Publication:6188519)
Abstract: Hindman proved in 1979 that no matter how natural numbers are colored in r colors, for a fixed positive integer r, there is an infinite subset X of numbers and a color t such that for any finite non-empty subset X' of X, the color of the sum of elements from X' is t. Later, Taylor extended this result to colorings with unrestricted number of colors and five unavoidable color patterns on finite sums. This result is referred to as a canonization of Hindman's theorem and parallels the Canonical Ramsey Theorem of Erdos and Rado. We extend Taylor's result from sums, that are linear combinations with coefficients 1, to several linear combinations with coefficients 1 and -1. These results in turn could be interpreted as canonical-type theorems for solutions to infinite systems.
Recommendations
Cites work
- A canonical partition relation for finite subsets of
- A canonical version for partition regular systems of linear equations
- A Combinatorial Theorem
- Finite sums from sequences within cells of a partition of N
- scientific article; zbMATH DE number 3675978 (Why is no real title available?)
- scientific article; zbMATH DE number 6281797 (Why is no real title available?)
- scientific article; zbMATH DE number 3343717 (Why is no real title available?)
- Image Partition Regularity of Matrices
- Partitionen und lineare Gleichungssysteme
- Ramsey's theorem with sums or unions
- Studien zur Kombinatorik
This page was built for publication: Canonical Theorems for Colored Integers with Respect to Some Linear Combinations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6188519)