Searcharxiv⌕ Search

arXiv subjects

Menachem Kojman

Publications and source records attributed to Menachem Kojman.

At least 19 recordsLinked to original sources
arXiv2022

Ramsey theory over partitions II: Negative Ramsey relations and pump-up theorems

In this series of papers we advance Ramsey theory of colorings over partitions. In this part, we concentrate on anti-Ramsey relations, or, as they are better known, strong colorings, and in particular solve two problems from [CKS21]. It is shown that for every infinite cardinal $λ$, a strong coloring on $λ^+$ by $λ$ colors over a partition can be stretched to one with $λ^{+}$ colors over the same partition. Also, a sufficient condition is given for when a strong coloring witnessing $Pr_1(\ldots)$ over a partition may be improved to witness $Pr_0(\ldots)$. Since the classical theory corresponds to the special case of a partition with just one cell, the two results generalize pump-up theorems due to Eisworth and Shelah, respectively.

math.LO↗
arXiv2022

Ramsey theory over partitions I: Positive Ramsey relations from forcing axioms

In this series of papers, we advance Ramsey theory of colorings over partitions. In this part, a correspondence between anti-Ramsey properties of partitions and chain conditions of the natural forcing notions that homogenize colorings over them is uncovered. At the level of the first uncountable cardinal this gives rise to a duality theorem under Martin's Axiom: a function $p:[ω_1]^2\rightarrowω$ witnesses a weak negative Ramsey relation when $p$ plays the role of a coloring if and only if a positive Ramsey relation holds over $p$ when $p$ plays the role of a partition. The consistency of positive Ramsey relations over partitions does not stop at the first uncountable cardinal: it is established that at any prescribed uncountable cardinal these relations follow from forcing axioms without large cardinal strength. This result solves in particular two problems from [CKS21].

math.LO↗
arXiv2022

Ramsey theory over partitions III: Strongly Luzin sets and partition relations

The strongest type of coloring of pairs of countable ordinals, gotten by Todorcevic from a strongly Luzin set, is shown to be equivalent to the existence of a nonmeager set of reals of size $\aleph_1$. In the other direction, it is shown that the existence of both a strongly Luzin set and a coherent Souslin tree is compatible with the existence of a countable partition of pairs of countable ordinals such that no coloring is strong over it. This clarifies the interaction between a gallery of coloring assertions going back to Luzin and Sierpinski a hundred years ago.

math.LO↗
arXiv2021

Strong colorings over partitions

A strong coloring on a cardinal $κ$ is a function $f:[κ]^2\to κ$ such that for every $A\subseteq κ$ of full size $κ$, every color $γ<κ$ is attained by $f\upharpoonright[A]^2$. The symbol $κ\nrightarrow [κ]^2_κ$ asserts the existence of a strong coloring on $κ$. We introduce the symbol $κ\nrightarrow_p[κ]^2_κ$ which asserts the existence of a coloring $f:[κ]^2\to κ$ which is strong over a partition $p:[κ]^2\toθ$. A coloring $f$ is strong over $p$ if for every $A\in [κ]^κ$ there is $i<θ$ so that every color $γ<κ$ is attained by $f\upharpoonright ([A]^2\cap p^{-1}(i))$. We prove that whenever $κ\nrightarrow[κ]^2_κ$ holds, also $κ\nrightarrow_p[κ]^2_κ$ holds for an arbitrary finite partition $p$. Similarly, arbitrary finite $p$-s can be added to stronger symbols which hold in any model of ZFC. If $κ^θ=κ$, then $κ\nrightarrow_p[κ]^2_κ$ and stronger symbols, like $\mathrm{Pr}_1(κ,κ,κ,χ)$ or $\mathrm{Pr}_0(κ,κ,κ,\aleph_0)$, hold also for an arbitrary partition $p$ to $θ$ parts.

math.LO↗
arXiv2015

On the arithmetic of density

