Related papers: Tree-like is not a transitive relation on paths

We present a construction, called the limit of a tree system of spaces (or, less formally, a tree of spaces). The construction is designed to produce compact metric spaces that resemble fractals, out of more regular spaces, such as closed…

Bojanczyk and Pilipczuk showed in their celebrated article "Definability equals recognizability for graphs of bounded treewidth" (LICS 2016) that monadic second-order logic can define tree-decompositions in graphs of bounded treewidth. This…

The notions of $p$-convexity and $q$-concavity are mostly known because of their importance as a tool in the study of isomorphic properties of Banach lattices, but they also play a role in several results involving linear maps between…

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…

This article investigates combinatorial properties of non-ambiguous trees. These objects we define may be seen either as binary trees drawn on a grid with some constraints, or as a subset of the tree-like tableaux previously defined by…

Let $Q$ be a tree-type quiver, $\mathbf{k} Q$ its path algebra, and $\lambda$ a nonzero element in the field $\mathbf{k}$. We construct irreducible morphisms in the Auslander-Reiten quiver of the transjective component of the bounded…

Tree-like tableaux are objects in bijection with alternative or permutation tableaux. They have been the subject of a fruitful combinatorial study for the past few years. In the present work, we define and study a new subclass of tree-like…

We establish sufficient conditions for the existence of globally Lipschitz transport maps between probability measures and their log-Lipschitz perturbations, with dimension-free bounds. Our results include Gaussian measures on Euclidean…

Arboreal categories, introduced by Abramsky and Reggio, axiomatise categories with tree-shaped objects. These categories provide a categorical language for formalising behavioural notions such as simulation, bisimulation, and…

For a harmonic function on a tree with random walk whose transition probabilities are bounded between two constants in (0,1/2), it is known that the radial and stochastic properties of convergence, boundedness and finiteness of energy are…

Trace theorems are proved for non-isotropic Sobolev and $L^p$-Lipschitz spaces defined by vector fields satisfying H\"ormander's bracket condition of order 2. It is shown that the loss of regularity by traces is the same as in the classical…

We consider questions related to the existence of spanning trees in graphs with the property that after the removal of any path in the tree the graph remains connected. We show that, for planar graphs, the existence of trees with this…

We study the bilipschitz equivalence type of tree-graded spaces, showing that asymptotic cones of relatively hyperbolic groups (resp. asymptotic cones of groups containing a cut-point) only depend on the bilipschitz equivalence types of the…

The study of Lipschitz equivalence of fractals is a very active topic in recent years. Most of the studies in literature concern totally disconnected fractals. In this paper, using finite state automata, we construct a bi-Lipschitz map…

We study the properties of random walks on complex trees. We observe that the absence of loops reflects in physical observables showing large differences with respect to their looped counterparts. First, both the vertex discovery rate and…

This paper studies the entropy of tree-shifts of finite type with and without boundary conditions. We demonstrate that computing the entropy of a tree-shift of finite type is equivalent to solving a system of nonlinear recurrence equations.…

The subtyping rules for intersection types traditionally employ a transitivity rule (Barendregt et al. 1983), which means that subtyping does not satisfy the subformula property, making it more difficult to use in filter models for compiler…

We study the leaf-to-leaf distances on full and complete m-ary graphs using a recursive approach. In our formulation, leaves are ordered along a line. We find explicit analytical formulae for the sum of all paths for arbitrary leaf-to-leaf…

The theory of complex trees is introduced as a new approach to study a broad class of self-similar sets. Systems of equations encoded by complex trees tip-to-tip equivalence relations are used to obtain one-parameter families of connected…

We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…