English
Related papers

Related papers: On full Souslin trees

200 papers

We present a question which implies a complete positive answer for the Bass-Quillen Conjecture.

Commutative Algebra · Mathematics 2020-07-14 Dorin Popescu

Let $\mathcal{T}_n$ be the set of trees with $n$ vertices. Suppose that each tree in $\mathcal{T}_n$ is equally likely. We show that the number of different rooted trees of a tree equals $(\mu_r+o(1))n$ for almost every tree of…

Combinatorics · Mathematics 2013-05-21 Xueliang Li , Yiyang Li , Yongtang Shi

In this paper we study the theories of the infinite-branching tree and the $r$-regular tree, and show that both of them are pseudofinite. Moreover, we show that they can be realized by infinite ultraproducts of polynomial exact classes of…

Logic · Mathematics 2026-01-14 Darío García , Melissa Robles

In this short note, we find the number of forests of chord diagrams with a given number of trees and a given number of chords.

Combinatorics · Mathematics 2015-01-08 Huseyin Acan

Comparative analyses of phylogenetic trees typically require identical taxon sets, however, in practice, trees often include distinct but overlapping taxa. Pruning non-shared leaves discards phylogenetic signal, whereas tree completion can…

Populations and Evolution · Quantitative Biology 2026-04-28 Aleksandr Koshkarov , Nadia Tahiri

Every smooth fiber bundle admits a complete (Ehresmann) connection. This result appears in several references, with a proof on which we have found a gap, that does not seem possible to remedy. In this note we provide a definite proof for…

Differential Geometry · Mathematics 2017-01-11 Matias del Hoyo

We present a characterization of spaces of strictly decreasing functions on trees in terms of bisequentiality. This characterization answers Questions 6.1 and 6.2 of "A filter on a collection of finite sets and Eberlein compacta" by T.…

General Topology · Mathematics 2018-09-06 Claudio Agostini , Jacopo Somaglia

In this note we consider the Steiner tree problem under Bilu-Linial stability. We give strong geometric structural properties that need to be satisfied by stable instances. We then make use of, and strengthen, these geometric properties to…

Data Structures and Algorithms · Computer Science 2021-09-29 James Freitag , Neshat Mohammadi , Aditya Potukuchi , Lev Reyzin

Definitions of dense linear orders (with/without endpoints), separable linear orders, complete linear orders, the countable chain condition for linear orders, a Suslin line/Suslin tree and Suslin's problem Statement and proof of Cantor's…

Number Theory · Mathematics 2025-08-22 Trey Smith , Aksel Ozer

We give a proof of a result of Bonet, Engli\v{s} and Taskinen filling in several details and correcting some flaws.

Functional Analysis · Mathematics 2010-02-22 Sven-Ake Wegner

A perfect forest is a spanning forest of a connected graph $G$, all of whose components are induced subgraphs of $G$ and such that all vertices have odd degree in the forest. A perfect forest generalised a perfect matching since, in a…

Combinatorics · Mathematics 2016-12-16 Yair Caro , Josef Lauri , Christina Zarb

In this note I respond to Vilenkin's claim that there must have been a beginning.

High Energy Physics - Theory · Physics 2012-04-25 Leonard Susskind

A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of binary trees whose leaves are labeled by letters of an alphabet…

Formal Languages and Automata Theory · Computer Science 2024-02-14 Andre Arnold , Patrick Cegielski , Serge Grigorieff , Irene Guessarian

We prove the following indistinguishability theorem for $k$-tuples of trees in the uniform spanning forest of $\mathbb{Z}^d$: Suppose that $\mathscr{A}$ is a property of a $k$-tuple of components that is stable under finite modifications of…

Probability · Mathematics 2018-10-16 Tom Hutchcroft

We consider matrices with entries that are polynomials in $q$ arising from natural $q$-generalisations of two well-known formulas that count: forests on $n$ vertices with $k$ components; and trees on $n+1$ vertices where $k$ children of the…

Combinatorics · Mathematics 2021-06-03 Tomack Gilmore

We give an alternative proof of the Bestvina--Feighn combination theorem for trees hyperbolic spaces and describe uniform quasigeodesics in such spaces. As one of the applications, we prove the existence of Cannon-Thurston maps for…

Group Theory · Mathematics 2022-02-22 Michael Kapovich , Pranab Sardar

We present recursive formulas giving the maximal number of leaves in tree-like polyforms living in two-dimensional regular lattices and in tree-like polycubes in the three-dimensional cubic lattice. We call these tree-like polyforms and…

Combinatorics · Mathematics 2018-03-28 Blondin Massé Alexandre , de Carufel Julien , Goupil Alain

We prove the consistency, assuming an ineffable cardinal, that any two normal countably closed $\omega_2$-Aronszajn trees are club isomorphic. This work generalizes to higher cardinals the property of Abraham-Shelah that any two normal…

Logic · Mathematics 2018-06-05 John Krueger

A quasiconformal tree is a doubling (compact) metric tree in which the diameter of each arc is comparable to the distance of its endpoints. We show that for each integer $n\geq 2$, the class of all quasiconformal trees with uniform branch…

Metric Geometry · Mathematics 2024-11-13 Efstathios Konstantinos Chrontsios Garitsis , Fotis Ioannidis , Vyron Vellis

We prove two theorems on cohomologically complete complexes. These theorems are inspired by, and yield an alternative proof of, a recent theorem of P. Schenzel on complete modules.

Commutative Algebra · Mathematics 2014-04-30 Amnon Yekutieli