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