Related papers: A Partition-Based Generating Function for Row-Conv…
This paper is devoted to the general problem of projection onto a polyhedral convex cone generated by a finite set of generators.This problem is reformulated into projection onto the polytope obtained by simple truncation of the original…
In this paper we determine a closed formula for the number of convex permutominoes of size n. We reach this goal by providing a recursive generation of all convex permutominoes of size n+1 from the objects of size n, according to the ECO…
Closed-form generating functions for counting one-face rooted hypermaps with a known number of darts by number of vertices and edges is found, using matrix integral expressions relating to the reduced density operator of a bipartite quantum…
The generating function that records the sizes of directed circuit partitions of a connected 2-in, 2-out digraph D can be determined from the interlacement graph of D with respect to a directed Euler circuit; the same is true of the…
By work of Bringmann, Ono, and Rhoades it is known that the generating function of the $M_2$-rank of partitions without repeated odd parts is the so-called holomorphic part of a certain harmonic Maass form. Here we improve the standing of…
Computations with Barvinok's short rational generating functions are traditionally being performed in the dual space, to avoid the combinatorial complexity of inclusion--exclusion formulas for the intersecting proper faces of cones. We…
A convex partition of a point set P in the plane is a planar partition of the convex hull of P with empty convex polygons or internal faces whose extreme points belong to P. In a convex partition, the union of the internal faces give the…
A partition on [n] has an m-nesting if there exists i_1 < i_2 < ... < i_m < j_m < j_{m-1} < ... < j_1, where i_l and j_l are in the same block for all 1 <= l <= m. We use generating trees to construct the class of partitions with no…
The counting of partitions according to their genus is revisited. The case of genus 0 -- non-crossing partitions -- is well known. Our approach relies on two pillars: first a functional equation between generating functions, originally…
It is a remarkable fact that for many statistics on finite sets of combinatorial objects, the roots of the corresponding generating function are each either a complex root of unity or zero. These and related polynomials have been studied…
Inspired by Gansner's elegant $k$-trace generating function for rectangular plane partitions, we introduce two novel operators, $\varphi_{z}$ and $\psi_{z}$, along with their combinatorial interpretations. Through these operators, we derive…
A recursive method is given for finding generating functions which enumerate rooted hypermaps by number of vertices, edges and faces for any given number of darts. It makes use of matrix-integral expressions arising from the study of…
In this article, we consider the weighted partition function $p_f(n)$ given by the generating series $\sum_{n=1}^{\infty} p_f(n)z^n = \prod_{n\in\mathbb{N}^{*}}(1-z^n)^{-f(n)}$, where we restrict the class of weight functions to strongly…
We prove combinatorially the explicit relation between genus filtrated $s$-loop means of the Gaussian matrix model and terms of the genus expansion of the Kontsevich--Penner matrix model (KPMM). The latter is the generating function for…
We describe a class of fixed polyominoes called $k$-omino towers that are created by stacking rectangular blocks of size $k\times 1$ on a convex base composed of these same $k$-omino blocks. By applying a partition to the set of $k$-omino…
This is the first of two articles devoted to a comprehensive exposition of the generating-function method for computing fusion rules in affine Lie algebras. The present paper is entirely devoted to the study of the tensor-product…
We derive explicit rational generating functions for weighted tilings of $2k\times n$ rectangles by straight $k\times 1$ tiles. Our approach combines a decomposition by fault lines with a Hadamard-product framework. Tools from algebraic…
Invariant theory provides more efficient tools, such as Molien generating functions and integrity bases, than basic group theory, that relies on projector techniques for the construction of symmetry--adapted polynomials in the symmetry…
Given a finite set of vectors spanning a lattice and lying in a halfspace of a real vector space, to each vector $a$ in this vector space one can associate a polytope consisting of nonnegative linear combinations of the vectors in the set…
In this work we define a unified generating functions for 9 different kinds of set partitions including cyclically ordered set partitions. Such generating function depends on 4 parameters. We consider property of this function and provide…