Related papers: Inverse sequences, rooted trees and their end spac…
Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…
For a labeled tree on the vertex set $\set{1,2,\ldots,n}$, the local direction of each edge $(i\,j)$ is from $i$ to $j$ if $i<j$. For a rooted tree, there is also a natural global direction of edges towards the root. The number of edges…
We define a class of inverse monoids having the property that their lattices of principal ideals naturally form an MV-algebra. We say that an arbitrary MV-algebra can be co-ordinatized if it is isomorphic to one constructed in this way from…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
We study an invariant, the secondary trace, attached to two commuting endomorphisms of a 2-dualizable object in a symmetric monoidal higher category. We establish a secondary trace formula which encodes the natural symmetries of this…
A graph is called set-sequential if its vertices can be labeled with distinct nonzero vectors in $\mathbb{F}_2^n$ such that when each edge is labeled with the sum$\pmod{2}$ of its vertices, every nonzero vector in $\mathbb{F}_2^n$ is the…
We generalize and reprove an identity of Parker and Loday. It states that certain pairs of generating series associated to pairs of labelled rooted planar trees are mutually inverse under composition.
Extended geometry is based on an underlying tensor hierarchy algebra. We extend the previously considered $L_\infty$ structure of the local symmetries (the diffeomorphisms and their reducibility) to incorporate physical fields, field…
We consider fixed-point equations for probability distributions on isometry classes of measured metric spaces. The construction is required to be recursive and tree-like, but we allow loops for the geodesics between points in the support of…
We study the conditions under which the isometry of spaces with metrics generated by weights given on the edges of finite trees is equivalent to the isomorphism of these trees. Similar questions are studied for ultrametric spaces generated…
Geometry of networks endowed with a causal structure is discussed using the conventional framework of equilibrium statistical mechanics. The popular growing network models appear as particular causal models. We focus on a class of tree…
We destroy a finite tree of size $n$ by cutting its edges one after the other and in uniform random order. Informally, the associated cut-tree describes the genealogy of the connected components created by this destruction process. We…
The perturbation expansion of the solution of a fixed point equation or of an ordinary differential equation may be expressed as a power series in the perturbation parameter. The terms in this series are indexed by rooted trees and depend…
Topological phylogenetic trees can be assigned edge weights in several natural ways, highlighting different aspects of the tree. Here the rooted triple and quartet metrizations are introduced, and applied to formulate novel fast methods of…
We build a collection of topological Ramsey spaces of trees giving rise to universal inverse limit structures,extending Zheng's work for the profinite graph to the setting of Fra\"{\i}ss\'{e} classes of finite ordered binary relational…
Using isometric embedding of metric trees into Banach spaces, this paper will investigate barycenters, type and cotype, and various measures of compactness of metric trees. A metric tree ($T$, $d$) is a metric space such that between any…
We first identify (up to linear isomorphism) the Lipschitz free spaces of quasiarcs. By decomposing quasiconformal trees into quasiarcs as done in an article of David, Eriksson-Bique, and Vellis, we then identify the Lipschitz free spaces…
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…
In this paper we consider two aspects of the inverse problem of how to construct merge trees realizing a given barcode. Much of our investigation exploits a recently discovered connection between the symmetric group and barcodes in general…
We introduce a class of combinatorial singularities of Lagrangian skeleta of symplectic manifolds. The link of each singularity is a finite regular cell complex homotopy equivalent to a bouquet of spheres. It is determined by its face poset…