Papers
Topics
Authors
Recent
Search
2000 character limit reached

Algebra, selections, and additive Ramsey theory

Published 28 Jul 2014 in math.GN, math.CO, and math.LO | (1407.7437v5)

Abstract: Hindman's celebrated Finite Sums Theorem, and its high-dimensional version due to Milliken and Taylor, are extended from covers of countable sets to covers of arbitrary topological spaces with Menger's classic covering property. The methods include, in addition to Hurewicz's game theoretic characterization of Menger's property, extensions of the classic idempotent theory in the Stone--Czech compactification of semigroups, and of the more recent theory of selection principles. This provides strong versions of the mentioned celebrated theorems, where the monochromatic substructures are large, beyond infinitude, in an analytic sense. Reducing the main theorems to the purely combinatorial setting, we obtain nontrivial consequences concerning uncountable cardinal characteristics of the continuum. The main results, modulo technical refinements, are of the following type (definitions provided in the main text): Let $X$ be a Menger space, and $\mathcal{U}$ be an infinite open cover of $X$. Consider the complete graph, whose vertices are the open sets in $X$. For each finite coloring of the vertices and edges of this graph, there are disjoint finite subsets $\mathcal{F}1,\mathcal{F}_2,\dots$ of the cover $\mathcal{U}$ whose unions $V_1 := \bigcup\mathcal{F}_1, V_2 := \bigcup\mathcal{F}_2,\dots$ have the following properties: 1. The sets $\bigcup{n\in F}V_n$ and $\bigcup_{n\in H}V_n$ are distinct for all nonempty finite sets $F<H$. 2. All vertices $\bigcup_{n\in F}V_n$, for nonempty finite sets $F$, are of the same color. 3. All edges $\bigl{\,\bigcup_{n\in F}V_n, \bigcup_{n\in H}V_n\,\bigr}$, for nonempty finite sets $F<H$, have the same color. 4. The family ${V_1,V_2,\dots}$ is an open cover of $X$. A self-contained introduction to the necessary parts of the needed theories is provided.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.