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