Two new expansions for partial sums of Gauss' triangular and square numbers
series are given. As a consequence, we derive a family of inequalities for the
overpartition function $\bar{p}(n)$ and for the partition function $p_1(n)$
counting the partitions of $n$ with distinct odd parts. Some further
inequalities for variations of partition function are proposed as conjectures.
We prove a single sum formula for the linearization coefficients of the
Bessel polynomials. In two special cases we show that our formula reduces
indeed to Berg and Vignat's formulas in their proof of the positivity results
about these coefficients (Constructive Approximation, 27(2008), 15-32). As a
bonus we also obtain a generalization of an integral formula of Boros and Moll
(J. Comput. Appl. Math. 106 (1999), 361-368).
In 1997 Clarke et al. studied a $q$-analogue of Euler's difference table for
$n!$ using a key bijection $\Psi$ on symmetric groups. In this paper we extend
their results to the wreath product of a cyclic group with the symmetric group.
In particular we obtain a new mahonian statistic \emph{fmaf} on wreath
products. We also show that Foata and Han's two recent transformations on the
symmetric groups provide indeed a factorization of $\Psi$.
For a labeled tree on the vertex set $\set{1,2,...,n}$, define the local
direction of each edge $i-j$ as $i \to j$ if $i<j$. For a rooted tree there is
also a natural global direction of edges towards the root. The number of edges
pointing to a vertex is called its indegree. Thus the local (resp. global)
indegree sequence $\lambda = 1^{e_1}2^{e_2} ...$ of a tree on $\set{1,2,...,n}$
is a partition of $n-1$. We construct a bijection from (unrooted) trees to
rooted trees %which preserves the local indegree sequence.
We prove a continued fraction formula for the generating function of
permutations with respect to the quadruple statistic consisting of fixed point
number, weak excedance number, crossing number and nesting number. This enables
us to give a unified proof of Josuat-Verg\`es' recent $q$-analogues of two
identities due to Euler and Roselle. We also give a combinatorial proof of the
Josuat-Verg\`es formulas. Our approach is in the same vein as Foata and Han's
two proofs for another type of $q$-analogue of the Euler and Roselle
identities.
We generalize two bijections due to Garsia and Gessel to compute the
generating functions of the two vector statistics $(\des_G, \maj,\ell_G, \col)$
and $(\des_G, \ides_G, \maj, \imaj, \col, \icol)$ over the wreath product of a
symmetric group by a cyclic group. Here $\des_G$, $\ell_G$, $\maj$, $\col$,
$\ides_G$, $\imaj_G$, and $\icol$ denote the number of descents, length, major
index, color weight, inverse descents, inverse major index, and inverse color
weight, respectively.
We generalize two bijections due to Garsia and Gessel to compute the
generating functions of the two vector statistics $(\des_G, \maj,\ell_G, \col)$
and $(\des_G, \ides_G, \maj, \imaj, \col, \icol)$ over the wreath product of a
symmetric group by a cyclic group. Here $\des_G$, $\ell_G$, $\maj$, $\col$,
$\ides_G$, $\imaj_G$, and $\icol$ denote the number of descents, length, major
index, color weight, inverse descents, inverse major index, and inverse color
weight, respectively.
We give a new description of the flag major index, introduced by Adin and
Roichman, by using a major index defined by Reiner. This allows us to establish
a connection between an identity of Reiner and some more recent results due to
Chow and Gessel. Furthermore we generalize the main identity of Chow and Gessel
by computing the four-variate generating series of descents, major index,
length, and number of negative entries over Coxeter groups of type $B$ and $D$.
By using the Newton interpolation formula, we generalize the recent
identities on the Catalan triangle obtained by Miana and Romero as well as
those of Chen and Chu. We further study divisibility properties of sums of
products of binomial coefficients and an odd power of a natural number. For
example, we prove that for all positive integers $n_1, ..., n_m$,
$n_{m+1}=n_1$, and any nonnegative integer $r$, the expression
$$n_1^{-1}{n_1+n_{m}\choose n_1}^{-1} \sum_{k=1}^{n_1}k^{2r+1}\prod_{i=1}^{m}
{n_i+n_{i+1}\choose n_i+k}$$ is either an integer or a half-integer.