Un teorema de Ramsey para los enteros
We find all linear orders $L,L_2$ such that $L\to(\mathbb Z,L_2)^2$. The key is the identification of the orders $L$ such that $L\to(\mathbb Z,\mathbb Z)^1$.
math.LO↗
arXiv subjects
Andrés Eduardo Caicedo
Publications and source records attributed to Andrés Eduardo Caicedo.
Coloring the $n$-smooth numbers with $n$ colors
For which values of $n$ can we color the positive integers with precisely $n$ colors in such a way that for any $a$, the numbers $a,2a,\dots,na$ all get different colors? Pach posed the question around 2008-9. Particular cases appeared in KöMaL in April 2010, and the general version appeared in May 2010 on MathOverflow, posted by Pálvölgyi. The question remains open. We discuss the known partial results and investigate a series of related matters attempting to understand the structure of these $n$-satisfactory colorings. Specifically, we show that there is an $n$-satisfactory coloring whenever there is an abelian group operation $\oplus$ on the set $\{1,2,\dots,n\}$ compatible with multiplication in the sense that whenever $i$, $j$ and $ij$ are in $\{1,\dots,n\}$, then $ij=i\oplus j$. This includes in particular the cases where $n+1$ is prime, or $2n+1$ is prime, or $n=p^2-p$ for some prime $p$, or there is a $k$ such that $q=nk+1$ is prime and $1^k,\dots,n^k$ are all distinct modulo $q$ (in which case we call $q$ a strong representative of order $n$). The colorings obtained by this process we call multiplicative. We also show that nonmultiplicative colorings exist for some values of $n$. There is an $n$-satisfactory coloring of $\mathbb Z^+$ if and only if there is such a coloring of the set $K_n$ of $n$-smooth numbers. We identify all $n$-satisfactory colorings for $n\le 5$ and all multiplicative colorings for $n\le 8$, and show that there are as many nonmultiplicative colorings of $K_n$ as there are real numbers for $n=6$ and 8. We show that if $n$ admits a strong representative $q$ then the set of such $q$ has positive natural density in the set of all primes. We show that the question of whether there is an $n$-satisfactory coloring is equivalent to a problem about tilings, and use this to give a geometric characterization of multiplicative colorings.
math.NT↗
Inner-model reflection principles
We introduce and consider the inner-model reflection principle, which asserts that whenever a statement $φ(a)$ in the first-order language of set theory is true in the set-theoretic universe $V$, then it is also true in a proper inner model $W\subsetneq V$. A stronger principle, the ground-model reflection principle, asserts that any such $φ(a)$ true in $V$ is also true in some non-trivial ground model of the universe with respect to set forcing. These principles each express a form of width reflection in contrast to the usual height reflection of the Lévy-Montague reflection theorem. They are each equiconsistent with ZFC and indeed $Π_2$-conservative over ZFC, being forceable by class forcing while preserving any desired rank-initial segment of the universe. Furthermore, the inner-model reflection principle is a consequence of the existence of sufficient large cardinals, and lightface formulations of the reflection principles follow from the maximality principle MP and from the inner-model hypothesis IMH. We also consider some questions concerning the expressibility of the principles.
math.LO↗
Of puzzles and partitions: Introducing Partiti
We introduce Partiti, the puzzle that will run in Mathematics Magazine in 2018, and use the opportunity to recall some basic properties of integer partitions.
math.HO↗
Topological Ramsey numbers and countable ordinals
We study the topological version of the partition calculus in the setting of countable ordinals. Let $α$ and $β$ be ordinals and let $k$ be a positive integer. We write $β\to_{top}(α,k)^2$ to mean that, for every red-blue coloring of the collection of 2-sized subsets of $β$, there is either a red-homogeneous set homeomorphic to $α$ or a blue-homogeneous set of size $k$. The least such $β$ is the topological Ramsey number $R^{top}(α,k)$. We prove a topological version of the Erdős-Milner theorem, namely that $R^{top}(α,k)$ is countable whenever $α$ is countable. More precisely, we prove that $R^{top}(ω^{ω^β},k+1)\leqω^{ω^{β\cdot k}}$ for all countable ordinals $β$ and finite $k$. Our proof is modeled on a new easy proof of a weak version of the Erdős-Milner theorem that may be of independent interest. We also provide more careful upper bounds for certain small values of $α$, proving among other results that $R^{top}(ω+1,k+1)=ω^k+1$, $R^{top}(α,k)< ω^ω$ whenever $α<ω^2$, $R^{top}(ω^2,k)\leqω^ω$ and $R^{top}(ω^2+1,k+2)\leqω^{ω\cdot k}+1$ for all finite $k$. Our computations use a variety of techniques, including a topological pigeonhole principle for ordinals, considerations of a tree ordering based on the Cantor normal form of ordinals, and some ultrafilter arguments.
math.LO↗
Downward transference of mice and universality of local core models
If M is a proper class inner model of ZFC and omega_2^M=omega_2, then every sound mouse projecting to omega and not past 0-pistol belongs to M. In fact, under the assumption that 0-pistol does not belong to M, K^M \| omega_2 is universal for all countable mice in V. Similarly, if M is a proper class inner model of ZFC, delta>omega_1 is regular, (delta^+)^M = delta^+, and in V there is no proper class inner model with a Woodin cardinal, then K^M \| delta is universal for all mice in V of cardinality less than delta.
math.LO↗
Square principles in Pmax extensions
By forcing with $\mathbb{P}_{\rm max}$ over strong models of determinacy, we obtain models where different square principles at $ω_2$ and $ω_3$ fail. In particular, we obtain a model of $2^{\aleph_0}=2^{\aleph_1}=\aleph_2 + \lnot\square(ω_2) + \lnot\square(ω_3)$.
math.LO↗