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

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

# Author Archives: Assaf Rinot

## 6th European Set Theory Conference, July 2017

I gave a 3-lectures 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

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