Archives
Keywords
Luzin set HOD Singular Density approachability ideal polarized partition relation b-scale Subadditive Constructible Universe Prevalent singular cardinals very good scale Fat stationary set Filter reflection Ascent Path Foundations square Subnormal ideal sap Fodor-type reflection Singular cardinals combinatorics Aronszajn tree Lipschitz reduction strongly bounded groups Diamond Ulam matrix Amenable C-sequence Chang's conjecture Parameterized proxy principle OCA C-sequence Partition Relations Dowker space indecomposable filter Club Guessing Nonspecial tree Generalized Clubs Countryman line Poset free Souslin tree Square-Brackets Partition Relations Strongly compact cardinal Mandelbrot set Uniformization Respecting tree middle diamond Ascending path Microscopic Approach Hedetniemi's conjecture Partition relations for trees GMA countably metacompact Minimal Walks Uniformly coherent Successor of Singular Cardinal Universal Sequences Ineffable cardinal Commutative projection system super-Souslin tree Coherent tree weak diamond Fast club Forcing Absoluteness Almost countably chromatic square principles Almost Souslin L-space Erdos-Hajnal graphs Prikry-type forcing O-space regressive Souslin tree Whitehead Problem club_AD diamond star Commutative cancellative semigroups Hereditarily Lindelöf space transformations SNR Interval topology on trees Almost-disjoint family ZFC construction Rado's conjecture P-Ideal Dichotomy Small forcing Large Cardinals PFA Sigma-Prikry Analytic sets higher Baire space weak square Slim tree Reduced Power Rainbow sets Kurepa Hypothesis Martin's Axiom Chromatic number perfectly normal Cohen real stationary hitting Sakurai's Bell inequality Singular cofinality Monotonically far Subtle cardinal Selective Ultrafilter Axiom R Non-saturation Vanishing levels tensor product graph full tree Generalized descriptive set theory Iterated forcing AIM forcing free Boolean algebra incompactness Closed coloring Distributive tree Reflecting stationary set Forcing Axioms ccc Precaliber stick coloring number Forcing with side conditions Well-behaved magma Knaster Diamond-sharp Strong coloring Subtle tree property Successor of Regular Cardinal Knaster and friends Jonsson cardinal Souslin Tree reflection principles Rock n' Roll unbounded function Cardinal function Ostaszewski square Uniformly homogeneous S-Space projective Boolean algebra Hindman's Theorem Weakly compact cardinal nonmeager set Sierpinski's onto mapping principle Local Club Condensation. Cardinal Invariants Ramsey theory over partitions Diamond for trees Intersection model Postprocessing function positive partition relation Antichain weak Kurepa tree Dushnik-Miller Strongly Luzin set Entangled linear order xbox stationary reflection specializable Souslin tree PFA(S)[S] Open Access Shelah's Strong Hypothesis Was Ulam right? 54G20 Erdos Cardinal Greatly Mahlo
Author Archives: Assaf Rinot
Open coloring and the cardinal invariant $\mathfrak b$
Nik Weaver asked for a direct proof of the fact that Todorcevic’s axiom implies the failure of CH fails. Here goes. Notation. For a set $X$, we write $[X]^2$ for the set of unordered pairs $\{ \{x,x’\}\mid x,x’\in X, x\neq … Continue reading
Gabriel Belachsan (14/5/1976 – 20/8/2013)
רק כשעיני סגורות, עולם נגלה לפני
Hedetniemi’s conjecture for uncountable graphs
Abstract. It is proved that in Godel’s constructible universe, for every successor cardinal $\kappa$, there exist graphs $\mathcal G$ and $\mathcal H$ of size and chromatic number $\kappa$, for which the tensor product graph $\mathcal G\times\mathcal H$ is countably chromatic. … Continue reading
Set Theory Programme on Large Cardinals and Forcing, September 2013
I gave an invited talk at the Large Cardinals and Forcing meeting, Erwin Schrödinger International Institute for Mathematical Physics, Vienna, September 23–27, 2013. Talk Title: Hedetniemi’s conjecture for uncountable graphs Abstract: It is proved that in Godel’s constructible universe, for … Continue reading
Posted in Invited Talks
Tagged Almost countably chromatic, Chromatic number, Hedetniemi's conjecture
1 Comment
PFA and the tree property at $\aleph_2$
Recall that a poset $\langle T,\le\rangle$ is said to be a $\lambda^+$-Aronszajn tree, if it isomorphic to a poset $(\mathcal T,\subseteq)$ of the form: $\emptyset\in \mathcal T\subseteq{}^{<\lambda^+}\lambda$; Write $\mathcal T_\alpha:=\{\sigma\in\mathcal T\mid \text{dom}(\sigma)=\alpha\}$; for all $\alpha<\lambda^+$, $\mathcal T_\alpha$ has size $\le\lambda$, … Continue reading
A Kurepa tree from diamond-plus
Recall that $T$ is said to be a $\kappa$-Kurepa tree if $T$ is a tree of height $\kappa$, whose levels $T_\alpha$ has size $\le|\alpha|$ for co-boundedly many $\alpha<\kappa$, and such that the set of branches of $T$ has size $>\kappa$. … Continue reading
Posted in Blog, Expository
Tagged diamond star, Kurepa Hypothesis
Comments Off on A Kurepa tree from diamond-plus
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
The S-space problem, and the cardinal invariant $\mathfrak b$
Recall that an S-space is a regular hereditarily separable topological space which is not hereditarily Lindelöf. In a previous post, we showed that such a space exists after adding a Cohen real. Here, we shall construct one from an arithmetic … Continue reading
An $S$-space from a Cohen real
Recall that an $S$-space is a regular hereditarily separable topological space which is not hereditarily Lindelöf. In this post, we shall establish the consistency of the existence of such a space. Theorem (Roitman, 1979). Let $\mathbb C=({}^{<\omega}\omega,\subseteq)$ be the notion of … Continue reading
Forcing with a Souslin tree makes $\mathfrak p=\omega_1$
I was meaning to include a proof of Farah’s lemma in my previous post, but then I realized that the slick proof assumes some background which may worth spelling out, first. Therefore, I am dedicating a short post for a … Continue reading
