Archives
Keywords
Foundations middle diamond ccc Kurepa Hypothesis Uniformly coherent Axiom R Erdos-Hajnal graphs Rado's conjecture b-scale Hedetniemi's conjecture Non-saturation Forcing Axioms Strongly compact cardinal L-space Ramsey theory over partitions super-Souslin tree free Boolean algebra Closed coloring Vanishing levels Martin's Axiom Souslin Tree Postprocessing function HOD Sierpinski's onto mapping principle Precaliber Ulam matrix Absoluteness Rock n' Roll Dushnik-Miller Universal Sequences transformations Strong coloring Large Cardinals Subadditive Reflecting stationary set stick Iterated forcing club_AD Generalized descriptive set theory Was Ulam right Filter reflection Reduced Power Square-Brackets Partition Relations Diamond Amenable C-sequence Jonsson cardinal Well-behaved magma Shelah's Strong Hypothesis square principles Greatly Mahlo specializable Souslin tree P-Ideal Dichotomy very good scale Chang's conjecture Forcing free Souslin tree square Cardinal Invariants weak Kurepa tree Generalized Clubs Ascent Path Subtle tree property Respecting tree Antichain weak square weak diamond Chromatic number sap Strongly Luzin set Open Access Hindman's Theorem Coherent tree Dowker space Whitehead Problem Singular Density tensor product graph nonmeager set Subtle cardinal Luzin set Commutative projection system OCA Fodor-type reflection strongly bounded groups Diamond-sharp Constructible Universe Successor of Singular Cardinal Fat stationary set full tree Cardinal function Selective Ultrafilter PFA(S)[S] Cohen real Sakurai's Bell inequality Analytic sets Distributive tree Erdos Cardinal ZFC construction stationary hitting countably metacompact Ostaszewski square AIM forcing Hereditarily Lindelöf space PFA reflection principles Prevalent singular cardinals unbounded function approachability ideal GMA O-space S-Space diamond star Mandelbrot set indecomposable ultrafilter Slim tree Sigma-Prikry SNR Knaster xbox Knaster and friends C-sequence Countryman line Almost countably chromatic Fast club 54G20 Successor of Regular Cardinal Weakly compact cardinal Diamond for trees Almost Souslin stationary reflection projective Boolean algebra coloring number Local Club Condensation. incompactness Intersection model Subnormal ideal Uniformization positive partition relation polarized partition relation Partition Relations Almost-disjoint family Aronszajn tree Prikry-type forcing Small forcing Poset Club Guessing higher Baire space Parameterized proxy principle Minimal Walks Singular cardinals combinatorics Singular cofinality Uniformly homogeneous Ineffable cardinal Rainbow sets Microscopic Approach Commutative cancellative semigroups Lipschitz reduction Nonspecial tree regressive Souslin tree
Tag Archives: square
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
Knaster and friends III: Subadditive colorings
Joint work with Chris Lambie-Hanson. Abstract. We continue our study of strongly unbounded colorings, this time focusing on subadditive maps. In Part I of this series, we showed that, for many pairs of infinite cardinals $\theta < \kappa$, the existence … 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
Knaster and friends II: The C-sequence number
Joint work with Chris Lambie-Hanson. Abstract. Motivated by a characterization of weakly compact cardinals due to Todorcevic, we introduce a new cardinal characteristic, the C-sequence number, which can be seen as a measure of the compactness of a regular uncountable … 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
Knaster and friends I: Closed colorings and precalibers
Joint work with Chris Lambie-Hanson. Abstract. The productivity of the $\kappa$-chain condition, where $\kappa$ is a regular, uncountable cardinal, has been the focus of a great deal of set-theoretic research. In the 1970s, consistent examples of $\kappa$-cc posets whose squares … Continue reading
A forcing axiom deciding the generalized Souslin Hypothesis
Joint work with Chris Lambie-Hanson. Abstract. We derive a forcing axiom from the conjunction of square and diamond, and present a few applications, primary among them being the existence of super-Souslin trees. It follows that for every uncountable cardinal $\lambda$, … Continue reading
Posted in Publications, Souslin Hypothesis
Tagged 03E05, 03E35, 03E57, Diamond, Forcing Axioms, Souslin Tree, square, super-Souslin tree
1 Comment
Reflection on the coloring and chromatic numbers
Joint work with Chris Lambie-Hanson. Abstract. We prove that reflection of the coloring number of graphs is consistent with non-reflection of the chromatic number. Moreover, it is proved that incompactness for the chromatic number of graphs (with arbitrarily large gaps) … Continue reading
Posted in Compactness, Infinite Graphs, Publications
Tagged 03E35, 05C15, 05C63, Chang's conjecture, Chromatic number, coloring number, Fodor-type reflection, incompactness, Iterated forcing, Parameterized proxy principle, Postprocessing function, Rado's conjecture, square, stationary reflection
2 Comments
The reflection principle $R_2$
A few years ago, in this paper, I introduced the following reflection principle: Definition. $R_2(\theta,\kappa)$ asserts that for every function $f:E^\theta_{<\kappa}\rightarrow\kappa$, there exists some $j<\kappa$ for which the following set is nonstationary: $$A_j:=\{\delta\in E^\theta_\kappa\mid f^{-1}[j]\cap\delta\text{ is nonstationary}\}.$$ I wrote there … Continue reading
Posted in Blog
Tagged reflection principles, square, stationary reflection, Weakly compact cardinal
Leave a comment
