Archives
Keywords
xbox C-sequence Strong coloring Minimal Walks weak Kurepa tree Foundations HOD Weakly compact cardinal Absoluteness Vanishing levels OCA Hereditarily Lindelöf space Rock n' Roll ZFC construction Generalized Clubs Well-behaved magma Singular Density Shelah's Strong Hypothesis specializable Souslin tree middle diamond Lipschitz reduction 54G20 Almost Souslin Uniformly homogeneous projective Boolean algebra Subnormal ideal Reduced Power free Souslin tree Antichain Universal Sequences Intersection model Microscopic Approach Fodor-type reflection Square-Brackets Partition Relations Almost-disjoint family weak square sap Precaliber Ineffable cardinal Coherent tree coloring number O-space Non-saturation Ulam matrix nonmeager set Knaster reflection principles Cardinal function P-Ideal Dichotomy Generalized descriptive set theory Amenable C-sequence Martin's Axiom Greatly Mahlo Distributive tree Commutative cancellative semigroups Parameterized proxy principle club_AD stationary hitting Almost countably chromatic Aronszajn tree Sakurai's Bell inequality Commutative projection system Singular cardinals combinatorics Filter reflection Successor of Singular Cardinal Ramsey theory over partitions Rado's conjecture very good scale Respecting tree Slim tree Poset Strongly compact cardinal square principles Open Access countably metacompact Reflecting stationary set Local Club Condensation. Partition Relations Dushnik-Miller strongly bounded groups Mandelbrot set Jonsson cardinal PFA Successor of Regular Cardinal Souslin Tree Knaster and friends Dowker space b-scale Rainbow sets approachability ideal Strongly Luzin set stationary reflection super-Souslin tree Analytic sets transformations Cohen real tensor product graph Uniformization Prikry-type forcing ccc Forcing square diamond star Singular cofinality Iterated forcing Diamond-sharp L-space Erdos Cardinal PFA(S)[S] higher Baire space Hedetniemi's conjecture Diamond Subadditive Luzin set indecomposable ultrafilter Uniformly coherent Forcing Axioms GMA SNR full tree Subtle tree property Postprocessing function free Boolean algebra Closed coloring Selective Ultrafilter AIM forcing polarized partition relation positive partition relation Was Ulam right Erdos-Hajnal graphs S-Space Large Cardinals Cardinal Invariants Sierpinski's onto mapping principle Chromatic number Ostaszewski square Countryman line Nonspecial tree Kurepa Hypothesis Hindman's Theorem stick unbounded function Sigma-Prikry Fat stationary set Prevalent singular cardinals Small forcing Subtle cardinal regressive Souslin tree Club Guessing Axiom R Ascent Path Diamond for trees Constructible Universe incompactness Chang's conjecture weak diamond Whitehead Problem Fast club
Category Archives: Partition Relations
Ramsey theory over partitions I: Positive Ramsey relations from forcing axioms
Joint work with Menachem Kojman and Juris Steprāns. Abstract. In this series of papers, we advance Ramsey theory of colorings over partitions. In this part, a correspondence between anti-Ramsey properties of partitions and chain conditions of the natural forcing notions … Continue reading
Posted in Partition Relations, Publications
Tagged 03E02, 03E17, 03E35, GMA, Martin's Axiom, positive partition relation, Ramsey theory over partitions
1 Comment
Transformations of the transfinite plane
Joint work with Jing Zhang. Abstract. We study the existence of transformations of the transfinite plane that allow one to reduce Ramsey-theoretic statements concerning uncountable Abelian groups into classical partition relations for uncountable cardinals. To exemplify: we prove that for every … Continue reading
Knaster and friends I: Closed colorings and precalibers
Joint work with Chris Lambie-Hanson. Abstract. The productivity of the $\kappa$-chain condition, where $\kappa$ is a regular, uncountable cardinal, has been the focus of a great deal of set-theoretic research. In the 1970s, consistent examples of $\kappa$-cc posets whose squares … Continue reading
Strong failures of higher analogs of Hindman’s Theorem
Joint work with David J. Fernández Bretón. Abstract. We show that various analogs of Hindman’s Theorem fail in a strong sense when one attempts to obtain uncountable monochromatic sets: Theorem 1. There exists a colouring $c:\mathbb R\rightarrow\mathbb Q$, such that … Continue reading
Posted in Groups, Partition Relations, Publications
Tagged 03E02, 03E35, 03E75, 05A17, 05D10, 11P99, 20M14, Chang's conjecture, Commutative cancellative semigroups, Erdos Cardinal, Hindman's Theorem, Jonsson cardinal, Kurepa Hypothesis, Square-Brackets Partition Relations, Weakly compact cardinal, ZFC construction
1 Comment
Chain conditions of products, and weakly compact cardinals
Abstract. The history of productivity of the $\kappa$-chain condition in partial orders, topological spaces, or Boolean algebras is surveyed, and its connection to the set-theoretic notion of a weakly compact cardinal is highlighted. Then, it is proved that for every … Continue reading
Posted in Partition Relations, Publications
Tagged Aronszajn tree, ccc, Fat stationary set, Minimal Walks, square, Weakly compact cardinal
2 Comments
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
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
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
