相关论文: Inverse sequences, rooted trees and their end spac…

There is a well-known correspondence between infinite trees and ultrametric spaces which can be interpreted as an equivalence of categories and comes from considering the end space of the tree. In this equivalence, uniformly continuous maps…

Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…

The famous Koecher-Vinberg theorem characterises the finite dimensional formally real Jordan algebras among the finite dimensional order unit spaces as the ones that have a symmetric cone. An alternative characterisation of symmetric cones…

If a graph has a non-singular adjacency matrix, then one may use the inverse matrix to define a (labeled) graph that may be considered to be the inverse graph to the original one. It has been known that an adjacency matrix of a tree is…

In this paper, we study metric trees, without any finiteness restrictions. For subsets of such trees, a condition that guarantees that the Hausdorff and Gromov--Hausdorff distances from the subset to the entire metric tree are the same is…

The equivalence of a conformal metric on 4-dimensional space-time and a local field of 3-dimensional subspaces of the space of 2-forms over space-time is discussed and the basic notion of transection is introduced. Corresponding relation is…

For a finitely generated group $G$, we introduce an asymmetric pseudometric on projectivized deformation spaces of $G$-trees, using stretching factors of $G$-equivariant Lipschitz maps, that generalizes the Lipschitz metric on Outer space…

We tackle the problem of a combinatorial classification of finite metric spaces via their fundamental polytopes, as suggested by Vershik in 2010. In this paper we consider a hyperplane arrangement associated to every split pseudometric and,…

In this paper we present with algebraic trees a novel notion of (continuum) trees which generalizes countable graph-theoretic trees to (potentially) uncountable structures. For that purpose we focus on the tree structure given by the branch…

We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…

Extended geometry provides a unified framework for double geometry, exceptional geometry, etc., i.e., for the geometrisations of the string theory and M-theory dualities. In this talk, we will explain the structure of gauge transformations…

We consider the in-plane motion of elastic strings on tree-like network, observed from the 'leaves'. We investigate the inverse problem of recovering not only the physical properties i.e. the 'optical lengths' of each string, but also the…

We reconstruct a complete type II superstring field theory with L-infinity structure in a symmetric way concerning the left- and right-moving sectors. Based on the new construction, we show again that the tree-level S-matrix agrees with…

A finite projective plane, or more generally a finite linear space, has an associated incidence complex that gives rise to two natural algebras: the Stanley-Reisner ring $R/I_\Lambda$ and the inverse system algebra $R/I_\Delta$. We give a…

Frame theory provides a robust method for recovering vectors in a Hilbert space from inner product data, though the associated decomposition formula can be computationally demanding. We relax the frame condition by studying sequences that…

We give closed form expressions for the numbers of multi-rooted plane trees with specified degrees of root vertices. This results in an infinite number of integer sequences some of which are known to have an alternative interpretation. We…

This is a survey article on trees, with a modest number of proofs to give a flavor of the way these topologies can be efficiently handled. Trees are defined in set-theorist fashion as partially ordered sets in which the elements below each…

This paper provides the generating series for the embedding of tree-like graphs of arbitrary number of vertices, accourding to their genus. It applies and extends the techniques of Chan, where it was used to give an alternate proof of the…

We show that exceptional sequences for hereditary algebras are characterized by the fact that the product of the corresponding reflections is the inverse Coxeter element in the Weyl group. We use this result to give a new combinatorial…

We explore a physical model of ordered sums of integers as trains of rods. The trains for a fixed, possibly infinite, set of rod lengths naturally correspond to nodes in a tree; relations among finite linear recursions encoded in the…