Related papers: A weighted cellular matrix-tree theorem, with appl…
The Exponential Formula allows one to enumerate any class of combinatorial objects built by choosing a set of connected components and placing a structure on each connected component which depends only on its size. There are multiple…
We discuss the geometry of trees endowed with a causal structure using the conventional framework of equilibrium statistical mechanics. We show how this ensemble is related to popular growing network models. In particular we demonstrate…
We consider the lower-triangular matrix of generating polynomials that enumerate $k$-component forests of rooted trees on the vertex set $[n]$ according to the number of improper edges (generalizations of the Ramanujan polynomials). We show…
We prove universal (case-free) formulas for the weighted enumeration of factorizations of Coxeter elements into products of reflections valid in any well-generated reflection group $W$, in terms of the spectrum of an associated operator,…
Mobiles are a particular class of decorated plane trees which serve as codings for planar maps. Here we address the question of enumerating mobiles in their most general flavor, in correspondence with planar Eulerian (i.e., bicolored) maps.…
Double Hurwitz numbers enumerating weighted $n$-sheeted branched coverings of the Riemann sphere or, equivalently, weighted paths in the Cayley graph of $S_n$ generated by transpositions are determined by an associated weight generating…
There is a nice combinatorial formula of P. Beelen and M. Datta for the $r$-th generalized Hamming weight of an affine cartesian code. Using this combinatorial formula we give an easy to evaluate formula to compute the $r$-th generalized…
We compute the complexity of two infinite families of finite graphs: the Sierpi\'{n}ski graphs, which are finite approximations of the well-known Sierpi\'nsky gasket, and the Schreier graphs of the Hanoi Towers group $H^{(3)}$ acting on the…
Motivated by the weighted Hurwitz product on sequences in an algebra, we produce a family of monoidal structures on the category of Joyal species. We suggest a family of tensor products for charades. We begin by seeing weighted derivational…
Following Poupard's study of strictly ordered binary trees with respect to two parameters, namely, "end of minimal chain" and "parent of maximum leaf" a true Tree Calculus is being developed to solve a partial difference equation system and…
We give a new structural development of harmonic polynomials on Hamming space, and harmonic weight enumerators of binary linear codes, that parallels one approach to harmonic polynomials on Euclidean space and weighted theta functions of…
We build on recent work of Yeats, Courtiel, and others involving connected chord diagrams. We first derive from a Hopf-algebraic foundation a class of tree-like functional equations and prove that they are solved by weighted generating…
The paper introduces two new aggregation functions to encode structural knowledge from tree-structured data. They leverage the Canonical and Tensor-Train decompositions to yield expressive context aggregation while limiting the number of…
We introduce and investigate a family of tau-functions of the 2D Toda hierarchy, which is a natural generalization of the hypergeometric family associated with Hurwitz numbers. For this family we prove a skew Schur function expansion…
We present a purely combinatorial solution of the problem of enumerating planar bicubic maps with hard particles. This is done by use of a bijection with a particular class of blossom trees with particles, obtained by an appropriate cutting…
Topologically constrained genome-like polymers often double-fold into tree-like configurations, which can be modelled on the level of folded (ring) polymers or on the level of the underlying random trees. For both descriptions, we have…
The most popular algorithms for generation of minimal spanning tree are Kruskal and Prim algorithm. Many algorithms have been proposed for generation of all spanning tree. This paper deals with generation of all possible spanning trees in…
The Loop Vertex Expansion (LVE) is a quantum field theory (QFT) method which explicitly computes the Borel sum of Feynman perturbation series. This LVE relies in a crucial way on symmetric tree weights which define a measure on the set of…
We propose an explicit construction of a weighted generalised Grassmannian. For a weighted Grassmannian (i.e., for series A) we obtain an effective parametrisation of possible $\mathbb{Z}$-gradings on Pl\"{u}cker coordinates, and provide…
We introduce weighted cycles on weaves of general Dynkin types and define a skew-symmetrizable intersection pairing between weighted cycles. We prove that weighted cycles on a weave form a Laurent polynomial algebra and construct a…