Related papers: An Orchard Theorem
We find surprisingly simple formulas for the limiting probability that the rank of a randomly selected vertex in a randomly selected phylogenetic tree or generalized phylogenetic tree is a given integer.
Building on early work by Stevo Todorcevic, we describe a theory of stationary subtrees of trees of successor-cardinal height. We define the diagonal union of subsets of a tree, as well as normal ideals on a tree, and we characterize…
Fracterms are introduced as a proxy for fractions. A precise definition of fracterms is formulated and on that basis reasonably precise definitions of various classes of fracterms are given. In the context of the meadow of rational numbers…
Rooted phylogenetic networks provide an explicit representation of the evolutionary history of a set $X$ of sampled species. In contrast to phylogenetic trees which show only speciation events, networks can also accommodate reticulate…
This survey may be seen as an introduction to the use of toric and tropical geometry in the analysis of plane curve singularities, which are germs $(C,o)$ of complex analytic curves contained in a smooth complex analytic surface $S$. The…
A staged tree model is a discrete statistical model encoding relationships between events. These models are realised by directed trees with coloured vertices. In algebro-geometric terms, the model consists of points inside a toric variety.…
We prove that, with high probability, in every $2$-edge-colouring of the random tournament on $n$ vertices there is a monochromatic copy of every oriented tree of order $O (n / \sqrt{\log n})$. This generalises a result of the first, third…
In this work we analyze bucket increasing tree families. We introduce two simple stochastic growth processes, generating random bucket increasing trees of size $n$, complementing the earlier result of Mahmoud and Smythe for bucket recursive…
Pastures are a class of field-like algebraic objects which include both partial fields hyperfields and have nice categorical properties. We prove several lift theorems for representations of matroids over pastures, including a…
We study a notion of potential isomorphism, where two structures are said to be potentially isomorphic if they are isomorphic in some generic extension that preserves stationary sets and does not add new sets of cardinality less than the…
A Skolem sequence is a linear arrangement of the multiset, {1, 1, 2, 2, ..., n, n} such that if r in [n] appears in positions i and j, then |i-j| = r. We first translate the problem to a particular set of perfect matchings, then apply the…
We generalise various theorems for finding indiscernible trees and arrays to positive logic: based on an existing modelling theorem for s-trees, we prove modelling theorems for str-trees, str$_0$-trees (the reduct of str-trees that forgets…
We prove Pach-Sharir type incidence theorems for a class of curves in R^n and surfaces in R^3, which we call pseudoflats. In particular, our results apply to a wide class of generic irreducible real algebraic sets of bounded degree.
Building on prior work that established Matrix Quasi-tree Theorems for special embedded graphs, in this paper, we develop a comprehensive theory applicable to all embedded graphs. We introduce symbolic skew-adjacency matrices and reduction…
We prove a monodromy theorem for local vector fields belonging to a sheaf satisfying the unique continuation property. In particular, in the case of admissible regular sheaves of local fields defined on a simply connected manifold, we…
We propose an evolutionary mechanism of phyllotaxis, regular arrangement of leaves on a plant stem. It is shown that the phyllotactic pattern with the Fibonacci sequence has a selective advantage, for it involves the least number of…
We explore the idea of using automatic and similar kind of presentations of structures to deal with the conceptual problem of natural proof-theoretic ordinal notations. We conclude that this approach still does not meet the goals.
The classical matrix tree theorem relates the number of spanning trees of a connected graph with the product of the nonzero eigenvalues of its Laplacian matrix. The class of regular matroids generalizes that of graphical matroids, and a…
We give characterizations, for various fragments of geometric logic, of the class of theories classified by a locally connected (resp. connected and locally connected, atomic, compact, presheaf) topos, and exploit the existence of multiple…
Recently, the minimum number of reticulation events that is required to simultaneously embed a collection P of rooted binary phylogenetic trees into a so-called temporal network has been characterized in terms of cherry-picking sequences.…