Related papers: Saturated Fully Leafed Tree-Like Polyforms and Pol…
We study lattice polytopes which arise as the convex hull of chip vectors for \textit{self-reachable} chip configurations on a tree $T$. We show that these polytopes always have the integer decomposition property and characterize the vertex…
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…
Assume that we embed the path $P_n$ as a subgraph of a $2$-dimensional grid, namely, $P_k \times P_l$. Given such an embedding, we consider the ordered set of subpaths $L_1, L_2, \ldots , L_m$ which are maximal straight segments in the…
Tree-based phylogenetic networks, which may be roughly defined as leaf-labeled networks built by adding arcs only between the original tree edges, have elegant properties for modeling evolutionary histories. We answer an open question of…
For any root system of rank $r$, we study the "dominant weight polytope" $P^\lambda$ associated with a strongly dominant weight $\lambda$. We prove that $P^\lambda$ is combinatorially equivalent to the $r$-dimensional cube. As an…
Tree-shaped graphical models are widely used for their tractability. However, they unfortunately lack expressive power as they require committing to a particular sparse dependency structure. We propose a novel class of generative models…
A suffix tree is a data structure used mainly for pattern matching. It is known that the space complexity of simple suffix trees is quadratic in the length of the string. By a slight modification of the simple suffix trees one gets the…
We construct vertex transitive lattices on products of trees of arbitrary dimension $d \geq 1$ based on quaternion algebras over global fields with exactly two ramified places. Starting from arithmetic examples, we find non-residually…
We develop a procedure for the complete computational enumeration of lattice $3$-polytopes of width larger than one, up to any given number of lattice points. We also implement an algorithm for doing this and enumerate those with at most…
Let $R$ be a polynomial ring and $I \subset R$ be a perfect ideal of height two minimally generated by forms of the same degree. We provide a formula for the multiplicity of the saturated special fiber ring of $I$. Interestingly, this…
This note defines a notion of multiplicity for nodes in a rooted tree and presents an asymptotic calculation of the maximum multiplicity over all leaves in a Bienaym\'e-Galton-Watson tree with critical offspring distribution $\xi$,…
The tree complex is a simplicial complex defined in recent work of Belk, Lanier, Margalit, and Winarski with natural applications to mapping class groups and complex dynamics. In this article, we connect this setting with the study of…
In this work, we study the geometric properties of spacelike foliations by hypersurfaces on a Lorentz manifold. We investigate conditions for the leaves being stable, totally geodesic or totally umbilical. We consider that…
Weighted recursive trees are built by adding successively vertices with predetermined weights to a tree: each new vertex is attached to a parent chosen randomly proportionally to its weight. Under some assumptions on the sequence of…
In this work we introduce and study various generalizations of the notion of increasingly labelled trees, where the label of a child node is always larger than the label of its parent node, to multilabelled tree families, where the nodes in…
This paper is concerned with a shape optimization problem, where the functional to be maximized describes the total sunlight collected by a distribution of tree leaves, minus the cost for transporting water and nutrient from the base of the…
We characterize the ``best'' model geometries for the class of virtually free groups, and we show that there is a countable infinity of distinct ``best'' model geometries in an appropriate sense--these are the maximally symmetric trees. The…
We investigate flows on graphs whose links have random capacities. For binary trees we derive the probability distribution for the maximal flow from the root to a leaf, and show that for infinite trees it vanishes beyond a certain threshold…
An evolutionary tree (phylogenetic tree) is a binary, rooted, unordered tree that models the evolutionary history of currently living species in which leaves are labeled by species. In this paper, we investigate the problem of finding the…
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…