Related papers: N-valid trees in wavelet theory on Vilenkin groups

We study three combinatorial models for the lower-triangular matrix with entries $t_{n,k} = \binom{n}{k} n^{n-k}$: two involving rooted trees on the vertex set $[n+1]$, and one involving partial functional digraphs on the vertex set $[n]$.…

An L-shaped embedding of a tree in a point set is a planar drawing of the tree where the vertices are mapped to distinct points and every edge is drawn as a sequence of two axis-aligned line segments. There has been considerable work on…

To any tree on $n$ vertices we associate an $n$-dimensional Lotka-Volterra system with $3n-2$ parameters and, for generic values of the parameters, prove it is superintegrable, i.e. it admits $n-1$ functionally independent integrals. We…

We show that given a collection $X=\{f_1$, \ldots , $f_m\}$ of pure mapping classes on a surface $S$, there is an explicit constant N, depending only on $X$, such that their Nth powers $\{f_1^N$, \ldots , $f_m^N\}$ generate the expected…

We study the scheme of formal arcs on a singular algebraic variety and its images under truncations. We prove a rationality result for the Poincare series of these images which is an analogue of the rationality of the Poincare series…

In this paper we define the $p$-adic framed braid group ${\mathcal F}_{\infty,n}$, arising as the inverse limit of the modular framed braids and we give topological generators for ${\mathcal F}_{\infty, n}$. We also give geometric…

Let $W_{k,n}^{i}(m)$ denote a matrix with rows and columns indexed by the $k$-subsets and $n$-subsets, respectively, of an $m$-element set. The row $S$, column $T$ entry of $W_{k,n}^{i}(m)$ is $1$ if $|S \cap T| = i$, and is $0$ otherwise.…

Billey et al. [arXiv:1507.04976] have recently discovered a surprisingly simple formula for the number $a_n(\sigma)$ of leaf-labelled rooted non-embedded binary trees (also known as phylogenetic trees) with $n\geq 1$ leaves, fixed (for the…

Let $\mathfrak{Var}_k^G$ denote the category of pairs $(X,\sigma)$, where $X$ is a variety over $k$ and $\sigma$ is a group action on $X$. We define the Grothendieck ring for varieties with group actions as the free abelian group of…

The free abelian group R(Q) on the set of indecomposable representations of a quiver Q, over a field K, has a ring structure where the multiplication is given by the tensor product. We show that if Q is a rooted tree (an oriented tree with…

We apply the theory of markov random fields on trees to derive a phase transition in the number of samples needed in order to reconstruct phylogenies. We consider the Cavender-Farris-Neyman model of evolution on trees, where all the inner…

The establishment of trust relationships to a computing platform relies on validation processes. Validation allows an external entity to build trust in the expected behaviour of the platform based on provided evidence of the platform's…

The study of prime divisibility plays a crucial role in number theory. The $p$-adic valuation of a number is the highest power of a prime, $p$, that divides that number. Using this valuation, we construct $p$-adic valuation trees to…

The monadic second-order theory of trees allows quantification over elements and over arbitrary subsets. We classify the class of trees with respect to the question: does a tree T have definable Skolem functions (by a monadic formula with…

We show that for a large class of Artin groups with Dynkin diagrams being a tree, the $K(\pi,1)$-conjecture holds. We also establish the $K(\pi,1)$-conjecture for another class of Artin groups whose Dynkin diagrams contain a cycle, which…

In this paper we complete the results of Sullivant and Sturmfels proving that many of the algebraic group-based models for Markov processes on trees are pseudo-toric. We also show in which cases these varieties are normal. This is done by…

Given a finite typed rooted tree $T$ with $n$ vertices, the {\em empirical subtree measure} is the uniform measure on the $n$ typed subtrees of $T$ formed by taking all descendants of a single vertex. We prove a large deviation principle in…

Elements of the Riordan group $\cal R$ over a field $\mathbb F$ of characteristic zero are infinite lower triangular matrices which are defined in terms of pairs of formal power series. We wish to bring to the forefront, as a tool in the…

Let $\mathcal{T}_n$ be the set of trees with $n$ vertices. Suppose that each tree in $\mathcal{T}_n$ is equally likely. We show that the number of different rooted trees of a tree equals $(\mu_r+o(1))n$ for almost every tree of…

P\'olya trees are rooted, unlabeled trees on $n$ vertices. This paper gives an efficient, new way to generate P\'olya trees. This allows comparing typical unlabeled and labeled tree statistics and comparing asymptotic theorems with…