16,859 research outputs found
Ramseyan ultrafilters
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
partition-ultrafilters, which we call Ramseyan ultrafilters, are similar to
those of Ramsey ultrafilters. For example it will be shown that dual Mathias
forcing restricted to a Ramseyan ultrafilter has the same features as Mathias
forcing restricted to a Ramsey ultrafilter. Further we introduce an ordering on
the set of partition-filters and consider the dual form of some cardinal
characteristics of the continuum
The Ramsey property implies no mad families
We show that if all collections of infinite subsets of have the Ramsey
property, then there are no infinite maximal almost disjoint (mad) families.
This solves a long-standing problem going back to Mathias \cite{mathias}. The
proof exploits an idea which has its natural roots in ergodic theory,
topological dynamics, and invariant descriptive set theory: We use that a
certain function associated to a purported mad family is invariant under the
equivalence relation , and thus is constant on a "large" set. Furthermore
we announce a number of additional results about mad families relative to more
complicated Borel ideals.Comment: 10 pages; fixed a mistake in Theorem 4.
The Wonder of Colors and the Principle of Ariadne
The Principle of Ariadne, formulated in 1988 ago by Walter Carnielli
and Carlos Di Prisco and later published in 1993, is an infinitary principle that is independent of the Axiom of Choice in ZF, although it can be consistently added to
the remaining ZF axioms. The present paper surveys, and motivates, the foundational importance of the Principle of Ariadne
and proposes the Ariadne Game, showing that the Principle of Ariadne,
corresponds precisely
to a winning strategy for the Ariadne Game. Some relations to other
alternative. set-theoretical principles
are also briefly discussed
Erdos-Szekeres-type theorems for monotone paths and convex bodies
For any sequence of positive integers j_1 < j_2 < ... < j_n, the k-tuples
(j_i,j_{i + 1},...,j_{i + k-1}), i=1, 2,..., n - k+1, are said to form a
monotone path of length n. Given any integers n\ge k\ge 2 and q\ge 2, what is
the smallest integer N with the property that no matter how we color all
k-element subsets of [N]=\{1,2,..., N\} with q colors, we can always find a
monochromatic monotone path of length n? Denoting this minimum by N_k(q,n), it
follows from the seminal 1935 paper of Erd\H os and Szekeres that
N_2(q,n)=(n-1)^q+1 and N_3(2,n) = {2n -4\choose n-2} + 1. Determining the other
values of these functions appears to be a difficult task. Here we show that
2^{(n/q)^{q-1}} \leq N_3(q,n) \leq 2^{n^{q-1}\log n}, for q \geq 2 and n \geq
q+2. Using a stepping-up approach that goes back to Erdos and Hajnal, we prove
analogous bounds on N_k(q,n) for larger values of k, which are towers of height
k-1 in n^{q-1}. As a geometric application, we prove the following extension of
the Happy Ending Theorem. Every family of at least M(n)=2^{n^2 \log n} plane
convex bodies in general position, any pair of which share at most two boundary
points, has n members in convex position, that is, it has n members such that
each of them contributes a point to the boundary of the convex hull of their
union.Comment: 32 page
Ramsey numbers for partially-ordered sets
We present a refinement of Ramsey numbers by considering graphs with a
partial ordering on their vertices. This is a natural extension of the ordered
Ramsey numbers. We formalize situations in which we can use arbitrary families
of partially-ordered sets to form host graphs for Ramsey problems. We explore
connections to well studied Tur\'an-type problems in partially-ordered sets,
particularly those in the Boolean lattice. We find a strong difference between
Ramsey numbers on the Boolean lattice and ordered Ramsey numbers when the
partial ordering on the graphs have large antichains.Comment: 18 pages, 3 figures, 1 tabl
- …