Archives
Keywords
Martin's Axiom ZFC construction Forcing Forcing Axioms Square-Brackets Partition Relations transformations Analytic sets incompactness Absoluteness Hindman's Theorem 54G20 reflection principles club_AD projective Boolean algebra Subtle tree property higher Baire space Minimal Walks strongly bounded groups stationary hitting S-Space Antichain polarized partition relation Sakurai's Bell inequality super-Souslin tree Slim tree weak square Shelah's Strong Hypothesis Microscopic Approach Non-saturation Ascent Path Sierpinski's onto mapping principle Ineffable cardinal countably metacompact Amenable C-sequence Coherent tree Fodor-type reflection Rainbow sets Dushnik-Miller Almost countably chromatic Knaster and friends Strong coloring Ostaszewski square L-space Parameterized proxy principle Prevalent singular cardinals Luzin set SNR weak diamond specializable Souslin tree PFA Open Access HOD AIM forcing Mandelbrot set Hedetniemi's conjecture Whitehead Problem Cohen real stationary reflection middle diamond Distributive tree Reflecting stationary set Singular cofinality Knaster Generalized descriptive set theory Diamond-sharp Souslin Tree Universal Sequences Fat stationary set Was Ulam right Subnormal ideal Jonsson cardinal Reduced Power Aronszajn tree Vanishing levels Postprocessing function O-space Strongly Luzin set Erdos-Hajnal graphs Chang's conjecture Axiom R Singular Density Large Cardinals Cardinal function Iterated forcing Erdos Cardinal Small forcing Subadditive stick weak Kurepa tree very good scale Ulam matrix square principles Cardinal Invariants Weakly compact cardinal Hereditarily Lindelöf space free Boolean algebra xbox OCA Local Club Condensation. PFA(S)[S] Subtle cardinal Uniformly coherent Uniformly homogeneous Diamond Uniformization ccc Singular cardinals combinatorics P-Ideal Dichotomy sap Filter reflection Kurepa Hypothesis Foundations Nonspecial tree unbounded function regressive Souslin tree Rado's conjecture Selective Ultrafilter Generalized Clubs GMA Commutative cancellative semigroups Prikry-type forcing free Souslin tree Poset Well-behaved magma square Club Guessing coloring number full tree Almost Souslin Successor of Regular Cardinal diamond star Successor of Singular Cardinal Almost-disjoint family Chromatic number positive partition relation approachability ideal Constructible Universe C-sequence Partition Relations Dowker space Sigma-Prikry Rock n' Roll nonmeager set Lipschitz reduction Diamond for trees Precaliber Ramsey theory over partitions tensor product graph b-scale Closed coloring Greatly Mahlo Fast club indecomposable ultrafilter
Tag Archives: 03E35
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
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
Posted in Groups, Partition Relations, Publications
Tagged 03E02, 03E35, 03E75, 05A17, 05D10, 11P99, 20M14, Chang's conjecture, Commutative cancellative semigroups, Erdos Cardinal, Hindman's Theorem, Jonsson cardinal, Kurepa Hypothesis, Square-Brackets Partition Relations, Weakly compact cardinal, ZFC construction
1 Comment
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, Open Access, regressive Souslin tree, 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
5 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
Jensen’s diamond principle and its relatives
This is chapter 6 in the book Set Theory and Its Applications (ISBN: 0821848127). Abstract: We survey some recent results on the validity of Jensen’s diamond principle at successor cardinals. We also discuss weakening of this principle such as club … Continue reading
A cofinality-preserving small forcing may introduce a special Aronszajn tree
Extended Abstract: Shelah proved that Cohen forcing introduces a Souslin tree; Jensen proved that a c.c.c. forcing may consistently add a Kurepa tree; Todorcevic proved that a Knaster poset may already force the Kurepa hypothesis; Irrgang introduced a c.c.c. notion … Continue reading
Posted in Publications, Squares and Diamonds
Tagged 03E04, 03E05, 03E35, Aronszajn tree, Small forcing, Successor of Singular Cardinal, weak square
Leave a comment
Openly generated Boolean algebras and the Fodor-type reflection principle
Joint work with Sakaé Fuchino. Abstract: We prove that the Fodor-type Reflection Principle (FRP) is equivalent to the assertion that any Boolean algebra is openly generated if and only if it is $\aleph _2$-projective. Previously it was known that this … Continue reading