Related papers: A Family of Invariants of Rooted Forests

We study the enumerative geometry of stable maps to Calabi-Yau 5-folds $Z$ with a group action preserving the Calabi-Yau form. In the central case $Z=X \times \mathbb{C}^2$, where $X$ is a Calabi-Yau 3-fold with a group action scaling the…

In this paper, we develop a new method to produce explicit formulas for the number $f_{G}(n)$ of rooted spanning forests in the circulant graphs $ G=C_{n}(s_1,s_2,\ldots,s_k)$ and $ G=C_{2n}(s_1,s_2,\ldots,s_k,n).$ These formulas are…

We address the enumeration of p-valent planar maps equipped with a spanning forest, with a weight z per face and a weight u per connected component of the forest. Equivalently, we count p-valent maps equipped with a spanning tree, with a…

Let $T$ be an unrooted tree. The \emph{chromatic symmetric function} $X_T$, introduced by Stanley, is a sum of monomial symmetric functions corresponding to proper colorings of $T$. The \emph{subtree polynomial} $S_T$, first considered…

We consider unimodular random rooted trees (URTs) and invariant forests in Cayley graphs. We show that URTs of bounded degree are the same as the law of the component of the root in an invariant percolation on a regular tree. We use this to…

The classical invariant theory for the queer Lie superalgebra $\mathfrak{q}_n$ investigates its invariants in the supersymmetric algebra $$\mathcal{U}_{s,l}^{r,k}:=\mathrm{Sym}\left(V^{\oplus r}\oplus \Pi(V)^{\oplus k}\oplus V^{*\oplus…

Determining whether two graphs are isomorphic is an important and difficult problem in graph theory. One way to make progress towards this problem is by finding and studying graph invariants that distinguish large classes of graphs. Stanley…

We introduce a novel interpretable tree based algorithm for prediction in a regression setting. Our motivation is to estimate the unknown regression function from a functional decomposition perspective in which the functional components…

We investigate the possibility to separate the bisimulation-invariant fragment of P from that of NP, resp. PSPACE. We build on Otto's Theorem stating that the bisimulation-invariant queries in P are exactly those that are definable in the…

Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on…

Richard Stanley defined the chromatic symmetric function $X_G$ of a graph $G$ and asked whether there are non-isomorphic trees $T$ and $U$ with $X_T=X_U$. We study variants of the chromatic symmetric function for rooted graphs, where we…

Invariant theory is concerned with functions that do not change under the action of a given group. Here we communicate an approach based on tensor networks to represent polynomial local unitary invariants of quantum states. This graphical…

In this article we construct link invariants and 3-manifold invariants from the quantum group associated with Lie superalgebra $\mathfrak{sl}(2|1)$. This construction based on nilpotent irreducible finite dimensional representations of…

Phylogenetic invariants are certain polynomials in the joint probability distribution of a Markov model on a phylogenetic tree. Such polynomials are of theoretical interest in the field of algebraic statistics and they are also of practical…

We study the generating function of rooted and unrooted hyperforests in a general complete hypergraph with n vertices by using a novel Grassmann representation of their generating functions. We show that this new approach encodes the known…

To a definable subset of Z_p^n (or to a scheme of finite type over Z_p) one can associate a tree in a natural way. It is known that the corresponding Poincare series P(X) = \sum_i N_i X^i is rational, where N_i is the number of nodes of the…

We study the problem of constructing universal Steiner trees for undirected graphs. Given a graph $G$ and a root node $r$, we seek a single spanning tree $T$ of minimum {\em stretch}, where the stretch of $T$ is defined to be the maximum…

Let E be a ring spectrum for which the E-Adams spectral sequence converges. We define a variant of Mahowald's root invariant called the `filtered root invariant' which takes values in the E_1 term of the E-Adams spectral sequence. The main…

This paper is centered on covariant dynamics on unimodular random graphs and random networks, namely maps from the set of vertices to itself which are preserved by graph or network isomorphisms. Such dynamics are referred to as…

In phylogenetics, a central problem is to infer the evolutionary relationships between a set of species $X$; these relationships are often depicted via a phylogenetic tree -- a tree having its leaves univocally labeled by elements of $X$…