Related papers: Trees on hyperbolic honeycombs
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…
Given a graph, we can form a spanning forest by first sorting the edges in some order, and then only keep edges incident to a vertex which is not incident to any previous edge. The resulting forest is dependent on the ordering of the edges,…
We describe ideal incompressible hydrodynamics on the hyperbolic plane which is an infinite surface of constant negative curvature. We derive equations of motion, general symmetries and conservation laws, and then consider turbulence with…
Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed…
Hyperbolicity is a property of a graph that may be viewed as being a "soft" version of a tree, and recent empirical and theoretical work has suggested that many graphs arising in Internet and related data applications have hyperbolic…
Tilings of the hyperbolic plane are of significant interest among many branches of mathematics, physics and computer science. Yet, their construction remains a non-trivial task. Current approaches primarily use tree-based recursive…
By analogy to the theory of harmonic fields on the complex plane, we build the theory of wave-like fields on the plane of double variable. We construct the hyperbolic analogues of point vortices, sources, vortice-sources and their…
We prove that any graph of multicurves satisfying certain natural properties is either hyperbolic, relatively hyperbolic, or thick. Further, this geometric characterization is determined by the set of subsurfaces that intersect every vertex…
We generalise the construction of infinite matroids from trees of matroids to allow the matroids at the nodes, as well as the field over which they are represented, to be infinite.
In this paper we examine the relationship between hyperconvex hulls and metric trees. After providing a linking construction for hyperconvex spaces, we show that the four-point property is inherited by the hyperconvex hull, which leads to…
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…
Abstractly, tropical hyperelliptic curves are metric graphs that admit a two-to-one harmonic morphism to a tree. They also appear as embedded tropical curves in the plane arising from triangulations of polygons with all interior lattice…
Parabolic (resp. hyperbolic) self-embeddings of trees are those which do not fix a non-empty finite subtree and preserve precisely one (resp. two) end(s). We prove that a locally finite tree having a parabolic self-embedding is mutually…
A hypertree, or $\mathbb{Q}$-acyclic complex, is a higher-dimensional analogue of a tree. We study random $2$-dimensional hypertrees according to the determinantal measure suggested by Lyons. We are especially interested in their…
Hyperbolism of a given curve with respect to a point and a line is an interesting construct, a special kind of geometric locus, not frequent in the literature. While networking between two different kinds of mathematical software, we…
Consider the d-dimensional lattice Z^d where each vertex is ``open'' or ``closed'' with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w…
The percolation transitions on hyperbolic lattices are investigated numerically using finite-size scaling methods. The existence of two distinct percolation thresholds is verified. At the lower threshold, an unbounded cluster appears and…
We generalize the notion of tight geodesics in the curve complex to tight trees. We then use tight trees to construct model geometries for certain surface bundles over graphs. This extends some aspects of the combinatorial model for doubly…
We look at periodic Jacobi matrices on trees. We provide upper and lower bounds on the gap of such operators analogous to the well known gap in the spectrum of the Laplacian on the upper half-plane with hyperbolic metric. We make some…
We look at tree amalgamations of locally finite quasi-transitive hyperbolic graphs and prove that the homeomorphism type of the hyperbolic boundary of such a tree amalgamation only depends on the homeomorphism types of the hyperbolic…