16 citations · 77 across the 36 of their papers we have counts for
46 papers
Generalized almost disjoint families and injective Banach spaces
Chris Lambie-Hanson, David Schrittesser
A fundamental open problem in the homological theory of Banach spaces is the calculation of the injective dimension of the Banach space . We make a contribution to the study o…
Almost Kurepa Suslin trees and destructibility of the Guessing Model Property
Chris Lambie-Hanson, Šárka Stejskalová
Building on recent work of Krueger and the second author, we prove the consistency of the Guessing Model Principle at together with the existence of an almost Kurepa Suslin t…
Higher walks and squares
Chris Lambie-Hanson, Pedro Marun
We continue the development of the theory of higher dimensional walks on ordinals began recently by Bergfalk. In particular we identify natural coherence conditions on higher dimen…
Preservation of some topological properties under forcing
Chris Lambie-Hanson, Pedro Marun
We add to the theory of preservation of topological properties under forcing. In particular, we answer a question of Gilton and Holshouser in a strong sense, showing that if player…
Strongly increasing sequences
Paul B. Larson, Chris Lambie-Hanson
Using a variation of Woodin's forcing, we force over a model of the Axiom of Determinacy to produce a model of ZFC containing a very strongly increasing…
Infinitary combinatorics in condensed math and strong homology
Jeffrey Bergfalk, Chris Lambie-Hanson
Recent advances in our understanding of higher derived limits carry multiple implications in the fields of condensed and pyknotic mathematics, as well as for the study of strong ho…
Kurepa trees, continuous images, and perfect set properties
Chris Lambie-Hanson, Šárka Stejskalová
Building upon work of Lücke and Schlicht, we study (higher) Kurepa trees through the lens of higher descriptive set theory, focusing in particular on various perfect set properties…
Simultaneously nonvanishing higher derived limits
Matteo Casarosa, Chris Lambie-Hanson
The derived functors of the inverse limit find many applications in algebra and topology. In particular, the vanishing of certain derived limits , pa…
Two-cardinal derived topologies, indescribability and Ramseyness
Brent Cody, Chris Lambie-Hanson, Jing Zhang
We introduce a natural two-cardinal version of Bagaria's sequence of derived topologies on ordinals. We prove that for our sequence of two-cardinal derived topologies, limit points…
Squares, ultrafilters and forcing axioms
Chris Lambie-Hanson, Assaf Rinot, Jing Zhang
We study relationships between various set theoretic compactness principles, focusing on the interplay between the three families of combinatorial objects or principles mentioned i…
Hajnal--Máté graphs, Cohen reals, and disjoint type guessing
Chris Lambie-Hanson, Dávid Uhrik
A Hajnal--Máté graph is an uncountably chromatic graph on satisfying a certain natural sparseness condition. We investigate Hajnal-Máté graphs and generalizations thereof, fo…
Whitehead's problem and condensed mathematics
Jeffrey Bergfalk, Chris Lambie-Hanson, Jan Šaroch
One of the better-known independence results in general mathematics is Shelah's solution to Whitehead's problem of whether implies that an abelian…
Narrow systems revisited
Chris Lambie-Hanson
Motivated by two open questions about two-cardinal tree properties, we introduce and study generalized narrow system properties. The first of these questions asks whether the stron…
Guessing models, trees, and cardinal arithmetic
Chris Lambie-Hanson, Šárka Stejskalová
Since being isolated by Viale and Weiss in 2009, the Guessing Model Property has emerged as a particularly prominent and powerful consequence of the Proper Forcing Axiom. In this p…
Polish space partition principles and the Halpern-Läuchli theorem
Chris Lambie-Hanson, Andy Zucker
The Halpern-Läuchli theorem, a combinatorial result about trees, admits an elegant proof due to Harrington using ideas from forcing. In an attempt to distill the combinatorial esse…
Strong tree properties, Kurepa trees, and guessing models
Chris Lambie-Hanson, Šárka Stejskalová
We investigate the generalized tree properties and guessing model properties introduced by Weiß and Viale, as well as natural weakenings thereof, studying the relationships among t…
Indestructibility of some compactness principles over models of PFA
Radek Honzik, Chris Lambie-Hanson, Šárka Stejskalová
We show that (Proper Forcing Axiom) implies that adding any number of Cohen subsets of will not add an -Aronszajn tree or a weak -Kurepa tree, and more…
A Galvin-Hajnal theorem for generalized cardinal characteristics
Chris Lambie-Hanson
We prove that a variety of generalized cardinal characteristics, including meeting numbers, the reaping number, and the dominating number, satisfy an analogue of the Galvin-Hajnal…
Knaster and friends III: Subadditive colorings
Chris Lambie-Hanson, Assaf Rinot
We continue our study of strongly unbounded colorings, this time focusing on subadditive maps. In Part I of this series, we showed that, for many pairs of infinite cardinals ,…
Simutaneously vanishing higher derived limits without large cardinals
Jeffrey Bergfalk, Michael Hrušák, Chris Lambie-Hanson
A question dating to Sibe Mardešić and Andrei Prasolov's 1988 work Strong homology is not additive, and motivating a considerable amount of set theoretic work in the ensuing years,…
Higher-dimensional Delta-systems
Chris Lambie-Hanson
We investigate higher-dimensional -systems indexed by finite sets of ordinals, isolating a particular definition thereof and proving a higher-dimensional version of the classica…
A note on highly connected and well-connected Ramsey theory
Chris Lambie-Hanson
We study a pair of weakenings of the classical partition relation recently introduced by Bergfalk-Hrušák-Shelah and Bergfalk, respectively. Given an edge-col…
Disjoint type graphs with no short odd cycles
Chris Lambie-Hanson
In this note, we provide a proof of a technical result of Erdős and Hajnal about the existence of disjoint type graphs with no odd cycles. We also prove that this result is sharp i…
Extremal triangle-free and odd-cycle-free colourings of uncountable graphs
Chris Lambie-Hanson, Dániel T. Soukup
The optimality of the Erdős-Rado theorem for pairs is witnessed by the colouring recording the least point of disagreement between two functions. This…