Related papers: The diameter of caterpillar associahedra
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…
Graph associahedra are generalized permutohedra arising as special cases of nestohedra and hypergraphic polytopes. The graph associahedron of a graph $G$ encodes the combinatorics of search trees on $G$, defined recursively by a root $r$…
The associahedron $\mathcal{A}(G)$ of a graph $G$ has the property that its vertices can be thought of as the search trees on $G$ and its edges as the rotations between two search trees. If $G$ is a simple path, then $\mathcal{A}(G)$ is the…
It is proven here that the diameter of the d-dimensional associahedron is 2d-4 when d is greater than 9. Two maximally distant vertices of this polytope are explicitly described as triangulations of a convex polygon, and their distance is…
Rotation distances measure the differences in structure between rooted ordered binary trees. The one-dimensional skeleta of associahedra are rotation graphs, where two vertices representing trees are connected by an edge if they differ by a…
The tree-level scattering amplitudes for $\text{tr}(\phi^3)$ theory can be interpreted as a sum over the vertices of a polytope known as the associahedron. For each graph $G$, there exists a natural generalisation of the associahedron,…
Generalized associahedra were introduced by S. Fomin and A. Zelevinsky in connection to finite type cluster algebras. Following recent work of L. Pournin in types $A$ and $B$, this paper focuses on geodesic properties of generalized…
In a remarkable recent work [arXiv : 1711.09102] by Arkani-Hamed et al, the amplituhedron program was extended to the realm of non-supersymmetric scattering amplitudes. In particular it was shown that for tree-level planar diagrams in…
A graph $G$ is said to be Hamiltonian if it contains a spanning cycle. In this work, we investigate the Hamiltonian completeness of certain classes of caterpillar graphs, which are trees with a central path to which all other vertices are…
Binary search trees (BST) are a popular type of data structure when dealing with ordered data. Indeed, they enable one to access and modify data efficiently, with their height corresponding to the worst retrieval time. From a probabilistic…
Taking a representation-theoretic viewpoint, we construct a continuous associahedron motivated by the realization of the generalized associahedron in the physical setting. We show that our associahedron shares important properties with the…
The Binary Search Tree (BST) is average in computer science which supports a compact data structure in memory and oneself even conducts a row of quick algorithms, by which people often apply it in dynamical circumstance. Besides these…
An associahedron is a polytope whose vertices correspond to triangulations of a convex polygon and whose edges correspond to flips between them. Using labeled polygons, C. Hohlweg and C. Lange constructed various realizations of the…
This study is dedicated to precise distributional analyses of the height of non-plane unlabelled binary trees ("Otter trees"), when trees of a given size are taken with equal likelihood. The height of a rooted tree of size $n$ is proved to…
Let $\mathcal{T}$ be the set of spanning trees of $G$ and let $L(T)$ be the number of leaves in a tree $T$. The leaf number $L(G)$ of $G$ is defined as $L(G)=\max\{L(T)|T\in \mathcal{T}\}$. Let $G$ be a connected graph of order $n$ and…
Let $G$ be a connected graph and $W$ be a set of vertices of $G$. The representation multiset of a vertex $v$ with respect to $W$, $r_m (v|W)$, is defined as a multiset of distances between $v$ and the vertices in $W$. If $r_m (u |W) \neq…
The size of the largest common subtree (maximum agreement subtree) of two independent uniform random binary trees on $n$ leaves is known to be between orders $n^{1/8}$ and $n^{1/2}$. By a construction based on recursive splitting and…
An associahedron is a polytope whose vertices correspond to the triangulations of a convex polygon and whose edges correspond to flips between them. A particularly elegant realization of the associahedron, due to S. Shnider and S. Sternberg…
This paper uses combinatorics and group theory to answer questions about the assembly of icosahedral viral shells. Although the geometric structure of the capsid (shell) is fairly well understood in terms of its constituent subunits, the…
We show that the expected size of the maximum agreement subtree of two $n$-leaf trees, uniformly random among all trees with the shape, is $\Theta(\sqrt{n})$. To derive the lower bound, we prove a global structural result on a decomposition…