Archives
Keywords
Fat stationary set Ineffable cardinal Club Guessing Greatly Mahlo free Boolean algebra Rado's conjecture Parameterized proxy principle OCA Commutative projection system Uniformly homogeneous Antichain Reflecting stationary set Postprocessing function Uniformly coherent Knaster Slim tree AIM forcing Cohen real Well-behaved magma Subtle tree property O-space C-sequence Chang's conjecture projective Boolean algebra Erdos-Hajnal graphs Jonsson cardinal reflection principles Was Ulam right? Hindman's Theorem Whitehead Problem Erdos Cardinal Fast club Knaster and friends middle diamond Sakurai's Bell inequality Strong coloring full tree Partition relations for trees Hereditarily Lindelöf space PFA(S)[S] weak diamond Generalized Clubs Singular cardinals combinatorics Prevalent singular cardinals weak square Subadditive Chromatic number Entangled linear order tensor product graph Aronszajn tree Filter reflection countably metacompact Ramsey theory over partitions P-Ideal Dichotomy super-Souslin tree Axiom R regressive Souslin tree Successor of Regular Cardinal stick xbox L-space Diamond for trees Almost-disjoint family Weakly compact cardinal Square-Brackets Partition Relations 54G20 Uniformization strongly bounded groups Diamond-sharp Precaliber unbounded function Cardinal function Cardinal Invariants indecomposable filter diamond star Lipschitz reduction Minimal Walks Strongly compact cardinal Non-saturation Subnormal ideal nonmeager set Souslin Tree Fodor-type reflection Sierpinski's onto mapping principle Hedetniemi's conjecture Subtle cardinal Foundations polarized partition relation free Souslin tree Almost countably chromatic Luzin set Almost Souslin transformations ZFC construction Analytic sets Countryman line SNR Singular cofinality Nonspecial tree Dushnik-Miller Sigma-Prikry positive partition relation specializable Souslin tree Strongly Luzin set HOD Kurepa Hypothesis very good scale Forcing Baumgartner's square Constructible Universe Poset Universal Sequences Ascent Path Coherent tree Closed coloring incompactness approachability ideal Amenable C-sequence Generalized descriptive set theory Singular Density perfectly normal b-scale Intersection model club_AD sap Partition Relations weak Kurepa tree PFA Selective Ultrafilter Interval topology on trees Open Access Martin's Axiom Mandelbrot set higher Baire space Vanishing levels Prikry-type forcing Large Cardinals Rainbow sets Small forcing GMA Forcing Axioms Successor of Singular Cardinal square Commutative cancellative semigroups Microscopic Approach Distributive tree stationary reflection Iterated forcing Forcing with side conditions Local Club Condensation. Dowker space Respecting tree Shelah's Strong Hypothesis S-Space square principles Absoluteness Ascending path Monotonically far coloring number Ostaszewski square stationary hitting Rock n' Roll Ulam matrix ccc Diamond Reduced Power
Tag Archives: Strong coloring
Conference in honor of Saharon Shelah’s 80th birthday
I gave an invited talk at the conference in honor of Shelah’s 80th birthday, July 2025. Talk Title: Marginalia to [Sh:365] Abstract: Solovay famously proved that every stationary subset of a regular uncountable cardinal kappa may be decomposed into kappa … Continue reading
Posted in Invited Talks
Tagged Greatly Mahlo, Strong coloring, Was Ulam right?
Comments Off on Conference in honor of Saharon Shelah’s 80th birthday
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
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
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
Ramsey theory over partitions III: Strongly Luzin sets and partition relations
Joint work with Menachem Kojman and Juris Steprāns. Abstract. 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 … Continue reading
Transformations of the transfinite plane
Joint work with Jing Zhang. Abstract. We study the existence of transformations of the transfinite plane that allow one to reduce Ramsey-theoretic statements concerning uncountable Abelian groups into classical partition relations for uncountable cardinals. To exemplify: we prove that for every … Continue reading
