2009/04/13 by Vassiliki Farmaki, Farmaki, Vassiliki
Computer Science · Mathematics · #05D10 #Advanced Topology and Set Theory #Combinatorics (math.CO) #Computability, Logic, AI Algorithms #FOS: Mathematics #Limits and Structures in Graph Theory #math.CO #msc:05D10
paper · pdf · doi:10.48550/arxiv.0904.1948
arxiv created 2009/04/13 · openalex publication_date 2009/04/13 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A complete partition theory is presented for omega-located words (and omega-words), namely for located words over an infinite alphabet dominated by a fixed increasing sequence. This theory strengthens in an essential way the classical Carlson, Furstenberg-Katznelson, and Bergelson-Blass-Hindman partition theory for words over a finite alphabet. Consequences of this theory are strong simultaneous extensions of the classical Hindman, Milliken-Taylor partition theorem, and of a van der Waerden theorem for general semigroups, extending results of Hindman-Strauss and Beiglbock.