scholarly journals Generating Function for $K$-Restricted Jagged Partitions

10.37236/1909 ◽  
2005 ◽  
Vol 12 (1) ◽  
Author(s):  
J.-F. Fortin ◽  
P. Jacob ◽  
P. Mathieu

We present a natural extension of Andrews' multiple sums counting partitions of the form $(\lambda_1,\cdots,\lambda_m)$ with $\lambda_i\geq \lambda_{i+k-1}+2$. The multiple sum that we construct is the generating function for the so-called $K$-restricted jagged partitions. A jagged partition is a sequence of non-negative integers $(n_1,n_2,\cdots , n_m)$ with $n_m\geq 1$ subject to the weakly decreasing conditions $n_i\geq n_{i+1}-1$ and $n_i\geq n_{i+2}$. The $K$-restriction refers to the following additional conditions: $n_i \geq n_{i+K-1} +1$ or $n_i = n_{i+1}-1 = n_{i+K-2}+1= n_{i+K-1}$. The corresponding generalization of the Rogers-Ramunjan identities is displayed, together with a novel combinatorial interpretation.

10.37236/564 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Toufik Mansour ◽  
Matthias Schork ◽  
Mark Shattuck

A new family of generalized Stirling and Bell numbers is introduced by considering powers $(VU)^n$ of the noncommuting variables $U,V$ satisfying $UV=VU+hV^s$. The case $s=0$ (and $h=1$) corresponds to the conventional Stirling numbers of second kind and Bell numbers. For these generalized Stirling numbers, the recursion relation is given and explicit expressions are derived. Furthermore, they are shown to be connection coefficients and a combinatorial interpretation in terms of statistics is given. It is also shown that these Stirling numbers can be interpreted as $s$-rook numbers introduced by Goldman and Haglund. For the associated generalized Bell numbers, the recursion relation as well as a closed form for the exponential generating function is derived. Furthermore, an analogue of Dobinski's formula is given for these Bell numbers.


2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Paul Levande

