Related papers: Lipschitz equivalence of self-similar sets and hyp…

We consider the counting problem of the number of \textit{leaf-labeled increasing trees}, where internal nodes may have an arbitrary number of descendants. The set of all such trees is a discrete representation of the genealogies obtained…

We show various upper bounds for the order of a digraph (or a mixed graph) whose Hermitian adjacency matrix has an eigenspace of prescribed codimension. In particular, this generalizes the so-called absolute bound for (simple) graphs first…

We determine when two almost automorphisms of a regular tree are conjugate. This is done by combining the classification of conjugacy classes in the automorphism group of a level-homogeneous tree by Gawron, Nekrashevych and Sushchansky and…

We prove the sufficiency of the Linear Superposition Principle for linear trees, which characterizes the spectra achievable by a real symmetric matrix whose underlying graph is a linear tree. The necessity was previously proven in 2014.…

Let ${\cal M}_{t,v,r}(n,m)$, $2\leq m<n$, be the collection of self-affine carpets with expanding matrix $\diag(n,m)$ which are totally disconnected, possessing vacant rows and with uniform horizontal fibers. In this paper, we introduce a…

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…

In this paper, we study the multiplicity of the Laplacian eigenvalues of trees. It is known that for trees, integer Laplacian eigenvalues larger than $1$ are simple and also the multiplicity of Laplacian eigenvalue $1$ has been well studied…

We prove that, under a mild assumption, any metrizable compactification of a one-ended proper geodesic metric space is connected. As a consequence, we deduce that the boundary, introduced by Durham--Hagen--Sisto, of a one-ended…

The space of metric measure spaces (complete separable metric spaces with a probability measure) is becoming more and more important as state space for stochastic processes. Of particular interest is the subspace of (continuum) metric…

We define a notion of substitution on colored binary trees that we call substreetution. We show that a fixed point by a substreetution may be (or not) almost periodic, thus the closure of the orbit under $\mathbb{F}_2^+$-action may (or not)…

We define metrics in space that are natural counterparts of the hyperbolic metric in plane domains, using the characterization of the hyperbolic metric due to Beardon and Pommerenke. We obtain inequalities for these metrics under…

One can describe isomorphism of two compact hyperbolic Riemann surfaces of the same genus by a measure-theoretic property: a chosen isomorphism of their fundamental groups corresponds to a homeomorphism on the boundary of the Poincar\'e…

This paper is devoted to hyperbolic systems of balance laws with non local source terms. The existence, uniqueness and Lipschitz dependence proved here comprise previous results in the literature and can be applied to physical models, such…

We study the Lipschitz structures on the geodesic compactification of a regular tree, that are preserved by the automorphism group. They are shown to be similar to the compactifications introduced by William Floyd, and a complete…

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…

We prove the existence of an upper bound on the asymptotic dimension of tree amalgamations of locally finite quasi-transitive connected graphs. This generalises a result of Dranishnikov for free products with amalgamation and a result of…

We prove that for every finitely generated hyperbolic group $G$, the action of $G$ on its Gromov boundary induces a hyperfinite equivalence relation.

Gromov's isoperimetric gap conjecture for Hadamard spaces states that cycles in dimensions greater than or equal to the asymptotic rank admit linear isoperimetric filling inequalities, as opposed to the inequalities of Euclidean type in…

Addressing a question of Zaremsky, we give conditions on a finite simplicial graph which guarantee that the associated matching arc complex is connected and hyperbolic.

Hyperbolic spaces have recently gained momentum in the context of machine learning due to their high capacity and tree-likeliness properties. However, the representational power of hyperbolic geometry is not yet on par with Euclidean…