Archives
Keywords
Ascent Path Fast club Universal Sequences Commutative cancellative semigroups Partition relations for trees Strongly Luzin set sap Microscopic Approach Dushnik-Miller Distributive tree diamond star Greatly Mahlo Chang's conjecture Ostaszewski square Dowker space Precaliber Forcing Ascending path Hereditarily Lindelöf space Intersection model Analytic sets Club Guessing Cardinal function Minimal Walks Almost-disjoint family stationary hitting Fat stationary set Prevalent singular cardinals Mandelbrot set full tree Diamond Successor of Singular Cardinal Erdos-Hajnal graphs Small forcing stationary reflection Uniformly coherent b-scale Cardinal Invariants reflection principles nonmeager set approachability ideal Ulam matrix weak Kurepa tree Slim tree P-Ideal Dichotomy Poset Jonsson cardinal Forcing Axioms Partition Relations Constructible Universe Commutative projection system Luzin set Open Access free Souslin tree Almost countably chromatic Erdos Cardinal Coherent tree Knaster and friends Singular cofinality HOD Sigma-Prikry Uniformization Well-behaved magma Uniformly homogeneous indecomposable filter Chromatic number Filter reflection GMA Aronszajn tree positive partition relation Ineffable cardinal regressive Souslin tree Diamond-sharp square principles Weakly compact cardinal Whitehead Problem polarized partition relation club_AD tensor product graph C-sequence PFA(S)[S] AIM forcing Antichain very good scale Cohen real ZFC construction Singular cardinals combinatorics Selective Ultrafilter Local Club Condensation. incompactness Reflecting stationary set Axiom R Subadditive Amenable C-sequence Successor of Regular Cardinal Monotonically far unbounded function Almost Souslin Shelah's Strong Hypothesis Strongly compact cardinal Martin's Axiom square Kurepa Hypothesis transformations Generalized Clubs OCA weak diamond Rock n' Roll Strong coloring Reduced Power Absoluteness Subtle tree property Vanishing levels Square-Brackets Partition Relations Postprocessing function Closed coloring perfectly normal countably metacompact stick Large Cardinals Subnormal ideal xbox Countryman line Parameterized proxy principle O-space weak square Respecting tree Diamond for trees Nonspecial tree SNR L-space Iterated forcing specializable Souslin tree S-Space Entangled linear order strongly bounded groups Sierpinski's onto mapping principle Prikry-type forcing Ramsey theory over partitions Singular Density Rainbow sets Fodor-type reflection super-Souslin tree projective Boolean algebra Lipschitz reduction Hedetniemi's conjecture Hindman's Theorem Sakurai's Bell inequality Was Ulam right? 54G20 higher Baire space Souslin Tree Subtle cardinal ccc Knaster free Boolean algebra PFA Rado's conjecture Interval topology on trees middle diamond Foundations coloring number Forcing with side conditions Non-saturation Generalized descriptive set theory
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
Comments Off on The reflection principle $R_2$
