Archives
Keywords
Forcing PFA countably metacompact S-Space Foundations Rock n' Roll Chromatic number Cohen real Local Club Condensation. weak square Coherent tree Ramsey theory over partitions Microscopic Approach Almost Souslin specializable Souslin tree Prevalent singular cardinals Rainbow sets Parameterized proxy principle Subadditive Dowker space Singular cardinals combinatorics Shelah's Strong Hypothesis club_AD stationary hitting unbounded function O-space sap Successor of Singular Cardinal GMA Uniformization PFA(S)[S] Almost countably chromatic ZFC construction Uniformly coherent Minimal Walks free Souslin tree Whitehead Problem P-Ideal Dichotomy Hereditarily Lindelöf space middle diamond Singular cofinality reflection principles Prikry-type forcing diamond star Lipschitz reduction Fast club Absoluteness Hedetniemi's conjecture higher Baire space Diamond-sharp Amenable C-sequence Fat stationary set Filter reflection AIM forcing stationary reflection Jonsson cardinal L-space Sierpinski's onto mapping principle Partition Relations weak Kurepa tree Was Ulam right Martin's Axiom Universal Sequences Aronszajn tree Erdos-Hajnal graphs approachability ideal Axiom R Generalized descriptive set theory Vanishing levels Almost-disjoint family Ineffable cardinal Greatly Mahlo super-Souslin tree Diamond for trees Ostaszewski square Strongly Luzin set Successor of Regular Cardinal Sigma-Prikry HOD C-sequence Chang's conjecture Non-saturation Antichain Cardinal Invariants Distributive tree Reduced Power Nonspecial tree Erdos Cardinal Weakly compact cardinal ccc projective Boolean algebra free Boolean algebra square principles positive partition relation Analytic sets Iterated forcing Postprocessing function xbox Club Guessing Mandelbrot set Subnormal ideal Poset Small forcing Dushnik-Miller incompactness Closed coloring Ulam matrix square Well-behaved magma Hindman's Theorem Fodor-type reflection Precaliber Rado's conjecture strongly bounded groups Ascent Path transformations OCA regressive Souslin tree Selective Ultrafilter Generalized Clubs polarized partition relation Slim tree Kurepa Hypothesis Reflecting stationary set indecomposable ultrafilter b-scale Square-Brackets Partition Relations coloring number Forcing Axioms Subtle cardinal 54G20 Diamond stick Souslin Tree full tree Cardinal function weak diamond very good scale Commutative cancellative semigroups nonmeager set Knaster Knaster and friends Singular Density Luzin set Constructible Universe SNR Subtle tree property tensor product graph Sakurai's Bell inequality Uniformly homogeneous Strong coloring Large Cardinals Open Access
Tag Archives: Ulam matrix
Gdańsk Logic Conference, May 2023
I gave an invited talk at the first Gdańsk Logic Conference, May 2023. Talk Title: Was Ulam right? Abstract: An Ulam matrix is one of the earliest gems of infinite combinatorics. Around the same time of its discovery, another Polish … Continue reading
Winter School in Abstract Analysis, January 2023
I gave a 3-lecture tutorial at the Winter School in Abstract Analysis in Steken, January 2023. Title: Club guessing Abstract. Club guessing principles were introduced by Shelah as a weakening of Jensen’s diamond. Most spectacularly, they were used to prove … Continue reading
Was Ulam right? II: Small width and general ideals
Joint work with Tanmay Inamdar. Abstract. We continue our study of Sierpinski-type colourings. In contrast to the prequel paper, we focus here on colourings for ideals stratified by their completeness degree. In particular, improving upon Ulam’s theorem and its extension … Continue reading
Posted in Partition Relations, Publications
Tagged 03E02, 03E35, 03E55, C-sequence, Open Access, Subnormal ideal, Ulam matrix, Was Ulam right
1 Comment
Was Ulam right? I: Basic theory and subnormal ideals
Joint work with Tanmay Inamdar. Abstract. We introduce various coloring principles which generalize the so-called onto mapping principle of Sierpinski to larger cardinals and general ideals. We prove that these principles capture the notion of an Ulam matrix and allow … Continue reading
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
4th Arctic Set Theory Workshop, January 2019
I gave an invited talk at the Arctic Set Theory Workshop 4 in Kilpisjärvi, January 2019. Talk Title: Splitting a stationary set: Is there another way? Abstract: Motivated by a problem in pcf theory, we seek for a new way … Continue reading
Posted in Invited Talks
Tagged Club Guessing, Reflecting stationary set, Ulam matrix, very good scale
Comments Off on 4th Arctic Set Theory Workshop, January 2019