The $κ$-density of a cardinal $μ\geκ$ is the least cardinality of a dense collection of $κ$-subsets of $μ$ and is denoted by $\mathcal D(μ,κ)$. The Singular Density Hypothesis (SDH) for a singular cardinal $μ$ of cofinality $cfμ=κ$ is the equation $\mathcal D(μ,κ)=μ^+$. The Generalized Density Hypothesis (GDH) for $μ$ and $λ$ such that $λ\leμ$ is: $\mathcal D(μ,λ)=μ$ if $cfμ\not=cfλ$ and $\mathcal D(μ,λ)=μ^+$ if $cfμ=cfλ$. Density is shown to satisfy Silver's theorem. The most important case is: Theorem 2.6. If $κ=cfκ<θ=cfμ<μ$ and the set of cardinals $λ<μ$ of cofinality $κ$ that satisfy the \textsf{SDH} is stationary in $μ$ then the SDH holds at $μ$. A more general version is given in Theorem 2.8 A corollary of Theorem 2.6 is: Theorem 3.2 If the Singular Density Hypothesis holds for all sufficiently large singular cardinals of some fixed cofinality $κ$, then for all cardinals $λ$ with $cfλ\ge κ$, for all sufficiently large $μ$, the GDH holds.

math.LO↗
arXiv2013

Splitting families of sets in ZFC

Miller's 1937 splitting theorem was proved for pairs of cardinals $(\n,ρ)$ in which $n$ is finite and $ρ$ is infinite. An extension of Miller's theorem is proved here in ZFC for pairs of cardinals $(ν,ρ)$ in which $ν$ is arbitrary and $ρ\ge \beth_\om(ν)$. The proof uses a new general method that is based on Shelah's revises Generalized Continuum Hypothesis theorem. Upper bounds on conflict-free coloring numbers of families of sets and a general comparison theorem follow as corollaries of the main theorem. Other corollaries eliminate the use of additional axioms from splitting theorems due to Erdos, Hajnal, Komjath, Juhasz and Shelah.

math.CO↗
arXiv2012

Noetherian type in topological products

The cardinal invariant "Noetherian type" of a topological space $X$ (Nt(X)) was introduced by Peregudov in 1997 to deal with base properties that were studied by the Russian School as early as 1976. We study its behavior in products and box-products of topological spaces. We prove in Section 2: 1) There are spaces $X$ and $Y$ such that $Nt(X \times Y) < \min\{Nt(X), Nt(Y)\}$. 2) In several classes of compact spaces, the Noetherian type is preserved by the operations of forming a square and of passing to a dense subspace. The Noetherian type of the Cantor Cube of weight $\aleph_ω$ with the countable box topology, $(2^{\aleph_ω})_δ$, is shown in Section 3 to be closely related to the combinatorics of covering collections of countable subsets of $\aleph_ω$. We discuss the influence of principles like $\square_{\aleph_ω}$ and Chang's conjecture for $\aleph_ω$ on this number and prove that it is not decidable in ZFC (relative to the consistency of ZFC with large cardinal axioms). Within PCF theory we establish the existence of an $(\aleph_4,\aleph_1)$-sparse covering family of countable subsets of $\aleph_ω$. From this follows an absolute upper bound of $\aleph_4$ on the Noetherian type of $(2^{\aleph_ω})_δ$. The proof uses ideas from Shelah's proof that if $κ^+ <λ$ then his ideal $I[λ]$ contains a stationary set consisting of points of cofinality $κ$.

math.GN↗
arXiv2005

The Threshold for Ackermannian Ramsey numbers

For a function $g:\N\to \N$, the \emph{$g$-regressive Ramsey number} of $k$ is the least $N$ so that \[N\stackrel \min \longrightarrow (k)_g\] . This symbol means: for every $c:[N]^2\to \N$ that satisfies $c(m,n)\le g(\min\{m,n\})$ there is a \emph{min-homogeneous} $H\su N$ of size $k$, that is, the color $c(m,n)$ of a pair $\{m,n\}\su H$ depends only on $\min\{m,n\}$. It is known (\cite{km,ks}) that $\id$-regressive Ramsey numbers grow in $k$ as fast as $\Ack(k)$, Ackermann's function in $k$. On the other hand, for constant $g$, the $g$-regressive Ramsey numbers grow exponentially in $k$, and are therefore primitive recursive in $k$. We compute below the threshold in which $g$-regressive Ramsey numbers cease to be primitive recursive and become Ackermannian, by proving: Suppose $g:\N\to \N$ is weakly increasing. Then the $g$-regressive Ramsey numbers are primitive recursive if an only if for every $t>0$ there is some $M_t$ so that for all $n\ge M_t$ it holds that $g(m)<n^{1/t}$ and $M_t$ is bounded by a primitive recursive function in $t$.

math.CO↗
arXiv2005

PCF Theory

This article is a very short introduction to pcf theory for topologists.

math.GN↗
arXiv2004

Almost isometric embeddings of metric spaces

