English
Related papers

Related papers: Quasi-selective and weakly Ramsey ultrafilters

200 papers

There is a long history of studying Ramsey theory using the algebraic structure of the Stone-\v{C}ech compactification of discrete semigroup. It has been shown that various Ramsey theoretic structures are contained in different algebraic…

General Topology · Mathematics 2021-08-12 Dibyendu De , Pintu Debnath , Sayan Goswami

We isolate a new class of ultrafilters on N, called "quasi-selective" because they are intermediate between selective ultrafilters and P-points. (Under the Continuum Hypothesis these three classes are distinct.) The existence of…

Logic · Mathematics 2017-12-19 Andreas Blass , Mauro Di Nasso , Marco Forti

This paper investigates properties of $\sigma$-closed forcings which generate ultrafilters satisfying weak partition relations. The Ramsey degree of an ultrafilter $\mathcal{U}$ for $n$-tuples, denoted $t(\mathcal{U},n)$, is the smallest…

Logic · Mathematics 2019-11-22 Natasha Dobrinen , Sonia Navarro Flores

We compare the strength of polychromatic and monochromatic Ramsey theory in several set-theoretic domains. We show that the rainbow Ramsey theorem does not follow from ZF, nor does the rainbow Ramsey theorem imply Ramsey's theorem over ZF.…

Logic · Mathematics 2012-05-18 Justin Palumbo

We give a partial answer to the following question of Dobrinen: For a given topological Ramsey space $\mathcal{R}$, are the notions of selective for $\mathcal{R}$ and Ramsey for $\mathcal{R}$ equivalent? Every topological Ramsey space…

Logic · Mathematics 2013-12-20 Timothy Trujillo

We give a characterizations of Ramsey ultrafilters on $\mathscr P(\omega)$ in terms of functions $f:\omega^n\to\omega$ and their ultrafilter extensions. To do this, we prove that for any partition $\mathcal P$ of $[\omega]^n$ there is a…

Logic · Mathematics 2022-03-25 N. L. Polyakov

We introduce the relation of "almost-reduction" in an arbitrary topological Ramsey space R, as a generalization of the relation of "almost-inclusion" on the space of infinite sets of natural numbers (the Ellentuck space). This leads us to a…

Logic · Mathematics 2010-08-31 Jose Mijares

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…

Combinatorics · Mathematics 2017-10-18 O. V. Petrenko , I. V. Protasov

The stable Ramsey's theorem for pairs has been the subject of numerous investigations in mathematical logic. We introduce a weaker form of it by restricting from the class of all stable colorings to subclasses of it that are non-null in a…

Logic · Mathematics 2010-10-13 Damir D. Dzhafarov

Hindman's Theorem says that every finite coloring of the positive natural numbers has a monochromatic set of finite sums. Ramsey algebras, recently introduced, are structures that satisfy an analogue of Hindman's Theorem. It is an open…

Logic · Mathematics 2016-08-04 Wen Chean Teh

Given a metric space $(X,d)$, we say that a mapping $\chi: [X]^{2}\longrightarrow\{0.1\}$ is an isometric coloring if $d(x,y)=d(z,t)$ implies $\chi(\{x,y\})=\chi(\{z,t\})$. A free ultrafilter $\mathcal{U}$ on an infinite metric space…

General Topology · Mathematics 2017-04-27 Igor Protasov , Ksenia Protasova

Ramsey's theorem states that each coloring has an infinite homogeneous set, but these sets can be arbitrarily spread out. Paul Erdos and Fred Galvin proved that for each coloring f, there is an infinite set that is "packed together" which…

Logic · Mathematics 2013-02-12 Stephen Flood

We investigate families of partitions of omega which are related to special coideals, so-called happy families, and give a dual form of Ramsey ultrafilters in terms of partitions. The combinatorial properties of these…

Logic · Mathematics 2007-05-23 Lorenz Halbeisen

Ramsey's theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set H such that all n-element subsets of H have the same color. The strength of consequences of Ramsey's theorem has…

Logic · Mathematics 2024-12-09 Ludovic Patey

A Ramsey-like theorem is a statement of the form ``For every 2-coloring of $[\mathbb{N}]^2$, there exists an infinite set~$H \subseteq \mathbb{N}$ such that $[H]^2$ avoids some pattern''. We prove that none of these statements are…

Logic · Mathematics 2026-05-12 Ahmed Mimouni , Ludovic Patey

In this thesis, we investigate the computational content and the logical strength of Ramsey's theorem and its consequences. For this, we use the frameworks of reverse mathematics and of computable reducibility. We proceed to a systematic…

Logic · Mathematics 2016-02-19 Ludovic Patey

Orderability, weak orderability and the existence of continuous weak selections on filter spaces (i.e., spaces with a single non-isolated point) and their products are discussed. We prove that a closed continuous image X of a suborderable…

General Topology · Mathematics 2017-10-19 Koichi Motooka , Dmitri Shakhmatov , Takamitsu Yamauchi

Topological Ramsey spaces are spaces which support infinite dimensional Ramsey theory similarly to the Ellentuck space. Each topological Ramsey space is endowed with a partial ordering which can be modified to a $\sigma$-closed `almost…

Logic · Mathematics 2018-05-23 Natasha Dobrinen

We present several combinatorial properties of semiselective ideals on the set of natural numbers. The continuum hypothesis implies that the complement of every selective ideal contains a selective ultrafilter, however for semiselective…

Logic · Mathematics 2026-02-04 Julián C. Cano , Carlos A. Di Prisco , Michael Hrušák

Informally, a mathematical statement is robust if its strength is left unchanged under variations of the statement. In this paper, we investigate the lack of robustness of Ramsey's theorem and its consequence under the frameworks of reverse…

Logic · Mathematics 2016-02-09 Ludovic Patey
‹ Prev 1 2 3 10 Next ›