相关论文: On full Souslin trees

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

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…

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…

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.

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…

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…

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.…

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…

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…

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

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…

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

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…

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…

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…

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…

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…

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…

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…

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.