Skip to Main Content

Transactions of the American Mathematical Society

Published by the American Mathematical Society since 1900, Transactions of the American Mathematical Society is devoted to longer research articles in all areas of pure and applied mathematics.

ISSN 1088-6850 (online) ISSN 0002-9947 (print)

The 2020 MCQ for Transactions of the American Mathematical Society is 1.48.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Schreier sets in Ramsey theory
HTML articles powered by AMS MathViewer

by V. Farmaki and S. Negrepontis PDF
Trans. Amer. Math. Soc. 360 (2008), 849-880 Request permission

Abstract:

We show that Ramsey theory, a domain presently conceived to guarantee the existence of large homogeneous sets for partitions on $k$-tuples of words (for every natural number $k$) over a finite alphabet, can be extended to one for partitions on Schreier-type sets of words (of every countable ordinal). Indeed, we establish an extension of the partition theorem of Carlson about words and of the (more general) partition theorem of Furstenberg-Katznelson about combinatorial subspaces of the set of words (generated from $k$-tuples of words for any fixed natural number $k$) into a partition theorem about combinatorial subspaces (generated from Schreier-type sets of words of order any fixed countable ordinal). Furthermore, as a result we obtain a strengthening of Carlson’s infinitary Nash-Williams type (and Ellentuck type) partition theorem about infinite sequences of variable words into a theorem, in which an infinite sequence of variable words and a binary partition of all the finite sequences of words, one of whose components is, in addition, a tree, are assumed, concluding that all the Schreier-type finite reductions of an infinite reduction of the given sequence have a behavior determined by the Cantor-Bendixson ordinal index of the tree-component of the partition, falling in the tree-component above that index and in its complement below it.
References
Similar Articles
  • Retrieve articles in Transactions of the American Mathematical Society with MSC (2000): 05D10
  • Retrieve articles in all journals with MSC (2000): 05D10
Additional Information
  • V. Farmaki
  • Affiliation: Department of Mathematics, Athens University, Panepistemiopolis, Athens 157 84, Greece
  • Email: vfarmaki@math.uoa.gr
  • S. Negrepontis
  • Affiliation: Department of Mathematics, Athens University, Panepistemiopolis, Athens 157 84, Greece
  • Email: snegrep@math.uoa.gr
  • Received by editor(s): October 23, 2005
  • Published electronically: September 24, 2007
  • © Copyright 2007 American Mathematical Society
  • Journal: Trans. Amer. Math. Soc. 360 (2008), 849-880
  • MSC (2000): Primary 05D10
  • DOI: https://doi.org/10.1090/S0002-9947-07-04323-1
  • MathSciNet review: 2346474