Archives
Keywords
Ineffable cardinal Rock n' Roll P-Ideal Dichotomy Minimal Walks Non-saturation Entangled linear order club_AD Strongly Luzin set full tree stationary hitting Ascending path higher Baire space nonmeager set Almost countably chromatic 54G20 Analytic sets Parameterized proxy principle strongly bounded groups diamond star ZFC construction Chang's conjecture OCA Luzin set approachability ideal Generalized descriptive set theory Kurepa Hypothesis Mandelbrot set free Souslin tree Shelah's Strong Hypothesis square principles Iterated forcing Filter reflection Sierpinski's onto mapping principle Subtle tree property Microscopic Approach Countryman line xbox Forcing Martin's Axiom Fast club Fat stationary set AIM forcing PFA(S)[S] Poset Diamond for trees Local Club Condensation. Large Cardinals Forcing with side conditions Aronszajn tree Successor of Singular Cardinal Hindman's Theorem super-Souslin tree L-space stationary reflection specializable Souslin tree Generalized Clubs Partition relations for trees ccc Hereditarily Lindelöf space Singular cofinality Ulam matrix reflection principles Whitehead Problem projective Boolean algebra Uniformly coherent GMA PFA Closed coloring Rainbow sets Dowker space Diamond-sharp Successor of Regular Cardinal Selective Ultrafilter Interval topology on trees Monotonically far Cohen real Strongly compact cardinal polarized partition relation Vanishing levels regressive Souslin tree C-sequence Prevalent singular cardinals coloring number Diamond indecomposable filter Axiom R middle diamond Absoluteness Dushnik-Miller Cardinal Invariants Distributive tree Uniformly homogeneous Ostaszewski square Singular cardinals combinatorics Amenable C-sequence Ascent Path Uniformization weak diamond Greatly Mahlo Commutative cancellative semigroups Was Ulam right? Precaliber Square-Brackets Partition Relations Weakly compact cardinal Fodor-type reflection sap countably metacompact Chromatic number Universal Sequences Coherent tree Lipschitz reduction Ramsey theory over partitions Sigma-Prikry Club Guessing HOD Prikry-type forcing Postprocessing function perfectly normal Reduced Power Singular Density Knaster Forcing Axioms Strong coloring transformations Antichain Open Access weak square Rado's conjecture square Foundations SNR O-space S-Space Subtle cardinal Partition Relations Reflecting stationary set Intersection model Nonspecial tree stick Hedetniemi's conjecture Souslin Tree weak Kurepa tree Erdos-Hajnal graphs Subnormal ideal Constructible Universe Erdos Cardinal Cardinal function free Boolean algebra Almost-disjoint family Small forcing unbounded function Commutative projection system Respecting tree Slim tree positive partition relation tensor product graph Sakurai's Bell inequality incompactness Well-behaved magma Almost Souslin Knaster and friends very good scale b-scale Jonsson cardinal Subadditive
Tag Archives: Minimal Walks
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
Rectangular square-bracket operation for successor of regular cardinals
Joint work with Stevo Todorcevic. Extended Abstract: Consider the coloring statement $\lambda^+\nrightarrow[\lambda^+;\lambda^+]^2_{\lambda^+}$ for a given regular cardinal $\lambda$: In 1990, Shelah proved the above for $\lambda>2^{\aleph_0}$; In 1991, Shelah proved the above for $\lambda>\aleph_1$; In 1997, Shelah proved the above … Continue reading
Young Researchers in Set Theory, March 2011
These are the slides of a talk I gave at the Young Researchers in Set Theory 2011 meeting (Königswinter, 21–25 March 2011). Talk Title: Around Jensen’s square principle Abstract: Jensen‘s square principle for a cardinal $\lambda$ asserts the existence of a particular ladder … Continue reading
Transforming rectangles into squares, with applications to strong colorings
Abstract: It is proved that every singular cardinal $\lambda$ admits a function $\textbf{rts}:[\lambda^+]^2\rightarrow[\lambda^+]^2$ that transforms rectangles into squares. That is, whenever $A,B$ are cofinal subsets of $\lambda^+$, we have $\textbf{rts}[A\circledast B]\supseteq C\circledast C$, for some cofinal subset $C\subseteq\lambda^+$. As a … Continue reading
