Archives
Keywords
Selective Ultrafilter Strongly compact cardinal Ineffable cardinal Generalized descriptive set theory L-space Large Cardinals club_AD 54G20 full tree Ascending path Interval topology on trees countably metacompact middle diamond Axiom R Sakurai's Bell inequality Luzin set stationary reflection Postprocessing function P-Ideal Dichotomy Martin's Axiom Diamond-sharp Foundations Small forcing Weakly compact cardinal stationary hitting Distributive tree PFA Entangled linear order Forcing coloring number Almost countably chromatic specializable Souslin tree GMA AIM forcing Non-saturation Diamond for trees Mandelbrot set Poset Hindman's Theorem Strongly Luzin set Singular cardinals combinatorics reflection principles b-scale Analytic sets Ulam matrix S-Space Slim tree Aronszajn tree SNR Almost-disjoint family Singular cofinality Reflecting stationary set Uniformization polarized partition relation higher Baire space Respecting tree xbox Greatly Mahlo free Boolean algebra Rainbow sets Partition Relations tensor product graph Dushnik-Miller Antichain Amenable C-sequence HOD Closed coloring Partition relations for trees Lipschitz reduction free Souslin tree projective Boolean algebra Microscopic Approach indecomposable filter Absoluteness Hedetniemi's conjecture approachability ideal Subtle cardinal Countryman line Uniformly homogeneous Forcing Axioms Sierpinski's onto mapping principle Souslin Tree sap Rado's conjecture ZFC construction Singular Density Diamond Subnormal ideal Precaliber super-Souslin tree positive partition relation perfectly normal Reduced Power Commutative cancellative semigroups weak diamond Ostaszewski square Successor of Regular Cardinal Club Guessing Chang's conjecture Forcing with side conditions Square-Brackets Partition Relations Sigma-Prikry Fat stationary set Cohen real Minimal Walks Constructible Universe Dowker space Erdos-Hajnal graphs incompactness strongly bounded groups Uniformly coherent PFA(S)[S] Successor of Singular Cardinal ccc Hereditarily Lindelöf space C-sequence Jonsson cardinal Monotonically far Universal Sequences Almost Souslin Prevalent singular cardinals Cardinal Invariants Well-behaved magma Was Ulam right? Parameterized proxy principle nonmeager set Open Access Fast club Knaster Nonspecial tree Kurepa Hypothesis stick OCA Fodor-type reflection Ascent Path Coherent tree Iterated forcing Knaster and friends Filter reflection unbounded function Local Club Condensation. Subadditive regressive Souslin tree Whitehead Problem Intersection model Erdos Cardinal weak Kurepa tree square principles Prikry-type forcing weak square diamond star Cardinal function Strong coloring Rock n' Roll Shelah's Strong Hypothesis Vanishing levels transformations very good scale Subtle tree property Ramsey theory over partitions Generalized Clubs Chromatic number Commutative projection system square O-space
Category Archives: Publications
May the successor of a singular cardinal be Jonsson?
Abstract: Whether the successor of a singular cardinal can be Jónsson is a very old and famous open problem in set theory. Here, we collect necessary conditions for an affirmative answer, and put forward a list of closely-related questions in … Continue reading
Posted in Open Problems, Singular Cardinals Combinatorics
Tagged Jonsson cardinal, Open Access
1 Comment
The vanishing levels of a tree
Joint work with Shira Yadai and Zhixing You. Abstract. We initiate the study of the spectrum of sets that can be realized as the vanishing levels $V(\mathbf T)$ of a normal $\kappa$-tree $\mathbf T$. This is an invariant in the … Continue reading
Posted in Preprints, Souslin Hypothesis
Tagged Almost-disjoint family, Ascent Path, C-sequence, Coherent tree, Dowker space, Open Access, Parameterized proxy principle, regressive Souslin tree, Respecting tree, Subtle tree property, Uniformly homogeneous, Vanishing levels, weak Kurepa tree
2 Comments
Full Souslin trees at small cardinals
Joint work with Shira Yadai and Zhixing You. Abstract. A $\kappa$-tree is full if each of its limit levels omits no more than one potential branch. Kunen asked whether a full $\kappa$-Souslin tree may consistently exist. Shelah gave an affirmative … Continue reading
A counterexample related to a theorem of Komjáth and Weiss
Joint work with Rodrigo Rey Carvalho. Abstract. In a paper from 1987, Komjath and Weiss proved that for every regular topological space $X$ of character less than $\mathfrak b$, if $X\rightarrow(\text{top }{\omega+1})^1_\omega$, then $X\rightarrow(\text{top }{\alpha})^1_\omega$ for all $\alpha<\omega_1$. In addition, … Continue reading
Posted in Partition Relations, Preprints, Topology
Tagged 03E02, 54G20, Open Access, Prikry-type forcing, ZFC construction
Comments Off on A counterexample related to a theorem of Komjáth and Weiss
A Shelah group in ZFC
Joint work with Márk Poór. Abstract. In a paper from 1980, Shelah constructed an uncountable group all of whose proper subgroups are countable. Assuming the continuum hypothesis, he constructed an uncountable group $G$ that moreover admits an integer $n$ satisfying … Continue reading
Posted in Groups, Publications
Tagged 03E02, 03E75, 20A15, 20E15, 20F06, Jonsson cardinal, Open Access, Strong coloring, strongly bounded groups, Subadditive, ZFC construction
3 Comments
Sums of triples in Abelian groups
Joint work with Ido Feldman. Abstract. Motivated by a problem in additive Ramsey theory, we extend Todorcevic’s partitions of three-dimensional combinatorial cubes to handle additional three-dimensional objects. As a corollary, we get that if the continuum hypothesis fails, then for … Continue reading
A club guessing toolbox I
Joint work with Tanmay Inamdar. Abstract. Club guessing principles were introduced by Shelah as a weakening of Jensen’s diamond. Most spectacularly, they were used to prove Shelah’s ZFC bound on the power of the first singular cardinal. These principles have … Continue reading
Ramsey theory over partitions II: Negative Ramsey relations and pump-up theorems
Joint work with Menachem Kojman and Juris Steprāns. Abstract. 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 … Continue reading
