Tag Archives: square

Complicated colorings, revisited

Joint work with Jing Zhang. Abstract. In a paper from 1997, Shelah asked whether Pr1(λ+,λ+,λ+,λ) holds for every inaccessible cardinal λ. Here, we prove that an affirmative answer follows from ◻(λ+).  Furthermore, we establish that for every pair χ<κ of … Continue reading

Posted in Partition Relations | Tagged , | 1 Comment

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 θ<κ, the existence … Continue reading

Posted in Partition Relations, Publications | Tagged , , , , , , , , | 1 Comment

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 , , , , , , | 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

Posted in Partition Relations, Publications | Tagged , , , , , , , , | 1 Comment

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

Posted in Compactness, Publications, Singular Cardinals Combinatorics | Tagged , , , , , , , , , , , , , | 1 Comment

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 , , , , , , | Leave a comment

Knaster and friends I: Closed colorings and precalibers

Joint work with Chris Lambie-Hanson. Abstract. The productivity of the κ-chain condition, where κ is a regular, uncountable cardinal, has been the focus of a great deal of set-theoretic research. In the 1970s, consistent examples of κ-cc posets whose squares … Continue reading

Posted in Partition Relations, Publications | Tagged , , , , , , | 2 Comments

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 λ, … Continue reading

Posted in Publications, Souslin Hypothesis | Tagged , , , , , , , | 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 , , , , , , , , , , , , , | 2 Comments

The reflection principle R2

A few years ago, in this paper, I introduced the following reflection principle: Definition. R2(θ,κ) asserts that for every function f:E<κθκ, there exists some j<κ for which the following set is nonstationary: Aj:={δEκθf1[j]δ is nonstationary}. I wrote there … Continue reading

Posted in Blog | Tagged , , , | Leave a comment