English
Related papers

Related papers: A Family of Invariants of Rooted Forests

200 papers

We study Thurston equivalence classes of quadratic post-critically finite branched coverings. For these maps, we introduce and study invariant spanning trees. We give a computational procedure for searching for invariant spanning trees.…

Dynamical Systems · Mathematics 2021-01-08 Anastasia Shepelevtseva , Vladlen Timorin

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…

Representation Theory · Mathematics 2019-12-19 Ryan Kinser

Multiparametric statistical model providing stable reconstruction of parameters by observations is considered. The only general method of this kind is the root model based on the representation of the probability density as a squared…

Quantum Physics · Physics 2007-05-23 Yu. I. Bogdanov

Following Anders and Archer, we say that an unordered rooted labeled forest avoids the pattern $\sigma\in\mathcal{S}_k$ if in each tree, each sequence of labels along the shortest path from the root to a vertex does not contain a…

Combinatorics · Mathematics 2022-11-01 Swapnil Garg , Alan Peng

In this paper we study the adjacency spectrum of families of finite rooted trees with regular branching properties. In particular, we show that in the case of constant branching, the eigenvalues are realized as the roots of a family of…

Representation Theory · Mathematics 2020-03-31 Daryl R. DeFord , Daniel N. Rockmore

We describe the multiplicative invariant algebras of the root lattices of all irreducible root systems under the action of the Weyl group. In each case, a finite system of fundamental invariants is determined and the class group of the…

Commutative Algebra · Mathematics 2014-09-02 Jessica Hamm

We study orbifold Gromov--Witten invariants of the $r$-th root stack $X_{D,r}$ with a pair of mid-ages when $r$ is sufficiently large. We prove that genus $g$ invariants with a pair of mid-ages $k_a/r$ and $1-k_a/r$ are polynomials in $k_a$…

Algebraic Geometry · Mathematics 2021-05-25 Fenglong You

We introduce a new matroid (graph) invariant, the arboricity polynomial. Given a matroid, the arboricity polynomial enumerates the number of covers of the ground set by disjoint independent sets. We establish the polynomiality of the…

Combinatorics · Mathematics 2025-05-09 Felix Breuer , Caroline J Klivans

A group $G$ is called root graded if it has a family of subgroups $G_\alpha$ indexed by roots from a root system $\Phi$ satisfying natural conditions similar to Chevalley groups over commutative unital rings. For any such group there is a…

Group Theory · Mathematics 2026-05-08 Egor Voronetsky

In this paper, we give a decomposition of triply rooted trees into three doubly rooted trees. This leads to a combinatorial interpretation of an identity conjectured by Lacasse in the study of the PAC-Bayesian machine learning theory, and…

Combinatorics · Mathematics 2013-01-01 William Y. C. Chen , Janet F. F. Peng , Harold R. L. Yang

We study the enumeration of spinal tree-child phylogenetic networks, a rigid family of tree-child networks in which all internal vertices lie on a single root--to--leaf path. We provide two complementary combinatorial frameworks. First, we…

Combinatorics · Mathematics 2026-05-12 Pau Vives , Anna de Mier , Gabriel Cardona , Joan Carles Pons

We give a method of generating strongly polynomial sequences of graphs, i.e., sequences $(H_{\mathbf{k}})$ indexed by a multivariate parameter $\mathbf{k}=(k_1,\ldots, k_h)$ such that, for each fixed graph $G$, there is a multivariate…

Combinatorics · Mathematics 2013-08-20 Delia Garijo , Andrew Goodall , Jaroslav Nesetril

We introduce new methods for phylogenetic tree quartet construction by using machine learning to optimize the power of phylogenetic invariants. Phylogenetic invariants are polynomials in the joint probabilities which vanish under a model of…

Populations and Evolution · Quantitative Biology 2007-05-23 Nicholas Eriksson , Yuan Yao

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…

Combinatorics · Mathematics 2013-05-21 Xueliang Li , Yiyang Li , Yongtang Shi

A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phylogenetics is to combine such trees into larger trees, called…

Artificial Intelligence · Computer Science 2014-01-16 Neil C. A. Moore , Patrick Prosser

$O(N)$ invariants are the observables of real tensor models. We use regular colored graphs to represent these invariants, the valence of the vertices of the graphs relates to the tensor rank. We enumerate $O(N)$ invariants as $d$-regular…

Mathematical Physics · Physics 2022-11-15 Remi C. Avohou , Joseph Ben Geloun , Nicolas Dub

We provide formulas for generating functions of many types of paths in various rooted tree structures. We compute the $k$th moment of the generating functions for various types of vertical paths. In two specific familes of trees we find…

Combinatorics · Mathematics 2018-10-03 Keith Copenhaver

For a graph G, the generating function of rooted forests, counted by the number of connected components, can be expressed in terms of the eigenvalues of the graph Laplacian. We generalize this result from graphs to cell complexes of…

Combinatorics · Mathematics 2016-11-21 Olivier Bernardi , Caroline J. Klivans

The classical invariant theory for the queer Lie superalgebra is an investigation of the $\mathrm{U}(\mathfrak{q}_n)$-invariant sub-superalgebra of the symmetric superalgebra $\mathrm{Sym}(V^{\oplus r}\oplus V^{*\oplus s})$ for…

Representation Theory · Mathematics 2022-09-05 Zhihua Chang , Yongjie Wang

Let $R$ be a real closed field. We consider basic semi-algebraic sets defined by $n$-variate equations/inequalities of $s$ symmetric polynomials and an equivariant family of polynomials, all of them of degree bounded by $2d < n$. Such a…

Symbolic Computation · Computer Science 2018-06-22 Cordian Riener , Mohab Safey El Din