Archives
Keywords
free Souslin tree reflection principles Sigma-Prikry Large Cardinals Uniformization GMA Universal Sequences Strongly compact cardinal countably metacompact Chromatic number Precaliber Small forcing weak square full tree very good scale Erdos Cardinal middle diamond Generalized descriptive set theory Slim tree Rainbow sets Minimal Walks xbox higher Baire space Generalized Clubs ZFC construction free Boolean algebra Diamond-sharp Commutative projection system Hereditarily Lindelöf space Sierpinski's onto mapping principle Singular cofinality Hedetniemi's conjecture stationary hitting Ineffable cardinal L-space Cardinal Invariants Nonspecial tree Shelah's Strong Hypothesis Postprocessing function Forcing with side conditions Non-saturation indecomposable filter Partition Relations Microscopic Approach Vanishing levels Forcing Mandelbrot set Dushnik-Miller Uniformly coherent Amenable C-sequence diamond star Was Ulam right? Kurepa Hypothesis Greatly Mahlo Fat stationary set stick Square-Brackets Partition Relations Chang's conjecture Fodor-type reflection Club Guessing projective Boolean algebra super-Souslin tree Interval topology on trees Reduced Power Whitehead Problem Hindman's Theorem Singular Density Countryman line Weakly compact cardinal Cardinal function unbounded function Strongly Luzin set AIM forcing Foundations perfectly normal club_AD Diamond for trees Rock n' Roll Entangled linear order approachability ideal Lipschitz reduction square Forcing Axioms Closed coloring P-Ideal Dichotomy weak Kurepa tree Fast club Distributive tree Partition relations for trees 54G20 Poset Antichain S-Space Commutative cancellative semigroups transformations Prevalent singular cardinals square principles PFA ccc Strong coloring Dowker space b-scale SNR Souslin Tree specializable Souslin tree Subtle cardinal Jonsson cardinal Aronszajn tree Luzin set Selective Ultrafilter Sakurai's Bell inequality Axiom R Coherent tree HOD weak diamond Erdos-Hajnal graphs stationary reflection Respecting tree sap Diamond Ulam matrix Prikry-type forcing positive partition relation Monotonically far Ramsey theory over partitions Rado's conjecture Ostaszewski square regressive Souslin tree Almost-disjoint family polarized partition relation Knaster Parameterized proxy principle Uniformly homogeneous Successor of Singular Cardinal strongly bounded groups Subnormal ideal Reflecting stationary set Filter reflection Successor of Regular Cardinal Local Club Condensation. Cohen real coloring number Singular cardinals combinatorics C-sequence Martin's Axiom PFA(S)[S] OCA Open Access nonmeager set tensor product graph Subadditive Almost Souslin Iterated forcing Intersection model Ascending path Knaster and friends Baumgartner's square incompactness Ascent Path Subtle tree property Absoluteness Well-behaved magma Analytic sets O-space Almost countably chromatic Constructible Universe
Tag Archives: ZFC construction
Walks on uncountable ordinals and non-structure theorems for higher Aronszajn lines
Joint work with Tanmay Inamdar. Abstract. We investigate global structural properties of linear orders of a fixed infinite size. It is classical that the countable linear orders and the continuum-sized orders exhibit contrasting behaviours. Modern results show that strong extensions … Continue reading
Posted in Basis problems, Partition Relations, Preprints
Tagged Aronszajn tree, Ascending path, Club Guessing, Countryman line, Entangled linear order, Minimal Walks, Monotonically far, Partition relations for trees, Strong coloring, Subtle tree property, Vanishing levels, ZFC construction
2 Comments
A counterexample related to a theorem of Komjáth and Weiss
Joint work with Rodrigo Rey Carvalho. Abstract. In a paper from 1987, Komjath and Weiss proved that for every regular topological space $X$ of character less than $\mathfrak b$, if $X\rightarrow(\text{top }{\omega+1})^1_\omega$, then $X\rightarrow(\text{top }{\alpha})^1_\omega$ for all $\alpha<\omega_1$. In addition, … Continue reading
Posted in Partition Relations, Preprints, Topology
Tagged 03E02, 54G20, Open Access, Prikry-type forcing, ZFC construction
Comments Off on A counterexample related to a theorem of Komjáth and Weiss
A Shelah group in ZFC
Joint work with Márk Poór. Abstract. In a paper from 1980, Shelah constructed an uncountable group all of whose proper subgroups are countable. Assuming the continuum hypothesis, he constructed an uncountable group $G$ that moreover admits an integer $n$ satisfying … Continue reading
Posted in Groups, Publications
Tagged 03E02, 03E75, 20A15, 20E15, 20F06, Jonsson cardinal, Open Access, Strong coloring, strongly bounded groups, Subadditive, ZFC construction
3 Comments
Partitioning a reflecting stationary set
Joint work with Maxwell Levine. Abstract. We address the question of whether a reflecting stationary set may be partitioned into two or more reflecting stationary subsets, providing various affirmative answers in ZFC. As an application to singular cardinals combinatorics, we infer … 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, Entangled linear order, Erdos Cardinal, Hindman's Theorem, Jonsson cardinal, Kurepa Hypothesis, Square-Brackets Partition Relations, Weakly compact cardinal, ZFC construction
1 Comment
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
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
