Related papers: The valuative tree

We interpret a valuation $v$ on a ring $R$ as a map $v: R \to M$ into a so called bipotent semiring $M$ (the usual max-plus setting), and then define a \textbf{supervaluation} $\phi$ as a suitable map into a supertropical semiring $U$ with…

We continue in this article the study of laminations dual to very small actions of a free group F on R-trees. We prove that this lamination determines completely the combinatorial structure of the R-tree (the so-called observers' topology).…

This paper is devoted to a systematic study of a class of binary trees encoding the structure of rational numbers both from arithmetic and dynamical point of view. The paper is divided into two parts. The first one is a critical review of…

The Graceful Tree Conjecture of Rosa from 1967 asserts that the vertices of each tree T of order n can be injectively labelled by using the numbers {1,2,...,n} in such a way that the absolute differences induced on the edges are pairwise…

We propose and study a multi-scale approach to vector quantization. We develop an algorithm, dubbed reconstruction trees, inspired by decision trees. Here the objective is parsimonious reconstruction of unsupervised data, rather than…

The first part of this paper ( arXiv:1607.02114 ) introduced splitting trees, those chronological trees admitting the self-similarity property where individuals give birth, at constant rate, to iid copies of themselves. It also established…

The algebra of $R$-valued functions on the set of chambers of a real hyperplane arrangement is called the Varchenko-Gelfand (VG) algebra. This algebra carries a natural filtration by the degree with respect to Heaviside functions, giving…

We show that several new classes of groups are measure strongly treeable. In particular, finitely generated groups admitting planar Cayley graphs, elementarily free groups, and the group of isometries of the hyperbolic plane and all its…

In this paper the Weyl tensor is used to define operators that act on the space of forms. These operators are shown to have interesting properties and are used to classify the Weyl tensor, the well known Petrov classification emerging as a…

Let $R$ be a two-dimensional regular local ring. In this paper, we prove that there is a bijection between the set of all valuations of $Quot(R)$ centered at $R$ and valuations of $k(x,y)$ centered at $k[x,y]_{(x,y)}$, where $k$ is the…

In this paper we prove relationships between two generalizations of commutative valuation theory for noncommutative central simple algebras: (1) Dubrovin valuation rings; and (2) the value functions called gauges introduced by Tignol and…

We introduce a class of random compact metric spaces L(\alpha) indexed by \alpha \in (1,2) and which we call stable looptrees. They are made of a collection of random loops glued together along a tree structure, and can be informally be…

We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…

Let G be a ribbon graph, i.e., a connected finite graph G together with a cyclic ordering of the edges around each vertex. By adapting a construction due to O. Bernardi, we associate to any pair (v,e) consisting of a vertex v and an edge e…

Let $G$ be a simple finite connected graph with vertex set $V(G) = \{v_1,v_2,\ldots,v_n\}$. Denote the degree of vertex $v_i$ by $d_i$ for all $1 \leq i \leq n$. The Randi\'c matrix of $G$, denoted by $R(G) = [r_{i,j}]$, is the $n \times n$…

A tree T is invertible if and only if T has a perfect matching. Godsil considers an invertible tree T and finds that the inverse of the adjacency matrix of T has entries in {0, 1, -1} and is the signed adjacency matrix of a graph which…

CVT and XOR are two binary operations together used to calculate the sum of two non-negative integers on using a recursive mechanism. In this present study the convergence behaviors of this recursive mechanism has been captured through a…

Let $G$ be a simple undirected $n$-vertex graph with the characteristic polynomial of its Laplacian matrix $L(G)$, $\det (\lambda I - L (G))=\sum_{k = 0}^n (-1)^k c_k \lambda^{n - k}$. It is well known that for trees the Laplacian…

We show quantifier elimination theorems for real closed valued fields with separated analytic structure and overconvergent analytic structure in their natural one-sorted languages and deduce that such structures are weakly o-minimal. We…

We prove that Keimel and Lawson's K-completion Kc of the simple valuation monad Vs defines a monad Kc o Vs on each K-category A. We also characterize the Eilenberg-Moore algebras of Kc o Vs as the weakly locally convex K-cones, and its…