Archives
Keywords
Strongly compact cardinal Hedetniemi's conjecture strongly bounded groups Shelah's Strong Hypothesis Singular cardinals combinatorics Postprocessing function Fodor-type reflection Generalized descriptive set theory OCA Rado's conjecture Subnormal ideal Filter reflection Monotonically far Commutative projection system Coherent tree Countryman line Whitehead Problem Mandelbrot set AIM forcing Cardinal Invariants approachability ideal projective Boolean algebra Slim tree Subtle tree property Well-behaved magma HOD Amenable C-sequence Intersection model Ascent Path Antichain weak Kurepa tree Uniformization Vanishing levels Chromatic number Prevalent singular cardinals xbox Erdos-Hajnal graphs Selective Ultrafilter square principles Souslin Tree weak square C-sequence Uniformly homogeneous Was Ulam right? Prikry-type forcing P-Ideal Dichotomy Precaliber Erdos Cardinal Sigma-Prikry regressive Souslin tree stationary hitting Fast club Square-Brackets Partition Relations super-Souslin tree L-space transformations S-Space Successor of Singular Cardinal Ramsey theory over partitions stationary reflection Almost Souslin Absoluteness Forcing Axioms free Boolean algebra Subadditive Large Cardinals 54G20 Reflecting stationary set Diamond for trees Dushnik-Miller Chang's conjecture SNR full tree Iterated forcing Martin's Axiom Forcing Ostaszewski square higher Baire space Axiom R specializable Souslin tree Distributive tree Ineffable cardinal Commutative cancellative semigroups free Souslin tree Open Access incompactness b-scale reflection principles Rainbow sets Subtle cardinal Cardinal function Nonspecial tree Analytic sets Successor of Regular Cardinal Universal Sequences Diamond-sharp Diamond nonmeager set weak diamond Small forcing Parameterized proxy principle Uniformly coherent Sakurai's Bell inequality Partition relations for trees Greatly Mahlo Strongly Luzin set club_AD Jonsson cardinal Hindman's Theorem Partition Relations ZFC construction middle diamond Non-saturation Closed coloring square stick Fat stationary set perfectly normal ccc tensor product graph Rock n' Roll Strong coloring Kurepa Hypothesis O-space Respecting tree Almost countably chromatic Singular Density PFA(S)[S] unbounded function Local Club Condensation. Weakly compact cardinal Entangled linear order Club Guessing Constructible Universe GMA countably metacompact Dowker space Singular cofinality Luzin set Knaster Aronszajn tree Hereditarily Lindelöf space polarized partition relation very good scale Sierpinski's onto mapping principle Poset Forcing with side conditions Reduced Power indecomposable filter coloring number Cohen real Foundations Minimal Walks Ulam matrix PFA Lipschitz reduction diamond star Knaster and friends Interval topology on trees Microscopic Approach positive partition relation Ascending path Generalized Clubs sap Almost-disjoint family
Author Archives: Assaf Rinot
Square principles
Since the birth of Jensen’s original Square principle, many variations of the principle were introduced and intensively studied. Asaf Karagila suggested me today to put some order into all of these principles. Here is a trial. Definition. A square principle … Continue reading
INFTY Final Conference, March 2014
I gave an invited talk at the INFTY Final Conference meeting, Bonn, March 4-7, 2014. [Curiosity: Georg Cantor was born March 3, 1845] Title: Same Graph, Different Universe. Abstract: In a paper from 1998, answering a question of Hajnal, Soukup … Continue reading
Partitioning the club guessing
In a recent paper, I am making use of the following fact. Theorem (Shelah, 1997). Suppose that $\kappa$ is an accessible cardinal (i.e., there exists a cardinal $\theta<\kappa$ such that $2^\theta\ge\kappa)$. Then there exists a sequence $\langle g_\delta:C_\delta\rightarrow\omega\mid \delta\in E^{\kappa^+}_\kappa\rangle$ … Continue reading
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
