Related papers: Trees on hyperbolic honeycombs
The string vertices of closed string field theory are subsets of the moduli spaces of punctured Riemann surfaces that satisfy a geometric version of the Batalin-Vilkovisky master equation. We present a homological proof of existence of…
We obtain the maximum sum-connectivity indices of graphs in the set of trees and in the set of unicyclic graphs respectively with given number of vertices and maximum degree, and determine the corresponding extremal graphs. Additionally, we…
Flexible mechanical metamaterials possess repeating structural motifs that imbue them with novel, exciting properties including programmability, anomalous elastic moduli and nonlinear and robust response. We address such structures via…
We provide examples of towers of covers of cusped hyperbolic 3-manifolds whose exponential homological torsion growth is explicitly computed in terms of volume growth. These examples arise from abelian covers of alternating links in the…
The study of random graphs has become very popular for real-life network modeling such as social networks or financial networks. Inhomogeneous long-range percolation (or scale-free percolation) on the lattice $\mathbb Z^d$, $d\ge1$, is a…
The problem of enumerating spanning trees on graphs and lattices is considered. We obtain bounds on the number of spanning trees $N_{ST}$ and establish inequalities relating the numbers of spanning trees of different graphs or lattices. A…
We introduce a new approach to the geometric Bombieri--Lang conjecture for hyperbolic varieties in characteristic 0. The main idea is to construct an entire curve on a special fiber of a variety over a complex function field from an…
We combine conditions found in [Wh] with results from [MPR] to show that quasi-isometries between uniformly discrete bounded geometry spaces that satisfy linear isoperimetric inequalities are within bounded distance to bilipschitz…
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…
We study bond percolation for a family of infinite hyperbolic graphs. We relate percolation to the appearance of homology in finite versions of these graphs. As a consequence, we derive an upper bound on the critical probabilities of the…
Recent progress towards unraveling the hidden geometric organization of real multiplexes revealed significant correlations across the hyperbolic node coordinates in different network layers, which facilitated applications like trans-layer…
A strengthened version of Harborth's well-known conjecture -- known as Kleber's conjecture -- states that every planar graph admits a planar straight-line drawing where every edge has integer length and each vertex is restricted to the…
This paper studies equable parallelograms whose vertices lie on the Eisenstein lattice. Using Rosenberger's Theorem on generalised Markov equations, we show that the set of these parallelograms forms naturally an infinite tree, all of whose…
In queuing theory, it is usual to have some models with a "reset" of the queue. In terms of lattice paths, it is like having the possibility of jumping from any altitude to zero. These objects have the interesting feature that they do not…
In this paper we study the theories of the infinite-branching tree and the $r$-regular tree, and show that both of them are pseudofinite. Moreover, we show that they can be realized by infinite ultraproducts of polynomial exact classes of…
For hyperbolic surfaces with geodesic boundary, we study the orthosystole, i.e. the length of a shortest essential arc from the boundary to the boundary. We recover and extend work by Bavard completely characterizing the surfaces maximizing…
We present an explicit connected spanning structure that appears in a random graph just above the connectivity threshold with high probability.
In this short note we discuss recent results on hook length formulas of trees unifying some earlier results, and explain hook length formulas naturally associated to families of increasingly labelled trees.
We consider matrices on infinite trees which are universal covers of Jacobi matrices on finite graphs. We are interested in the question of the existence of sequences of finite covers whose normalized eigenvalue counting measures converge…
We study periodic infinite billiards in the plane. We show that for rational models, some particular obstacles can be added periodically, so that the billiard flow in the resulting table is recurrent in almost every direction.