Related papers: How special is your Aronszajn tree?

A new construction is given of non-standard uniserial modules over certain valuation domains; the construction resembles that of a special Aronszajn tree in set theory. A consequence is the proof of a sufficient condition for the existence…

For a tree $T$, let $i_T(t)$ be the number of independent sets of size $t$ in $T$. It is an open question, raised by Alavi, Malde, Schwenk and Erd\H{o}s, whether the sequence $(i_T(t))_{t \geq 0}$ is always unimodal. Here we answer the…

A tree-based network on a set $X$ of $n$ leaves is said to be universal if any rooted binary phylogenetic tree on $X$ can be its base tree. Francis and Steel showed that there is a universal tree-based network on $X$ in the case of $n=3$,…

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…

Let $T(n,m)$ be the set of all plane labelled bipartite trees with $n$ white vertices and $m$ black. If the number $n+m$ of vertices is even, then the set $T(n,m)$ is a union of two disjoint subsets --- subset od "even" trees and subset of…

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…

A celebrated result of Otter says the number of distinct unlabelled spanning trees in $K_n$ is $\alpha^n$ up to subexponential factors for an absolute constant $\alpha>0$. In this note, we prove that for every $0<\varepsilon<\alpha$, there…

An algebraic tree T is one determined by a finite system of fixed point equations. The frontier \Fr(T) of an algebraic tree t is linearly ordered by the lexicographic order \lex. When (\Fr(T),\lex) is well-ordered, its order type is an…

We study randomly growing trees governed by the affine preferential attachment rule. Starting with a seed tree $S$, vertices are attached one by one, each linked by an edge to a random vertex of the current tree, chosen with a probability…

Let $k$ be a base field and $G$ be an algebraic group over $k$. J.-P. Serre defined $G$ to be special if every $G$-torsor $T \to X$ is locally trivial in the Zariski topology for every reduced algebraic variety $X$ defined over $k$. In…

A forest is a generalization of a tree, and here we consider the Aronszajn and Suslin properties for forests. We focus on those forests satisfying coherence, a local smallness property. We show that coherent Aronszajn forests can be…

In this paper we make a partial progress on the following conjecture: for every $\mu>0$ and large enough $n$, every Steiner triple system $S$ on at least $(1+\mu)n$ vertices contains every hypertree $T$ on $n$ vertices. We prove that the…

The quantity that captures the asymptotic value of the maximum number of appearances of a given topological tree (a rooted tree with no vertices of outdegree $1$) $S$ with $k$ leaves in an arbitrary tree with sufficiently large number of…

The primary goal of this paper is to establish a model of $ZFC$ wherein the definable tree property is affirmed for all uncountable regular cardinals. This endeavor commences with the utilization of both a supercompact cardinal and a…

We show it is consistent that there is a Souslin tree $S$ such that after forcing with $S$, $S$ is Kurepa and for all clubs $C \subset \omega_1$, $S\upharpoonright C$ is rigid. This answers Fuchs's questions in Club degrees of rigidity and…

Let $E/\mathbb{Q}(T)$ be a non-isotrivial elliptic curve of rank $r$. A theorem due to Silverman implies that the rank $r_t$ of the specialization $E_t/\mathbb{Q}$ is at least $r$ for all but finitely many $t \in \mathbb{Q}$. Moreover, it…

We determine upper and lower bounds for the number of maximum matchings (i.e., matchings of maximum cardinality) $m(T)$ of a tree $T$ of given order. While the trees that attain the lower bound are easily characterised, the trees with…

We generalize the diamond principle and its variants using the notion of stationarity in trees introduced by Brodsky in [Brodsky, A. M., A theory of stationary trees and the balanced Baumgartner--Hajnal--Todorcevic theorem for trees. The…

A linear order $A$ is called strongly surjective if for every non empty suborder $B \preceq A$, there is an epimorphism from $A$ onto $B$ (denoted by $B \trianglelefteq A$). We show, answering some questions of D\'aniel T. Soukup, that…

We define an all-$k$-isolating set of a graph to be a set $S$ of vertices such that, if one removes $S$ and all its neighbors, then no component in what remains has order $k$ or more. The case $k=1$ corresponds to a dominating set and the…