### Archives

### Recent blog posts

- Prikry forcing may add a Souslin tree June 12, 2016
- The reflection principle $R_2$ May 20, 2016
- Prolific Souslin trees March 17, 2016
- Generalizations of Martin’s Axiom and the well-met condition January 11, 2015
- Many diamonds from just one January 6, 2015
- Happy new jewish year! September 24, 2014
- Square principles April 19, 2014
- Partitioning the club guessing January 22, 2014

### Keywords

polarized partition relation ccc Forcing Constructible Universe OCA Singular cardinals combinatorics Ostaszewski square very good scale Coherent tree Erdos-Hajnal graphs diamond star Slim tree Successor of Singular Cardinal PFA(S)[S] Antichain xbox Singular Density Nonspecial tree Reduced Power approachability ideal Aronszajn tree Distributive tree 11P99 stationary reflection Cohen real Poset reflection principles Uniformly coherent Successor of Regular Cardinal Hereditarily Lindelöf space Fast club Rainbow sets Rock n' Roll tensor product graph Prikry-type forcing incompactness Absoluteness 05D10 Uniformization Non-saturation Fat stationary set P-Ideal Dichotomy Hedetniemi's conjecture coloring number Martin's Axiom Fodor-type reflection Prevalent singular cardinals square Foundations Jonsson cardinal Selective Ultrafilter Cardinal function Cardinal Invariants Ascent Path square principles stationary hitting Axiom R Universal Sequences Mandelbrot set Postprocessing function Generalized Clubs sap projective Boolean algebra Dushnik-Miller Microscopic Approach Souslin Tree Small forcing Parameterized proxy principle Large Cardinals HOD Sakurai's Bell inequality Hindman's Theorem PFA Square-Brackets Partition Relations Almost-disjoint famiy b-scale Whitehead Problem free Boolean algebra Club Guessing Shelah's Strong Hypothesis Rado's conjecture Forcing Axioms 20M14 Kurepa Hypothesis S-Space weak diamond Minimal Walks Stevo Todorcevic 05A17 Knaster Chang's conjecture Almost Souslin Weakly compact cardinal Almost countably chromatic Erdos Cardinal Singular coﬁnality Commutative cancellative semigroups weak square L-space Chromatic number Diamond Partition Relations middle diamond

# Author Archives: Assaf Rinot

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

## ASL North American Meeting, March 2017

I gave a plenary talk at the 2017 ASL North American Meeting in Boise, March 2017. Talk Title: The current state of the Souslin problem. Abstract: Recall that the real line is that unique separable, dense linear ordering with no endpoints in … Continue reading

## MFO workshop in Set Theory, February 2017

I gave an invited talk at the Set Theory workshop in Obwerwolfach, February 2017. Talk Title: Coloring vs. Chromatic. Abstract: In a joint work with Chris Lambie-Hanson, we study the interaction between compactness for the chromatic number (of graphs) and … Continue reading

Posted in Invited Talks
Tagged Chromatic number, coloring number, incompactness, stationary reflection
Leave a comment

## The eightfold way

Joint work with James Cummings, Sy-David Friedman, Menachem Magidor, and Dima Sinapova. Abstract. Three central combinatorial properties in set theory are the tree property, the approachability property and stationary reflection. We prove the mutual independence of these properties by showing … Continue reading

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

## Set Theory and its Applications in Topology, September 2016

I gave an invited talk at the Set Theory and its Applications in Topology meeting, Oaxaca, September 11-16, 2016. The talk was on the $\aleph_2$-Souslin problem. If you are interested in seeing the effect of a jet lag, the video is … Continue reading

## Strong failures of higher analogs of Hindman’s Theorem

Joint work with David J. Fernández Bretón. Abstract. We show that various analogs of Hindman’s Theorem fail in a strong sense when one attempts to obtain uncountable monochromatic sets: Theorem 1. There exists a colouring $c:\mathbb R\rightarrow\mathbb Q$, such that … Continue reading

## More notions of forcing add a Souslin tree

Joint work with Ari Meir Brodsky. Abstract. An $\aleph_1$-Souslin tree is a complicated combinatorial object whose existence cannot be decided on the grounds of ZFC alone. But 15 years after Tennenbaum and independently Jech devised notions of forcing for introducing … Continue reading

## Prikry forcing may add a Souslin tree

A celebrated theorem of Shelah states that adding a Cohen real introduces a Souslin tree. Are there any other examples of notions of forcing that add a $\kappa$-Souslin tree? and why is this of interest? My motivation comes from a … Continue reading

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