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