相关论文: Rowmotion on rooted trees
We show tight upper and lower bounds for switching lemmas obtained by the action of random $p$-restrictions on boolean functions that can be expressed as decision trees in which every vertex is at a distance of at most $t$ from some leaf,…
It has been claimed in Aldous, Miermont and Pitman [PTRF, 2004] that all L\'evy trees are mixings of inhomogeneous continuum random trees. We give a rigorous proof of this claim in the case of a stable branching mechanism, relying on a new…
This paper will show when a rooted path tree of a finite directed rooted graph has only finitely many orbits under the action of its undirected automorphism group (i.e. when it is cocompact). This will allow us to specify which trees are…
We introduce a new class of compact metrizable spaces, which we call fences, and its subclass of smooth fences. We isolate two families $\mathcal F, \mathcal F_0$ of Hasse diagrams of finite partial orders and show that smooth fences are…
A geometric graph is a simple graph G together with a straight line drawing of G in the plane with the vertices in general position. Two geometric realizations of a simple graph are geo-isomorphic if there is a vertex bijection between them…
We introduce the concept of Most, and Least, Compact Spanning Trees - denoted respectively by $T^*(G)$ and $T^\#(G)$ - of a simple, connected, undirected and unweighted graph $G(V, E, W)$. For a spanning tree $T(G) \in \mathcal{T}(G)$ to be…
We study the geometry of metrics and convexity structures on the space of phylogenetic trees, which is here realized as the tropical linear space of all \ ultrametrics. The ${\rm CAT}(0)$-metric of Billera-Holmes-Vogtman arises from the…
We consider $f:\hat I\to \R$ being a $C^3$ (or $C^2$ with bounded distortion) real-valued multimodal map with non-flat critical points, defined on $\hat I$ being the union of closed intervals, and its restriction to the maximal forward…
Phylogenetic networks are a type of directed acyclic graph that represent how a set $X$ of present-day species are descended from a common ancestor by processes of speciation and reticulate evolution. In the absence of reticulate evolution,…
We consider a natural notion of search trees on graphs, which we show is ubiquitous in various areas of discrete mathematics and computer science. Search trees on graphs can be modified by local operations called rotations, which generalize…
We give a counterexample to a conjecture of Poon [Poo06] that any orthogonal tree in two dimensions can always be flattened by a continuous motion that preserves edge lengths and avoids self-intersection. We show our example is locked by…
Let $\T_{n}$ be the set of rooted labeled trees on $\set{0,...,n}$. A maximal decreasing subtree of a rooted labeled tree is defined by the maximal subtree from the root with all edges being decreasing. In this paper, we study a new…
A tree $T$ is said to be homogeneous if it is uniquely rooted and there exists an integer $b\geq 2$, called the branching number of $T$, such that every $t\in T$ has exactly $b$ immediate successors. We study the behavior of measurable…
Gene trees are evolutionary trees representing the ancestry of genes sampled from multiple populations. Species trees represent populations of individuals -- each with many genes -- splitting into new populations or species. The coalescent…
In the present paper we study twisted foldings of root systems which generalize usual involutive foldings corresponding to automorphisms of Dynkin diagrams. Our motivating example is the Lusztig projection of the root system of type $E_8$…
Richard P. Stanley conjectured that finite trees can be distinguished by their chromatic symmetric functions. In this paper, we prove an analogous statement for posets: Finite rooted trees can be distinguished by their order quasisymmetric…
A temporal graph is a graph whose edges appear at certain points in time. These graphs are temporally connected (in class TC) if all vertices can reach each other by temporal paths (traversing the edges in chronological order). Reachability…
Phylogenetic networks are a generalization of phylogenetic trees that are used to represent non-tree-like evolutionary histories that arise in organisms such as plants and bacteria, or uncertainty in evolutionary histories. An…
In phylogenetics, tree-based networks are used to model and visualize the evolutionary history of species where reticulate events such as horizontal gene transfer have occurred. Formally, a tree-based network $N$ consists of a phylogenetic…
Minimum spanning trees and forests are powerful sparsification techniques that remove cycles from weighted graphs to minimize total edge weight while preserving node connectivity. They have applications in computer science, network science,…