Related papers: Linked partition ideals, directed graphs and $q$-m…
An elimination tree for a connected graph $G$ is a rooted tree on the vertices of $G$ obtained by choosing a root $x$ and recursing on the connected components of $G-x$ to produce the subtrees of $x$. Elimination trees appear in many guises…
We consider the graphs whose edges are marked by the integers (weights) from $0$ to $q-1$ (zero corresponds to no-edge). Such graph is called additive if its vertices can be marked in such a way that the weight of every edge is equal to the…
In this paper, we investigate the problem of generating the spanning trees of a graph $G$ up to the automorphisms or "symmetries" of $G$. After introducing and surveying this problem for general input graphs, we present algorithms that…
Following the method of combinatorial telescoping for alternating sums given by Chen, Hou and Mu, we present a combinatorial telescoping approach to partition identities on sums of positive terms. By giving a classification of the…
There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…
We investigate the concept of $q$-replicated arguments in symmetric functions with its connection to spectral functions of hyperbolic geometry. This construction suffices for vector generation functions in the form of $q$-series, and string…
The Rogers-Ramanujan identities and various analogous identities (Gordon, Andrews-Bressoud, Capparelli, etc.) form a family of very deep identities concerned with integer partitions. These identities (written in generating function form)…
We give factorizations for weighted spanning tree enumerators of Cartesian products of complete graphs, keeping track of fine weights related to degree sequences and edge directions. Our methods combine Kirchhoff's Matrix-Tree Theorem with…
By considering a limiting form of the q-Dixon_4\phi_3 summation, we prove a weighted partition theorem involving odd parts differing by >= 4. A two parameter refinement of this theorem is then deduced from a quartic reformulation of…
We define the concept of an affinized projective variety and show how one can, in principle, obtain q-identities by different ways of computing the Hilbert series of such a variety. We carry out this program for projective varieties…
We investigate a simple generative model for network formation. The model is designed to describe the growth of networks of kinship, trading, corporate alliances, or autocatalytic chemical reactions, where feedback is an essential element…
We study the Andrews-Gordon-Bressoud (AGB) generalisations of the Rogers-Ramanujan q-series identities in the context of cylindric partitions. We recall the definition of r-cylindric partitions, and provide a simple proof of Borodin's…
We study a generating function for the sum over fatgraphs with specified valences of vertices and faces, inversely weighted by the order of their symmetry group. A compact expression is found for general (i.e. non necessarily connected)…
Dedicated to George E. Andrews on the occasion of his 70th birthday. Submitted to a special issue for this occasion. We use Andrews' notion of a `signed partition' (i.e. partition where some parts are allowed to be negative) to interpret…
Motivated by earlier work of P.~A.~MacMahon and recent contributions of T.~Amdeberhan, G.~E.~Andrews, K.~Ono, A.~Singh, and R.~Tauraso on higher-order partition enumerants, we study a class of $q$-series arising from nested divisor…
We study certain algebras of theta-like functions on partitions, for which the corresponding generating functions give rise to theta functions, quasi-Jacobi forms, Appell-Lerch sums, and false theta functions.
Using methods from Analytic Combinatorics, we study the families of perfect matchings, partitions, chord diagrams, and hyperchord diagrams on a disk with a prescribed number of crossings. For each family, we express the generating function…
The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…
In this paper we consider how the following three objects are related: (i) the dual polar graphs; (ii) the quantum algebra U_q(sl_2); (iii) the Leonard systems of dual q-Krawtchouk type. For convenience we first describe how (ii) and (iii)…
Using the theoretical basis developed by Yao and Zeilberger, we consider certain graph families whose structure results in a rational generating function for sequences related to spanning tree enumeration. Said families are Powers of Cycles…