Related papers: The arithmetic of trees

Tree decompositions were developed by Robertson and Seymour. Since then algorithms have been developed to solve intractable problems efficiently for graphs of bounded treewidth. In this paper we extend tree decompositions to allow cycles to…

We explore the relationship between (non-planar) rooted trees and free trees, i.e. without root. We give in particular, for non-rooted trees, a substitute for the Lie bracket given by the antisymmetrization of the pre-Lie product.

Serre in "Trees" laid down the fundamentals of the theory of groups acting on simplicial trees. In particular, Bass-Serre theory makes it possible to extract information about the structure of a group from its action on a simplicial tree.…

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…

We study the asymptotic distribution of integers sharing the same rooted-tree structure that encodes their complete prime factorization tower. For each tree we derive an explicit density formula depending only on a pair $(m,k)$, the density…

Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed…

Existing ordinal trees and random forests typically use scores that are assigned to the ordered categories, which implies that a higher scale level is used. Versions of ordinal trees are proposed that take the scale level seriously and…

We survey some of the ideas behind the recent developments in additive number theory, combinatorics and ergodic theory leading to the proof of Hardy- Littlewood type estimates for the number of prime solutions to systems of linear equations…

We consider linear preferential attachment trees, and show that they can be regarded as random split trees in the sense of Devroye (1999), although with infinite potential branching. In particular, this applies to the random recursive tree…

This paper introduces a series of methods for traversing binary decision trees using arithmetic operations. We present a suite of binary tree traversal algorithms that leverage novel representation matrices to flatten the full binary tree…

With the algebraic trees, L\"ohr and Winter (2021) introduced a generalization of the notion of graph-theoretic trees to account for potentially uncountable structures. The tree structure is given by the map which assigns to each triple of…

We present a binary tree that describes the 2-adic valuation of a sequence of coefficients arising from the evaluation of a rational integral.

There are several common ways to encode a tree as a matrix, such as the adjacency matrix, the Laplacian matrix (that is, the infinitesimal generator of the natural random walk), and the matrix of pairwise distances between leaves. Such…

We introduce some natural families of distributions on rooted binary ranked plane trees with a view toward unifying ideas from various fields, including macroevolution, epidemiology, computational group theory, search algorithms and other…

We define an extension of parity from the integers to the rational numbers. Three parity classes are found -- even, odd and `none'. Using the 2-adic valuation, we partition the rationals into subgroups with a rich algebraic structure. The…

We introduce two new binary operations with combinatorial species; the arithmetic product and the modified arithmetic product. The arithmetic product gives combinatorial meaning to the product of Dirichlet series and to the Lambert series…

We study the action on the Bruhat-Tits tree of unit groups of maximal orders in certain quaternion algebras over $\mathbb{F}_q(T)$ and discuss applications to arithmetic geometry and group theory.

We apply the methods of algebraic reliability to the study of percolation on trees. To a complete $k$-ary tree $T_{k,n}$ of depth $n$ we assign a monomial ideal $I_{k,n}$ on $\sum_{i=1}^n k^i$ variables and $k^n$ minimal monomial…

The theory of Hubbard trees provides an effective classification of non-linear post-critically finite polynomial maps from \C to itself. This note will extend this classification to the case of maps from a finite union of copies of \C to…

The article describes the structural and algorithmic relations between Cartesian trees and Lyndon Trees. This leads to a uniform presentation of the Lyndon table of a word corresponding to the Next Nearest Smaller table of a sequence of…