Related papers: Trees meet octahedron comparison
We give exact values and bounds on the isoperimetric peak of complete trees, improving on known results. For the complete $q$-ary tree of depth $d$, if $q\ge 5$, then we find that the isoperimetric peak equals $d$, completing an open…
We consider the problem of testing if two input forests are isomorphic or are far from being so. An algorithm is called an $\varepsilon$-tester for forest-isomorphism if given an oracle access to two forests $G$ and $H$ in the adjacency…
The in-order traversal provides a natural correspondence between binary trees with a decreasing vertex labeling and endofunctions on a finite set. By suitably restricting the vertex labeling we arrive at a class of trees that we call…
We prove an analogue for homogeneous trees and certain affine buildings of a result of Bourgain on pinned distances in sets of positive density in Euclidean spaces. Furthermore, we construct an example of a non-homogeneous tree with…
We show that various categories of trees can be modeled by Grothendieck constructions on categories of trees with a fixed set of leaves. We prove this result for the dendroidal category $\Omega$, the category $\Omega^G$ of trees with a…
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…
We prove several results showing that every locally finite Borel graph whose large-scale geometry is "tree-like" induces a treeable equivalence relation. In particular, our hypotheses hold if each component of the original graph either has…
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…
We investigate the interrelations between labeled trees and ultrametric spaces generated by these trees. The labeled trees, which generate complete ultrametrics, totally bounded ultrametrics, and discrete ones, are characterized up to…
We present amalgamated free products satisfying coupling rigidity with respect to the automorphism group of the associated Bass-Serre tree. As an application, we obtain orbit equivalence rigidity for amalgamated free products of mapping…
We obtain assumption-free, non-asymptotic, uniform bounds on the product of the height and the width of uniformly random trees with a given degree sequence, conditioned Bienaym\'e trees and simply generated trees. We show that for a tree of…
In this article, we propose tree edit distance with variables, which is an extension of the tree edit distance to handle trees with variables and has a potential application to measuring the similarity between mathematical formulas,…
We study tree-to-tree transformations that can be defined in first-order logic or monadic second-order logic. We prove a decomposition theorem, which shows that every transformation can be obtained from prime transformations, such as…
The monadic second-order theory of trees allows quantification over elements and over arbitrary subsets. We classify the class of trees with respect to the question: does a tree T have a definable choice function (by a monadic formula with…
We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a problem proposed by Hough. We use the representation of…
We analyze the interplay between labeled trees and the ultrametric spaces they present. We provide characterizations of labeled trees that generate separable ultrametric spaces and those that generate locally finite ultrametric spaces. In…
Metric trees and metric tree arrangements index cones in the polyhedral fan structure in the Dressian $Dr(2,n)$ and $Dr(3,n)$ respectively. We introduce the notion of generalized metric tree arrangements which parameterize points in…
We study the simple random walk on trees and give estimates on the mixing and relaxation time. Relying on a recent characterization by Basu, Hermon and Peres, we give geometric criteria, which are easy to verify and allow to determine…
We study the hive model of gl(n) tensor products, following Knutson, Tao, and Woodward. We define a coboundary category where the tensor product is given by hives and where the associator and commutor are defined using a modified octahedron…
In every dimension $n\ge 3$ we introduce a class of orthogonal graph-manifolds and prove that the fundamental group of any orthogonal graph-manifold quasi-isometrically embeds into a product of $n$ trees. As a consequence, we obtain that…