We investigate a relations of almost isometric embedding and almost isometry between metric spaces and prove that with respect to these relations: (1) There is a countable universal metric space. (2) There may exist fewer than continuum separable metric spaces on aleph_1 so that every separable metric space is almost isometrically embedded into one of them when the continuum hypothesis fails. (3) There is no collection of fewer than continuum metric spaces of cardinality aleph_2 so that every ultra-metric space of cardinality aleph_2 is almost isometrically embedded into one of them if aleph_2<2^{aleph_0}. We also prove that various spaces X satisfy that if a space X is almost isometric to X than Y is isometric to X.

math.LO↗
arXiv2002

Continuous Ramsey theory on Polish spaces and covering the plane by functions

We investigate the Ramsey theory of continuous pair-colorings on complete, separable metric spaces, and apply the results to the problem of covering a plane by functions. The homogeneity number hm(c) of a pair-coloring c:[X]^2 -> 2 is the number of c-homogeneous subsets of X needed to cover X. We isolate two continuous pair-colorings on the Cantor space 2^omega, c_min and c_max, which satisfy hm(c_min)\le hm(c_max) and prove: 1. For every Polish space X and every continuous pair-coloring c:[X]^2 -> 2 with hm(c) uncountable: hm(c)= hm(c_min) or hm(c)=hm(c_max) 2. There is a model of set theory in which hm(c_min)=aleph_1 and hm(c_max)=aleph_2 (The consistency of hm(c_min) = 2^aleph0 and of hm(c_max) < 2^aleph0 is known) We prove that hm(c_min) is equal to the covering number of (2^omega)^2 by graphs of Lipschitz functions and their reflections on the diagonal. An iteration of an optimal forcing notion associated to c_min gives: There is a model of set theory in which 1. R^2 is coverable by aleph1 graphs and reflections of graphs of continuous real functions; 2. R^2 is not coverable by aleph1 graphs and reflections of graphs of Lipschitz real functions.

math.LO↗
arXiv2001

Van der Waerden spaces and Hindman spaces are not the same

A Hausdorff topological space X is van der Waerden if for every sequence (x_n)_n in X there is a converging subsequence (x_n)_{n in A} where subset A of omega contains arithmetic progressions of all finite lengths. A Hausdorff topological space X is Hindman if for every sequence (x_n)_n in X there is an IP-converging subsequence (x_n)_{n in FS(B)} for some infinite subset B of omega. We show that the continuum hypothesis implies the existence of a van der Waerden space which is not Hindman.

math.GN↗
arXiv2000

Fallen Cardinals

We prove that for every singular cardinal mu of cofinality omega, the complete Boolean algebra compP_mu(mu) contains as a complete subalgebra an isomorphic copy of the collapse algebra Comp Col(omega_1,mu^{aleph_0}). Consequently, adding a generic filter to the quotient algebra P_mu(mu)=P(mu)/[mu]^{<mu} collapses mu^{aleph_0} to aleph_1. Another corollary is that the Baire number of the space U(mu) of all uniform ultrafilters over mu is equal to omega_2. The corollaries affirm two conjectures by Balcar and Simon. The proof uses pcf theory.

math.LO↗
arXiv1998

Regressive Ramsey numbers are Ackermannian

We give an elementary proof of the fact that regressive Ramsey numbers are Ackermannian. This fact was first proved by Kanamori and McAloon with mathematical logic techniques.

math.CO↗
arXiv1997

Rules and Reals

A ``k-rule" is a sequence A=((A_n,B_n):n<omega) of pairwise disjoint sets B_n, each of cardinality at most k, where A_n is a subset of B_n. A set X of natural numbers (a ``real'') follows a rule A if for infinitely many n we have that the intersection of X with B_n is exactly A_n. There are obvious cardinal invariants resulting from this definition: the least number of reals needed to follow all k-rules, s_k, and the least number of k-rules without a real following all of them, r_k. We investigate these cardinal invariants and their connection to some well-known cardinals from Cichon's diagram. The original motivation for discovering rules was an attempt to construct a maximal homogeneous family over omega. The consistency of such a family is still open.

math.LO↗
arXiv1995

A ZFC Dowker space in $\aleph_{ω+1}$: an application of pcf theory to topology

A ZFC Dowker space is constructed which has cardinality $\aleph_{ω+1}$. This provides a bound in ZFC to the first cardinal in which there is a ZFC Dowker space. The space we construct is a closed and cofinal subspace of M.~E.~Rudin's Dowker space from 1971. A theorem from pcf theory used in the proof, but otherwise the proof is elementary.

math.LO↗