English
Related papers

Related papers: Almost Souslin Kurepa trees

200 papers

We prove that successors of singular limits of strongly compact cardinals have the strong tree property. We also prove that aleph_{omega+1} can consistently satisfy the strong tree property.

Logic · Mathematics 2013-01-28 Laura Fontanella

In this expository paper, we present a construction of tree modules and combine it with (infinite dimensional) tilting theory and relative Mittag-Leffler conditions in order to explore limits of the approximation theory of modules. We also…

Representation Theory · Mathematics 2019-01-08 Jan Trlifaj

We extend to the case of semi-abelian varieties the statements of various variants of the conjecture alla Bogomolov about the non-density of small points of small height in abelian varieties. Inspired by recent work of Ullmo, Zhang and…

Number Theory · Mathematics 2007-05-23 Antoine Chambert-Loir

We introduce the continuum self-similar tree (CSST) and characterize it topologically. We apply this to answer a question of Curien about the topology of the continuum random tree (CRT). We also give a topological characterization of other…

Geometric Topology · Mathematics 2020-02-25 Mario Bonk , Huy Tran

We prove the consistency of $\mathrm{add}(\mathcal{N})<\mathrm{cov}(\mathcal{N})<\mathfrak{p}=\mathfrak{g}=\mathfrak{s}<\mathrm{add}(\mathcal{M})=\mathrm{cof}(\mathcal{M})<\mathfrak{a}=\mathrm{non}(\mathcal{N})=\mathfrak{c}$ with ZFC where…

Logic · Mathematics 2019-08-15 Vera Fischer , Diego A. Mejía

We look for minimal conditions on a two-dimensional metric surface $X$ of locally finite Hausdorff $2$-measure under which $X$ admits an (almost) parametrization with good geometric and analytic properties. Only assuming that $X$ is locally…

Metric Geometry · Mathematics 2021-06-16 Damaris Meier , Stefan Wenger

We consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees with $n$ edges and a complexity of natural number $n$ is…

Combinatorics · Mathematics 2012-05-03 B. S. Kochkarev

An $\alpha$-thin tree $T$ of a graph $G$ is a spanning tree such that every cut of $G$ has at most an $\alpha$ proportion of its edges in $T$. The Thin Tree Conjecture proposes that there exists a function $f$ such that for any $\alpha >…

Computational Complexity · Computer Science 2026-01-01 Alice Moayyedi

Assuming the existence of a strong cardinal $\kappa$ and a measurable cardinal above it, we force a generic extension in which $\kappa$ is a singular strong limit cardinal of any prescribed cofinality, and such that the tree property holds…

Logic · Mathematics 2017-08-08 Mohammad Golshani , Rahman Mohammadpour

With the help of various square principles, we obtain results concerning the consistency strength of several statements about trees containing ascent paths, special trees, and strong chain conditions. Building on a result that shows that…

Logic · Mathematics 2019-02-20 Chris Lambie-Hanson , Philipp Lücke

Let A be an exact category, that is, an extension-closed full subcategory of an abelian category. Firstly, we give some necessary and sufficient conditions for A to have almost split sequences. Then, we study when an almost split sequence…

Category Theory · Mathematics 2012-03-23 Shiping Liu , Puiman Ng , Charles Paquette

We prove that every tree of maximum degree $\Delta$ with $\ell$ leaves contains paths between leaves of at least $\log_{\Delta-1}((\Delta-2)\ell)$ distinct lengths. This settles in a strong form a conjecture of Narins, Pokrovskiy and…

Combinatorics · Mathematics 2025-04-18 Francesco Di Braccio , Kyriakos Katsamaktsis , Alexandru Malekshahian

We present an alternate proof of the passage from the finiteness principle for metric trees to the construction of the core in the C. Fefferman and Shvartsman finiteness theorem for Lipschitz selection problems.

Functional Analysis · Mathematics 2018-01-04 A. Brudnyi

We investigate the asymptotic densities of theorems provable in Zermelo-Fraenkel set theory ZF and its extension ZFC including the axiom of choice. Assuming a canonical De Bruijn representation of formulae, we construct asymptotically large…

Logic · Mathematics 2021-01-26 Maciej Bendkowski

In this paper, we introduce the notion of Cartesian Forest, which generalizes Cartesian Trees, in order to deal with partially ordered sequences. We show that algorithms that solve both exact and approximate Cartesian Tree Matching can be…

Data Structures and Algorithms · Computer Science 2025-10-20 Bastien Auvray , Julien David , Richard Groult , Thierry Lecroq

We investigate the connections between tree amalgamations and quasi-isometries. In particular, we prove that the quasi-isometry type of multi-ended accessible quasi-transitive connected locally finite graphs is determined by the…

Combinatorics · Mathematics 2018-12-13 Matthias Hamann

We prove that the existence of a non-special tree of size $\lambda$ is equivalent to the existence of an uncountably chromatic graph with no $K_{\omega_1}$ minor of size $\lambda$, establishing a connection between the special tree number…

Logic · Mathematics 2022-12-06 Dávid Uhrik

In this paper we provide two new constructions that are useful for the theory of projection complexes developed by Bestvina, Bromberg, Fujiwara and Sisto. We prove that there exists a subtree of the projection complex which is…

Group Theory · Mathematics 2024-12-18 Patrick S. Nairne

In this work we answer an open question asked by Johnson--Scoville. We show that each merge tree is represented by a discrete Morse function on a path. Furthermore, we present explicit constructions for two different but related kinds of…

Algebraic Topology · Mathematics 2023-01-04 Julian Brüggemann

Let $\mathfrak{i}$ denote the minimal cardinality of a maximal independent family and let $\mathfrak{a}_T$ denote the minimal cardinality of a maximal family of pairwise almost disjoint subtrees of $2^{<\omega}$. Using a countable support…

Logic · Mathematics 2019-12-24 Vera Fischer
‹ Prev 1 8 9 10 Next ›