Archives
Keywords
Shelah's Strong Hypothesis Subtle cardinal Selective Ultrafilter Subadditive stationary reflection Erdos-Hajnal graphs Precaliber Hedetniemi's conjecture Prikry-type forcing OCA weak square Well-behaved magma incompactness GMA sap transformations strongly bounded groups Strong coloring Diamond for trees Square-Brackets Partition Relations Distributive tree xbox Coherent tree Iterated forcing Open Access Slim tree approachability ideal Commutative cancellative semigroups Forcing Axioms Sakurai's Bell inequality Almost-disjoint family full tree Uniformization tensor product graph Kurepa Hypothesis Uniformly coherent Knaster Rado's conjecture Chang's conjecture Ulam matrix countably metacompact Antichain Fat stationary set Singular cofinality square principles Reduced Power Chromatic number Dowker space reflection principles Sigma-Prikry Club Guessing stationary hitting Vanishing levels Axiom R Martin's Axiom Ostaszewski square diamond star Diamond-sharp projective Boolean algebra SNR Prevalent singular cardinals AIM forcing Souslin Tree Singular Density club_AD Constructible Universe Nonspecial tree Lipschitz reduction Subtle tree property Parameterized proxy principle Dushnik-Miller Absoluteness polarized partition relation Closed coloring Partition Relations Greatly Mahlo S-Space Minimal Walks free Souslin tree PFA Cardinal Invariants Singular cardinals combinatorics 54G20 very good scale b-scale Was Ulam right C-sequence Almost Souslin free Boolean algebra ZFC construction Whitehead Problem P-Ideal Dichotomy Ramsey theory over partitions Hindman's Theorem Mandelbrot set ccc Hereditarily Lindelöf space Uniformly homogeneous Non-saturation square Subnormal ideal PFA(S)[S] HOD Successor of Singular Cardinal weak diamond nonmeager set Sierpinski's onto mapping principle Reflecting stationary set Knaster and friends unbounded function Foundations Forcing middle diamond L-space Weakly compact cardinal Ascent Path Generalized Clubs super-Souslin tree Diamond Amenable C-sequence Local Club Condensation. O-space weak Kurepa tree Cardinal function Ineffable cardinal Fast club indecomposable ultrafilter Rock n' Roll Successor of Regular Cardinal Cohen real Filter reflection Aronszajn tree Fodor-type reflection Small forcing Rainbow sets Strongly Luzin set coloring number Almost countably chromatic Jonsson cardinal higher Baire space specializable Souslin tree Erdos Cardinal stick Generalized descriptive set theory Large Cardinals Postprocessing function Analytic sets Luzin set Microscopic Approach regressive Souslin tree Universal Sequences positive partition relation Poset
Tag Archives: Minimal Walks
Complicated colorings, revisited
Joint work with Jing Zhang. Abstract. In a paper from 1997, Shelah asked whether $Pr_1(\lambda^+,\lambda^+,\lambda^+,\lambda)$ holds for every inaccessible cardinal $\lambda$. Here, we prove that an affirmative answer follows from $\square(\lambda^+)$. Furthermore, we establish that for every pair $\chi<\kappa$ of … Continue reading
Strongest transformations
Joint work with Jing Zhang. Abstract. We continue our study of maps transforming high-dimensional complicated objects into squares of stationary sets. Previously, we proved that many such transformations exist in ZFC, and here we address the consistency of the strongest … Continue reading
Posted in Partition Relations, Publications
Tagged Diamond, Minimal Walks, square, Square-Brackets Partition Relations, stick, transformations, xbox
2 Comments
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
11th Young Set Theory Workshop, June 2018
I gave a 4-lecture tutorial at the 11th Young Set Theory Workshop, Lausanne, June 2018. Title: In praise of C-sequences. Abstract. Ulam and Solovay showed that any stationary set may be split into two. Is it also the case that … Continue reading
Posted in Invited Talks
Tagged Aronszajn tree, C-sequence, incompactness, Knaster, Minimal Walks, Postprocessing function, square
Leave a comment
6th European Set Theory Conference, July 2017
I gave a 3-lecture tutorial at the 6th European Set Theory Conference in Budapest, July 2017. Title: Strong colorings and their applications. Abstract. Consider the following questions. Is the product of two $\kappa$-cc partial orders again $\kappa$-cc? Does there exist … Continue reading
Posted in Invited Talks, Open Problems
Tagged b-scale, Cohen real, Luzin set, Minimal Walks, Souslin Tree, Square-Brackets Partition Relations
4 Comments
Distributive Aronszajn trees
Joint work with Ari Meir Brodsky. Abstract. Ben-David and Shelah proved that if $\lambda$ is a singular strong-limit cardinal and $2^\lambda=\lambda^+$, then $\square^*_\lambda$ entails the existence of a $\lambda$-distributive $\lambda^+$-Aronszajn tree. Here, it is proved that the same conclusion remains … Continue reading
Square with built-in diamond-plus
Joint work with Ralf Schindler. Abstract. We formulate combinatorial principles that combine the square principle with various strong forms of diamond, and prove that the strongest amongst them holds in $L$ for every infinite cardinal. As an application, we prove that … Continue reading
Posted in Publications, Squares and Diamonds
Tagged 03E05, 03E45, Almost Souslin, diamond star, Kurepa Hypothesis, Minimal Walks, square, xbox
1 Comment
Chain conditions of products, and weakly compact cardinals
Abstract. The history of productivity of the $\kappa$-chain condition in partial orders, topological spaces, or Boolean algebras is surveyed, and its connection to the set-theoretic notion of a weakly compact cardinal is highlighted. Then, it is proved that for every … Continue reading
Posted in Partition Relations, Publications
Tagged Aronszajn tree, ccc, Fat stationary set, Minimal Walks, square, Weakly compact cardinal
2 Comments
Complicated colorings
Abstract. If $\lambda,\kappa$ are regular cardinals, $\lambda>\kappa^+$, and $E^\lambda_{\ge\kappa}$ admits a nonreflecting stationary set, then $\text{Pr}_1(\lambda,\lambda,\lambda,\kappa)$ holds. (Recall that $\text{Pr}_1(\lambda,\lambda,\lambda,\kappa)$ asserts the existence of a coloring $d:[\lambda]^2\rightarrow\lambda$ such that for any family $\mathcal A\subseteq[\lambda]^{<\kappa}$ of size $\lambda$, consisting of pairwise … Continue reading
Posted in Partition Relations, Publications
Tagged Minimal Walks, Open Access, Square-Brackets Partition Relations
2 Comments
MFO workshop in Set Theory, January 2014
I gave an invited talk at the Set Theory workshop in Obwerwolfach, January 2014. Talk Title: Complicated Colorings. Abstract: If $\lambda,\kappa$ are regular cardinals, $\lambda>\kappa^+$, and $E^{\lambda}_{\ge\kappa}$ admits a nonreflecting stationary set, then $\text{Pr}_1(\lambda,\lambda,\lambda,\kappa)$ holds. Downloads: