Search arXivSearch

arXiv · 1310.1827

Selective and Ramsey ultrafilters on $G$-spaces

Abstract

Let $G$ be a group, $X$ be an infinite transitive $G$-space. A free ultrafilter $\UU$ on $X$ is called $G$-selective if, for any $G$-invariant partition $\PP$ of $X$, either one cell of $\PP$ is a member of $\UU$, or there is a member of $\UU$ which meets each cell of $\PP$ in at most one point. We show (Theorem 1) that in ZFC with no additional set-theoretical assumptions there exists a $G$-selective ultrafilter on $X$, describe all $G$-spaces $X$ (Theorem 2) such that each free ultrafilter on $X$ is $G$-selective, and prove (Theorem 3) that a free ultrafilter $\UU$ on $ω$ is selective if and only if $\UU$ is $G$-selective with respect to the action of any countable group $G$ of permutations of $ω$. A free ultrafilter $\UU$ on $X$ is called $G$-Ramsey if, for any $G$-invariant coloring $χ:[G]^2 \to \{0,1\}$, there is $U\in \UU$ such that $[U]^2$ is $χ$-monochrome. By Theorem 4, each $G$-Ramsey ultrafilter on $X$ is $G$-selective. Theorems 5 and 6 give us a plenty of $\mathbb{Z}$-selective ultrafilters on $\mathbb{Z}$ (as a regular $\mathbb{Z}$-space) but not $\mathbb{Z}$-Ramsey. We conjecture that each $\mathbb{Z}$-Ramsey ultrafilter is selective.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

O. V. Petrenko, I. V. Protasov. 2013-10-07. Selective and Ramsey ultrafilters on $G$-spaces. https://doi.org/10.1215/00294527-3839090

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO