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