Archives
Keywords
Analytic sets super-Souslin tree Weakly compact cardinal Reflecting stationary set Antichain C-sequence Almost Souslin PFA(S)[S] Souslin Tree Almost-disjoint family Strong coloring Club Guessing Foundations Chromatic number Knaster and friends nonmeager set Intersection model P-Ideal Dichotomy Non-saturation Commutative projection system Almost countably chromatic Precaliber Sakurai's Bell inequality Erdos Cardinal Hindman's Theorem Dushnik-Miller unbounded function Local Club Condensation. Lipschitz reduction square principles positive partition relation Sierpinski's onto mapping principle stationary reflection Interval topology on trees Ascending path Subtle tree property stick Rado's conjecture Hereditarily Lindelöf space AIM forcing Ineffable cardinal L-space Generalized descriptive set theory Singular Density Filter reflection Selective Ultrafilter diamond star Prevalent singular cardinals strongly bounded groups approachability ideal Absoluteness Knaster Successor of Singular Cardinal Cohen real Axiom R Entangled linear order Mandelbrot set tensor product graph free Boolean algebra Prikry-type forcing full tree ccc Rock n' Roll club_AD weak diamond Nonspecial tree Greatly Mahlo Diamond-sharp Generalized Clubs Subadditive Large Cardinals Monotonically far Forcing Axioms Uniformly homogeneous SNR Partition relations for trees Successor of Regular Cardinal Universal Sequences Diamond for trees Iterated forcing Strongly compact cardinal Subnormal ideal ZFC construction Diamond Uniformly coherent b-scale Cardinal Invariants projective Boolean algebra Kurepa Hypothesis xbox indecomposable filter weak square specializable Souslin tree higher Baire space weak Kurepa tree free Souslin tree Erdos-Hajnal graphs square PFA countably metacompact O-space Forcing with side conditions stationary hitting HOD Parameterized proxy principle Amenable C-sequence Whitehead Problem Constructible Universe Ostaszewski square Chang's conjecture Respecting tree Dowker space Square-Brackets Partition Relations Strongly Luzin set Ascent Path regressive Souslin tree Vanishing levels Small forcing very good scale Distributive tree Sigma-Prikry 54G20 Singular cofinality Poset Minimal Walks coloring number Well-behaved magma Fat stationary set Microscopic Approach reflection principles Fast club Closed coloring polarized partition relation perfectly normal OCA S-Space Countryman line Forcing sap Jonsson cardinal Slim tree Shelah's Strong Hypothesis Hedetniemi's conjecture Rainbow sets Reduced Power Was Ulam right? incompactness Partition Relations Open Access Cardinal function Singular cardinals combinatorics Ulam matrix Commutative cancellative semigroups Ramsey theory over partitions Coherent tree Aronszajn tree Luzin set Postprocessing function GMA Fodor-type reflection Subtle cardinal Uniformization middle diamond Martin's Axiom transformations
Category Archives: Publications
Partition relations for trees I: Incomparable trees
Joint work with Tanmay Inamdar. Abstract. Todorcevic proved that Martin’s axiom implies that every two coherent $\aleph_1$-Aronszajn trees are comparable. Here, from cardinal arithmetic assumptions, we obtain the failure of the analogous statement for higher trees. In particular, for every … Continue reading
Posted in Partition Relations, Preprints
Tagged Lipschitz reduction, Partition relations for trees
Comments Off on Partition relations for trees I: Incomparable trees
Was Ulam right? III: Indecomposable ideals
Joint work with Tanmay Inamdar. Abstract. We continue our study of Ulam’s measure problem. In contrast to our previous works, we shift our focus from measures stratified by their additivity, to measures stratified by their indecomposability. The breakthrough here is … Continue reading
A new model for all C-sequences are trivial
Joint work with Zhixing You and Jiachen Yuan. Abstract. We construct a model in which all C-sequences are trivial, yet there exists a $\kappa$-Souslin tree with full vanishing levels. This answers a question from a previous paper, and provides an … Continue reading
Posted in Compactness, Publications
Tagged Ascent Path, C-sequence, Intersection model, Souslin Tree, Subtle tree property, Vanishing levels
2 Comments
Walks on uncountable ordinals and non-structure theorems for higher Aronszajn lines
Joint work with Tanmay Inamdar. Abstract. We investigate global structural properties of linear orders of a fixed infinite size. It is classical that the countable linear orders and the continuum-sized orders exhibit contrasting behaviours. Modern results show that strong extensions … Continue reading
Posted in Basis problems, Partition Relations, Preprints
Tagged Aronszajn tree, Ascending path, Club Guessing, Countryman line, Entangled linear order, Minimal Walks, Monotonically far, Partition relations for trees, Strong coloring, Subtle tree property, Vanishing levels, ZFC construction
2 Comments
Ketonen’s question and other cardinal sins
Joint work with Zhixing You and Jiachen Yuan. Abstract. Answering a question of Ketonen from the late 1970’s, it is proved that a weakly compact cardinal carrying an indecomposable ultrafilter need not be measurable. The result is obtained by analyzing … Continue reading
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 guess only the branches of a Kurepa tree. We demonstrate that this variation is considerably weaker than diamond by … Continue reading
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
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
