Related papers: Metric trees of generalized roundness one
A genus one labeled circle tree is a tree with its vertices on a circle, such that together they can be embedded in a surface of genus one, but not of genus zero. We define an e-reduction process whereby a special type of subtree, called an…
Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…
We prove decidability of the boundedness problem for monadic least fixed-point recursion based on positive monadic second-order (MSO) formulae over trees. Given an MSO-formula phi(X,x) that is positive in X, it is decidable whether the…
Sorting is a foundational problem in computer science that is typically employed on sequences or total orders. More recently, a more general form of sorting on partially ordered sets (or posets), where some pairs of elements are…
In this paper we show that all infinite trees which have bounded coordination and whose surface is negligible with respect to the volume in the limit of large distances (so that they can be embedded in a finite-dimensional euclidean space)…
In some scientific fields, a scaling is able to modify the topology of an observed object. Our goal in the present work is to introduce a new formalism adapted to the mathematical representation of this kind of phenomenon. To this end, we…
One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…
This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size $n$ is proved to have a limiting theta distribution, both in a…
For a labelled tree on the vertex set $[n]:=\{1,2,..., n\}$, define the direction of each edge $ij$ to be $i\to j$ if $i<j$. The indegree sequence of $T$ can be considered as a partition $\lambda \vdash n-1$. The enumeration of trees with a…
For random matrices with tree-like structure there exists a recursive relation for the local Green functions whose solution permits to find directly many important quantities in the limit of infinite matrix dimensions. The purpose of this…
Motivated by applications to low-rank matrix completion, we give a combinatorial characterization of the independent sets in the algebraic matroid associated to the collection of $m\times n$ rank-2 matrices and $n\times n$ skew-symmetric…
We study a class of rooted trees with a substitution type structure. These trees are not necessarily regular, but exhibit a lot of symmetries. We consider nearest neighbor operators which reflect the symmetries of the trees. The spectrum of…
We consider two varieties of labeled rooted trees, and the probability that a vertex chosen from all vertices of all trees of a given size uniformly at random has a given rank. We prove that this probability converges to a limit as the tree…
The definition of $n$-width of a bounded subset $A$ in a normed linear space $X$ is based on the existence of $n$-dimensional subspaces. Although the concept of an $n$-dimensional subspace is not available for metric trees, in this paper,…
This work addresses the problem of computing measures of recognisable sets of infinite trees. An algorithm is provided to compute the probability measure of a tree language recognisable by a weak alternating automaton, or equivalently…
The enumeration degrees of sets of natural numbers can be identified with the degrees of difficulty of enumerating neighborhood bases of points in a universal second-countable $T_0$-space (e.g. the $\omega$-power of the Sierpi\'nski space).…
We present here a new and universal approach for the study of random and/or trees, unifying in one framework many different models, including some novel ones not yet understood in the literature. An and/or tree is a Boolean expression…
We introduce the notion of metric semilattice on the metric space and prove the criterion of $\R$-tree as connected geodesic metric space $X$ admitting the partial order, such that $X$ is semilinear metric semilattice. Also we state the…
The tree share structure proposed by Dockins et al. is an elegant model for tracking disjoint ownership in concurrent separation logic, but decision procedures for tree shares are hard to implement due to a lack of a systematic theoretical…
A normal subgroup of the (extended) mapping class group of a surface is said to be geometric if its automorphism group is the mapping class group. We prove that in the case of the Cantor tree surface, every normal subgroup is geometric. We…