Archives
Keywords
indecomposable filter PFA(S)[S] Diamond square principles Axiom R S-Space middle diamond approachability ideal Greatly Mahlo perfectly normal xbox Ascent Path Knaster HOD 54G20 Parameterized proxy principle Universal Sequences Was Ulam right? Erdos Cardinal Uniformly homogeneous Ascending path Strongly compact cardinal Commutative cancellative semigroups Shelah's Strong Hypothesis Almost Souslin Hedetniemi's conjecture Interval topology on trees Strongly Luzin set stationary reflection Iterated forcing Souslin Tree Forcing with side conditions Martin's Axiom specializable Souslin tree L-space full tree Microscopic Approach Luzin set Erdos-Hajnal graphs Reduced Power Sigma-Prikry P-Ideal Dichotomy Cohen real strongly bounded groups Constructible Universe incompactness weak square GMA Square-Brackets Partition Relations weak diamond Subnormal ideal Fodor-type reflection Almost-disjoint family Mandelbrot set Uniformization ccc Vanishing levels Distributive tree club_AD reflection principles Local Club Condensation. Weakly compact cardinal SNR Diamond-sharp polarized partition relation Knaster and friends Lipschitz reduction Nonspecial tree stick sap Rado's conjecture Cardinal Invariants Ulam matrix projective Boolean algebra Reflecting stationary set Sierpinski's onto mapping principle Coherent tree Aronszajn tree Open Access free Boolean algebra Ramsey theory over partitions C-sequence Intersection model Minimal Walks higher Baire space Selective Ultrafilter square Successor of Regular Cardinal Club Guessing Large Cardinals Diamond for trees Singular cardinals combinatorics Singular cofinality Ineffable cardinal transformations countably metacompact Dushnik-Miller Subtle tree property Non-saturation Whitehead Problem Postprocessing function Subadditive super-Souslin tree Forcing AIM forcing very good scale Jonsson cardinal Partition Relations Hereditarily Lindelöf space PFA Commutative projection system Filter reflection ZFC construction Chang's conjecture Analytic sets Rainbow sets OCA Generalized Clubs Subtle cardinal Dowker space Almost countably chromatic b-scale free Souslin tree Monotonically far Foundations stationary hitting Amenable C-sequence Small forcing weak Kurepa tree Closed coloring Prevalent singular cardinals Absoluteness Countryman line unbounded function Chromatic number Fat stationary set Entangled linear order Forcing Axioms Prikry-type forcing Ostaszewski square diamond star Strong coloring Precaliber Hindman's Theorem positive partition relation Slim tree Respecting tree Cardinal function Well-behaved magma nonmeager set Antichain Poset Sakurai's Bell inequality tensor product graph Kurepa Hypothesis O-space coloring number Fast club Generalized descriptive set theory regressive Souslin tree Rock n' Roll Uniformly coherent Partition relations for trees Singular Density Successor of Singular Cardinal
Author Archives: Assaf Rinot
Complicated colorings
Abstract. If $\lambda,\kappa$ are regular cardinals, $\lambda>\kappa^+$, and $E^\lambda_{\ge\kappa}$ admits a nonreflecting stationary set, then $\text{Pr}_1(\lambda,\lambda,\lambda,\kappa)$ holds. (Recall that $\text{Pr}_1(\lambda,\lambda,\lambda,\kappa)$ asserts the existence of a coloring $d:[\lambda]^2\rightarrow\lambda$ such that for any family $\mathcal A\subseteq[\lambda]^{<\kappa}$ of size $\lambda$, consisting of pairwise … Continue reading
Posted in Partition Relations, Publications
Tagged Minimal Walks, Open Access, Square-Brackets Partition Relations
2 Comments
MFO workshop in Set Theory, January 2014
I gave an invited talk at the Set Theory workshop in Obwerwolfach, January 2014. Talk Title: Complicated Colorings. Abstract: If $\lambda,\kappa$ are regular cardinals, $\lambda>\kappa^+$, and $E^{\lambda}_{\ge\kappa}$ admits a nonreflecting stationary set, then $\text{Pr}_1(\lambda,\lambda,\lambda,\kappa)$ holds. Downloads:
Walk on countable ordinals: the characteristics
In this post, we shall present a few aspects of the method of walk on ordinals (focusing on countable ordinals), record its characteristics, and verify some of their properties. All definitions and results in this post are due to Todorcevic. … Continue reading
Polychromatic colorings
These are lectures notes of two talks Dani Livne gave in our Infinite Combinatorics seminar. I did not take notes in real-time, hence, all possible mistakes here are due to myself. Recall that a function $f:A\rightarrow B$ is said to … Continue reading
Universal binary sequences
Notation. Write $\mathcal Q(A):=\{ a\subseteq A\mid a\text{ is finite}, a\neq\emptyset\}$. Suppose for the moment that we are given a fixed sequence $\langle f_\alpha:\omega\rightarrow2\mid \alpha\in a\rangle$, indexed by some set $a$ of ordinals. Then, for every function $h:a\rightarrow\omega$ and $i<\omega$, we … Continue reading
Mathematics Colloquium, Bar-Ilan University, November 2013
I gave a colloquium talk at Bar-Ilan University on November 10, 2013. Title: Forcing as a tool to prove theorems Abstract: Paul Cohen celebrated solution to Hilbert’s first problem showed that the Continuum Hypothesis is independent of the usual axioms of … Continue reading
Syndetic colorings with applications to S and L
Notation. Write $\mathcal Q(A):=\{ a\subseteq A\mid a\text{ is finite}, a\neq\emptyset\}$. Definition. An L-space is a regular hereditarily Lindelöf topological space which is not hereditarily separable. Definition. We say that a coloring $c:[\omega_1]^2\rightarrow\omega$ is L-syndetic if the following holds. For every uncountable … Continue reading
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
