Archives
Keywords
Slim tree Sigma-Prikry Minimal Walks Successor of Singular Cardinal tensor product graph Filter reflection Sierpinski's onto mapping principle Forcing Fast club specializable Souslin tree L-space Singular Density super-Souslin tree GMA b-scale Chang's conjecture Diamond-sharp Cardinal Invariants approachability ideal stick Diamond transformations Poset Monotonically far Uniformization Fat stationary set Kurepa Hypothesis C-sequence xbox Coherent tree Singular cofinality Ineffable cardinal Prikry-type forcing weak Kurepa tree Subtle tree property Subadditive Closed coloring square Non-saturation Constructible Universe Strong coloring Partition relations for trees HOD weak diamond strongly bounded groups Well-behaved magma OCA free Souslin tree Almost-disjoint family Knaster and friends 54G20 Prevalent singular cardinals free Boolean algebra Commutative projection system Foundations coloring number Precaliber Countryman line unbounded function PFA(S)[S] Was Ulam right? diamond star regressive Souslin tree Generalized descriptive set theory Ulam matrix Strongly compact cardinal Sakurai's Bell inequality Dushnik-Miller Antichain Hedetniemi's conjecture Subnormal ideal Local Club Condensation. Postprocessing function Almost Souslin Nonspecial tree Amenable C-sequence Iterated forcing Partition Relations P-Ideal Dichotomy Chromatic number Respecting tree Generalized Clubs Reduced Power Selective Ultrafilter Hindman's Theorem Commutative cancellative semigroups ZFC construction Reflecting stationary set Jonsson cardinal Dowker space Hereditarily Lindelöf space O-space Forcing with side conditions Club Guessing Microscopic Approach Entangled linear order Universal Sequences incompactness Singular cardinals combinatorics perfectly normal Vanishing levels Diamond for trees Erdos Cardinal reflection principles Ostaszewski square countably metacompact Almost countably chromatic club_AD very good scale projective Boolean algebra weak square Martin's Axiom nonmeager set Ascending path Square-Brackets Partition Relations polarized partition relation full tree Souslin Tree Lipschitz reduction Erdos-Hajnal graphs Subtle cardinal middle diamond Analytic sets Uniformly homogeneous sap Rado's conjecture Knaster Shelah's Strong Hypothesis Forcing Axioms Rainbow sets ccc S-Space PFA stationary hitting Open Access Absoluteness Successor of Regular Cardinal square principles AIM forcing Ascent Path Interval topology on trees Greatly Mahlo SNR Ramsey theory over partitions Rock n' Roll Luzin set stationary reflection higher Baire space Distributive tree positive partition relation Mandelbrot set Cardinal function Whitehead Problem Weakly compact cardinal Aronszajn tree Strongly Luzin set indecomposable filter Small forcing Intersection model Large Cardinals Fodor-type reflection Parameterized proxy principle Cohen real Uniformly coherent Axiom R
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
