### Archives

### Recent blog posts

- A strong form of König’s lemma October 21, 2017
- 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

### Keywords

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

# Tag Archives: 03E35

## A remark on Schimmerling’s question

Joint work with Ari Meir Brodsky. Abstract. Schimmerling asked whether $\square^*_\lambda$ together with GCH entails the existence of a $\lambda^+$-Souslin tree, for a singular cardinal $\lambda$. Here, we provide an affirmative answer under the additional assumption that there exists a … Continue reading

## Weak square and stationary reflection

Joint work with Gunter Fuchs. Abstract. It is well-known that the square principle $\square_\lambda$ entails the existence of a non-reflecting stationary subset of $\lambda^+$, whereas the weak square principle $\square^*_\lambda$ does not. Here we show that if $\mu^{cf(\lambda)}<\lambda$ for all $\mu<\lambda$, … Continue reading

Posted in Publications, Squares and Diamonds
Tagged 03E05, 03E35, 03E57, Diamond, Forcing Axioms, stationary reflection, weak square
Leave a comment

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

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

## Higher Souslin trees and the GCH, revisited

Abstract. It is proved that for every uncountable cardinal $\lambda$, GCH+$\square(\lambda^+)$ entails the existence of a $\text{cf}(\lambda)$-complete $\lambda^+$-Souslin tree. In particular, if GCH holds and there are no $\aleph_2$-Souslin trees, then $\aleph_2$ is weakly compact in Godel’s constructible universe, improving … Continue reading

Posted in Publications, Souslin Hypothesis
Tagged 03E05, 03E35, Souslin Tree, square, Weakly compact cardinal, xbox
16 Comments

## A Microscopic approach to Souslin-tree constructions. Part I

Joint work with Ari Meir Brodsky. Abstract. We propose a parameterized proxy principle from which $\kappa$-Souslin trees with various additional features can be constructed, regardless of the identity of $\kappa$. We then introduce the microscopic approach, which is a simple … Continue reading

Posted in Publications, Souslin Hypothesis
Tagged 03E05, 03E35, 03E65, 05C05, Coherent tree, Diamond, Microscopic Approach, Parameterized proxy principle, Slim tree, Souslin Tree, square, xbox
4 Comments

## Reduced powers of Souslin trees

Joint work with Ari Meir Brodsky. Abstract. We study the relationship between a $\kappa$-Souslin tree $T$ and its reduced powers $T^\theta/\mathcal U$. Previous works addressed this problem from the viewpoint of a single power $\theta$, whereas here, tools are developed … Continue reading

## Same Graph, Different Universe

Abstract. May the same graph admit two different chromatic numbers in two different universes? how about infinitely many different values? and can this be achieved without changing the cardinals structure? In this paper, it is proved that in Godel’s constructible … Continue reading

Posted in Infinite Graphs, Publications
Tagged 03E35, 05C15, 05C63, approachability ideal, Chromatic number, Constructible Universe, Forcing, Ostaszewski square
10 Comments

## Chromatic numbers of graphs – large gaps

Abstract. We say that a graph $G$ is $(\aleph_0,\kappa)$-chromatic if $\text{Chr}(G)=\kappa$, while $\text{Chr}(G’)\le\aleph_0$ for any subgraph $G’$ of $G$ of size $<|G|$. The main result of this paper reads as follows. If $\square_\lambda+\text{CH}_\lambda$ holds for a given uncountable cardinal $\lambda$, … Continue reading

Posted in Compactness, Infinite Graphs, Publications
Tagged 03E35, 05C15, 05C63, Almost countably chromatic, Chromatic number, incompactness, Ostaszewski square
6 Comments