Archives
Keywords
Uniformly coherent weak diamond Greatly Mahlo Universal Sequences SNR Dushnik-Miller Club Guessing Closed coloring weak square O-space Absoluteness Rock n' Roll reflection principles Forcing Sigma-Prikry Singular Density indecomposable ultrafilter ZFC construction Jonsson cardinal Was Ulam right stationary hitting club_AD Chang's conjecture square principles Subnormal ideal Ineffable cardinal Open Access Cardinal function Hereditarily Lindelöf space Large Cardinals C-sequence Aronszajn tree Precaliber Almost countably chromatic Hindman's Theorem xbox Singular cardinals combinatorics Almost-disjoint family Constructible Universe Filter reflection Shelah's Strong Hypothesis AIM forcing Diamond for trees Ostaszewski square specializable Souslin tree Weakly compact cardinal Ulam matrix tensor product graph Dowker space 54G20 Knaster S-Space P-Ideal Dichotomy Ramsey theory over partitions very good scale Cohen real Minimal Walks diamond star Lipschitz reduction Selective Ultrafilter Nonspecial tree Singular cofinality Analytic sets Amenable C-sequence Almost Souslin Strong coloring Knaster and friends Commutative cancellative semigroups Hedetniemi's conjecture Generalized descriptive set theory nonmeager set Rainbow sets free Boolean algebra GMA approachability ideal Rado's conjecture full tree transformations Erdos-Hajnal graphs higher Baire space Martin's Axiom incompactness countably metacompact Whitehead Problem super-Souslin tree Distributive tree Poset Sierpinski's onto mapping principle Small forcing Slim tree Uniformization sap square Postprocessing function HOD Sakurai's Bell inequality Prikry-type forcing Souslin Tree Prevalent singular cardinals Subadditive weak Kurepa tree Strongly Luzin set Reduced Power Erdos Cardinal Reflecting stationary set Subtle cardinal L-space Fat stationary set Cardinal Invariants stick coloring number Non-saturation Parameterized proxy principle Microscopic Approach Antichain Well-behaved magma Coherent tree b-scale Forcing Axioms ccc middle diamond Partition Relations Foundations PFA(S)[S] Fodor-type reflection projective Boolean algebra strongly bounded groups unbounded function PFA Chromatic number Generalized Clubs Square-Brackets Partition Relations Successor of Singular Cardinal Kurepa Hypothesis Diamond-sharp regressive Souslin tree polarized partition relation OCA Iterated forcing free Souslin tree Subtle tree property Luzin set Mandelbrot set Uniformly homogeneous Axiom R Local Club Condensation. Vanishing levels Ascent Path positive partition relation Diamond Successor of Regular Cardinal stationary reflection Fast club
Category Archives: Preprints
Diamond on Kurepa trees
Joint work with Ziemek Kostana and Saharon Shelah. Abstract. We introduce a new weak variation of diamond that is meant to only guess the branches of a Kurepa tree. We demonstrate that this variation is considerably weaker than diamond by … Continue reading
Posted in Preprints, Squares and Diamonds
Tagged Diamond, Diamond for trees, Iterated forcing, Kurepa Hypothesis, weak Kurepa tree
Comments Off on Diamond on Kurepa trees
Proxy principles in combinatorial set theory
Joint work with Ari Meir Brodsky and Shira Yadai. Abstract. The parameterized proxy principles were introduced by Brodsky and Rinot in a 2017 paper as new foundations for the construction of $\kappa$-Souslin trees in a uniform way that does not … Continue reading
Posted in Preprints, Souslin Hypothesis
Tagged C-sequence, free Souslin tree, Parameterized proxy principle, Souslin Tree, specializable Souslin tree, square principles, xbox
Comments Off on Proxy principles in combinatorial set theory
Squares, ultrafilters and forcing axioms
Joint work with Chris Lambie-Hanson and Jing Zhang. Abstract. We study the interplay of the three families of combinatorial objects or principles. Specifically, we show the following. Strong forcing axioms, in general incompatible with the existence of indexed squares, can … Continue reading
Posted in Compactness, Preprints
Tagged Forcing Axioms, indecomposable ultrafilter, Subadditive, unbounded function
Comments Off on Squares, ultrafilters and forcing axioms
The vanishing levels of a tree
Joint work with Shira Yadai and Zhixing You. Abstract. We initiate the study of the spectrum $Vspec(\kappa)$ of sets that can be realized as the vanishing levels $V(\mathbf T)$ of a normal $\kappa$-tree $\mathbf T$. The latter is an invariant in … Continue reading
Posted in Preprints, Souslin Hypothesis
Tagged Almost-disjoint family, C-sequence, Coherent tree, Parameterized proxy principle, regressive Souslin tree, Subtle tree property, Uniformly homogeneous, Vanishing levels
Comments Off on The vanishing levels of a tree
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
Posted in Preprints, Souslin Hypothesis
Tagged Diamond for trees, full tree, Greatly Mahlo, Microscopic Approach, Parameterized proxy principle, Subtle cardinal, tensor product graph
Comments Off on Full Souslin trees at small cardinals
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, 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, Preprints
Tagged 03E02, 03E75, 20A15, 20E15, 20F06, Jonsson cardinal, Strong coloring, strongly bounded groups, Subadditive, ZFC construction
2 Comments
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
Posted in Preprints, Squares and Diamonds
Tagged Club Guessing
Comments Off on A club guessing toolbox I