Corpus ID: 39510517

A Generalization of Schur's Theorem

@article{Sanders1968AGO,
  title={A Generalization of Schur's Theorem},
  author={J. Sanders},
  journal={arXiv: Combinatorics},
  year={1968}
}
  • J. Sanders
  • Published 1968
  • Mathematics, Computer Science
  • arXiv: Combinatorics
This paper is an excerpt from the author's 1968 PhD dissertation [Yale University, 1968] in which the (now) well-known result, commonly known as the Folkman-Rado-Sanders theorem, is proved. The proof uses (finite) alternating sums of integers and an 'iterated Ramsey theorem' in a way analogous to the proof of Schur's theorem using differences of integers and Ramsey's theorem for the coloring of the edges of a complete graph. The proof predates all others except J. Folkman, who based his proof… Expand
Transfinite approximation of Hindman’s theorem
Hindman’s Theorem states that in any finite coloring of the integers, there is an infinite set all of whose finite sums belong to the same color. This is much stronger than the finite analogueExpand
SUPERFILTERS, RAMSEY THEORY, AND VAN DER WAERDEN'S THEOREM
Abstract Superfilters are generalizations of ultrafilters, and capture the underlying concept in Ramsey-theoretic theorems such as van der Waerden's Theorem. We establish several properties ofExpand
Quantitative Forms of a Theorem of Hilbert
TLDR
Hilbert needed this lemma in connection with certain results on the irreducibility of rational functions and never pursued the combinatorial directions to which it pointed, but others did, and in 1974, Hindman proved the much stronger result that in any partition of all the positive integers into finitely many classes, some class must contain an infinite projective cube. Expand
Ramsey Algebras and Ramsey Spaces
Hindman’s theorem says that every finite coloring of the natural numbers has a monochromatic set of finite sums. Galvin and Glazer gave a brilliant simple proof of Hindman’s theorem using idempotentExpand
A Note on Hindman-Type Theorems for Uncountable Cardinals
TLDR
It is shown how a family of natural Hindman-type theorems for uncountable cardinals can be obtained by adapting some recent results of the author from their original countable setting. Expand
OLD AND NEW PROBLEMS AND RESULTS IN COMBINATORIAL NUMBER THEORY : van der WAERDEN'S THEOREM AND RELATED TOPICS
The present paper represents essentially a chapter in a forthcoming "Monographie" in the l Enseignement Mathématique series i ) with the title "Old and new problems and results in combinatorialExpand
Partition regular polynomial patterns in commutative semigroups
In 1933 Rado characterized all systems of linear equations with rational coefficients which have a monochromatic solution whenever one finitely colors the natural numbers. A natural follow-up problemExpand
Numbers and Topologies : Two Aspects of Ramsey Theory
In graph Ramsey theory, Burr and Erdős in 1970s posed two conjectures which may be considered as initial steps toward the problem of characterizing the set of graphs for which Ramsey numbers growExpand
Solvability of Rado systems in D-sets
Abstract Rado's Theorem characterizes the systems of homogeneous linear equations having the property that for any finite partition of the positive integers one cell contains a solution to theseExpand
Ramsey Theory on the Integers
Preliminaries Van der Waerden's theorem Supersets of $AP$ Subsets of $AP$ Other generalizations of $w(k r)$ Arithmetic progressions (mod $m$) Other variations on van der Waerden's theorem Schur'sExpand
...
1
2
3
...

References

Uber die Kongruenz x + y = z (mod p), Jahresbericht der Deut
  • Mathematiker-Vereiningung, Band
  • 1916