International audience We examine the $q=1$ and $t=0$ special cases of the parking functions conjecture. The parking functions conjecture states that the Hilbert series for the space of diagonal harmonics is equal to the bivariate generating function of $area$ and $dinv$ over the set of parking functions. Haglund recently proved that the Hilbert series for the space of diagonal harmonics is equal to a bivariate generating function over the set of Tesler matrices–upper-triangular matrices with every hook sum equal to one. We give a combinatorial interpretation of the Haglund generating function at $q=1$ and prove the corresponding case of the parking functions conjecture (first proven by Garsia and Haiman). We also discuss a possible proof of the $t = 0$ case consistent with this combinatorial interpretation. We conclude by briefly discussing possible refinements of the parking functions conjecture arising from this research and point of view. $\textbf{Note added in proof}$: We have since found such a proof of the $t = 0$ case and conjectured more detailed refinements. This research will most likely be presented in full in a forthcoming article. On examine les cas spéciaux $q=1$ et $t=0$ de la conjecture des fonctions de stationnement. Cette conjecture déclare que la série de Hilbert pour l'espace des harmoniques diagonaux est égale à la fonction génératrice bivariée (paramètres $area$ et $dinv$) sur l'ensemble des fonctions de stationnement. Haglund a prouvé récemment que la série de Hilbert pour l'espace des harmoniques diagonaux est égale à une fonction génératrice bivariée sur l'ensemble des matrices de Tesler triangulaires supérieures dont la somme de chaque équerre vaut un. On donne une interprétation combinatoire de la fonction génératrice de Haglund pour $q=1$ et on prouve le cas correspondant de la conjecture dans le cas des fonctions de stationnement (prouvé d'abord par Garsia et Haiman). On discute aussi d'une preuve possible du cas $t=0$, cohérente avec cette interprétation combinatoire. On conclut en discutant brièvement les raffinements possibles de la conjecture des fonctions de stationnement de ce point de vue. $\textbf{Note ajoutée sur épreuve}$: j'ai trouvé depuis cet article une preuve du cas $t=0$ et conjecturé des raffinements possibles. Ces résultats seront probablement présentés dans un article ultérieur.


2016 ◽  
Vol 12 (03) ◽  
pp. 841-852 ◽  
Author(s):  
Erin Y. Y. Shen

Recently, Andrews introduced the partition function [Formula: see text] as the number of overpartitions of [Formula: see text] in which no part is divisible by [Formula: see text] and only parts [Formula: see text] may be overlined. He proved that [Formula: see text] and [Formula: see text] are divisible by [Formula: see text]. Let [Formula: see text] be the number of overpartitions of [Formula: see text] into parts not divisible by [Formula: see text]. In this paper, we call the overpartitions enumerated by the function [Formula: see text] [Formula: see text]-regular overpartitions. For [Formula: see text] and [Formula: see text], we obtain some explicit results on the generating function dissections. We also derive some congruences for [Formula: see text] modulo [Formula: see text], [Formula: see text] and [Formula: see text] which imply the congruences for [Formula: see text] proved by Andrews. By introducing a rank of vector partitions, we give a combinatorial interpretation of the congruences of Andrews for [Formula: see text] and [Formula: see text].


2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Jair Taylor

International audience We develop a method for counting words subject to various restrictions by finding a combinatorial interpretation for a product of formal sums of Laguerre polynomials. We use this method to find the generating function for $k$-ary words avoiding any vincular pattern that has only ones. We also give generating functions for $k$-ary words cyclically avoiding vincular patterns with only ones whose runs of ones between dashes are all of equal length, as well as the analogous results for compositions. Nous développons une méthode pour compter des mots satisfaisants certaines restrictions en établissant une interprétation combinatoire utile d’un produit de sommes formelles de polynômes de Laguerre. Nous utilisons cette méthode pour trouver la série génératrice pour les mots $k$-aires évitant les motifs vinculars consistant uniquement de uns. Nous présentons en suite les séries génératrices pour les mots $k$-aires évitant de façon cyclique les motifs vinculars consistant uniquement de uns et dont chaque série de uns entre deux tirets est de la même longueur. Nous présentons aussi les résultats analogues pour les compositions.


10.37236/3500 ◽  
2014 ◽  
Vol 21 (2) ◽  
Author(s):  
Jair Taylor

We develop a method for counting words subject to various restrictions by finding a combinatorial interpretation for a product of weighted sums of Laguerre polynomials with parameter $\alpha = -1$.  We describe how such a series can be computed by finding an appropriate ordinary generating function and applying a certain transformation. We use this technique to find the generating function for the number of $k$-ary words avoiding any vincular pattern that has only ones, as well as words cyclically avoiding vincular patterns with only ones whose runs of ones between dashes are all of equal length.


10.37236/1305 ◽  
1997 ◽  
Vol 4 (1) ◽  
Author(s):  
Gilles Schaeffer

Abstract: We give a bijection between Eulerian planar maps with prescribed vertex degrees, and some plane trees that we call balanced Eulerian trees. To enumerate the latter, we introduce conjugation classes of planted plane trees. In particular, the result answers a question of Bender and Canfield and allows uniform random generation of Eulerian planar maps with restricted vertex degrees. Using a well known correspondence between 4-regular planar maps with n vertices and planar maps with n edges we obtain an algorithm to generate uniformly such maps with complexity O(n). Our bijection is also refined to give a combinatorial interpretation of a parameterization of Arquès of the generating function of planar maps with respect to vertices and faces.


10.37236/451 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Paul Levande

We show how the generating function for signed Stirling numbers of the first kind can be proved using the involution principle and a natural combinatorial interpretation based on cycle-colored permuations.


10.37236/509 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Matthieu Josuat-Vergès

We consider a partially asymmetric exclusion process (PASEP) on a finite number of sites with open and directed boundary conditions. Its partition function was calculated by Blythe, Evans, Colaiori, and Essler. It is known to be a generating function of permutation tableaux by the combinatorial interpretation of Corteel and Williams. We prove bijectively two new combinatorial interpretations. The first one is in terms of weighted Motzkin paths called Laguerre histories and is obtained by refining a bijection of Foata and Zeilberger. Secondly we show that this partition function is the generating function of permutations with respect to right-to-left minima, right-to-left maxima, ascents, and 31-2 patterns, by refining a bijection of Françon and Viennot. Then we give a new formula for the partition function which generalizes the one of Blythe & al. It is proved in two combinatorial ways. The first proof is an enumeration of lattice paths which are known to be a solution of the Matrix Ansatz of Derrida & al. The second proof relies on a previous enumeration of rook placements, which appear in the combinatorial interpretation of a related normal ordering problem. We also obtain a closed formula for the moments of Al-Salam-Chihara polynomials.


1966 ◽  
Vol 3 (1) ◽  
pp. 171-178 ◽  
Author(s):  
D. Brook

Suppose that we have a non-negative, real valued random variable x, whose distribution is governed by some unknown moment generating function M(t). Suppose further that we are given certain moments of x, then the question to be discussed in this paper is : can we find a sharp upper bounding function for the m.g.f.? It will be shown that this is usually possible both in the single variate case and in its natural extension to the multivariate case.


10.37236/4814 ◽  
2015 ◽  
Vol 22 (3) ◽  
Author(s):  
J. Fernando Barbero G. ◽  
Jesús Salas ◽  
Eduardo J.S. Villaseñor

We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests. We prove that the number of generalized Stirling permutations with a fixed number of ascents is given by a natural three-parameter generalization of the well-known Eulerian numbers. We give the generating function for this new class of numbers and, in the simplest cases, we find closed formulas for them and the corresponding row polynomials. By using a non-trivial involution our generalized Eulerian numbers can be mapped onto a family of generalized Ward numbers, forming a Riordan inverse pair, for which we also provide a combinatorial interpretation.


Sign in / Sign up

Export Citation Format

Share Document