29,708 research outputs found
On a generalized basic series and Rogers-Ramanujan type identities
In this paper, we give the generalization of MacMahon's type combinatorial identities. A generalized -series is interpreted as the generating function of two different combinatorial objects, viz., restricted -color partitions and weighted lattice paths which give entirely new Rogers–Ramanujan–MacMahon type combinatorial identities. This result yields an infinite class of 2-way combinatorial identities which further extends the work of Agarwal and Goyal. We also discuss the bijective proof of the main result. Forbye, eight particular cases are also discussed which give a combinatorial interpretation of eight entirely new Rogers–Ramanujan type identities
Factorization theorems for classical group characters, with applications to alternating sign matrices and plane partitions
We show that, for a certain class of partitions and an even number of
variables of which half are reciprocals of the other half, Schur polynomials
can be factorized into products of odd and even orthogonal characters. We also
obtain related factorizations involving sums of two Schur polynomials, and
certain odd-sized sets of variables. Our results generalize the factorization
identities proved by Ciucu and Krattenthaler (Advances in combinatorial
mathematics, 39-59, 2009) for partitions of rectangular shape. We observe that
if, in some of the results, the partitions are taken to have rectangular or
double-staircase shapes and all of the variables are set to 1, then
factorization identities for numbers of certain plane partitions, alternating
sign matrices and related combinatorial objects are obtained.Comment: 22 pages; v2: minor changes, published versio
A unifying combinatorial approach to refined little G\"ollnitz and Capparelli's companion identities
Berkovich-Uncu have recently proved a companion of the well-known
Capparelli's identities as well as refinements of Savage-Sills' new little
G\"ollnitz identities. Noticing the connection between their results and
Boulet's earlier four-parameter partition generating functions, we discover a
new class of partitions, called -strict partitions, to generalize their
results. By applying both horizontal and vertical dissections of Ferrers'
diagrams with appropriate labellings, we provide a unified combinatorial
treatment of their results and shed more lights on the intriguing conditions of
their companion to Capparelli's identities.Comment: This is the second revision submitted to JCTA in June, comments are
welcom
-Torsion Points In Finite Abelian Groups And Combinatorial Identities
The main aim of this article is to compute all the moments of the number of
-torsion elements in some type of nite abelian groups. The averages
involved in these moments are those de ned for the Cohen-Lenstra heuristics for
class groups and their adaptation for Tate-Shafarevich groups. In particular,
we prove that the heuristic model for Tate-Shafarevich groups is compatible
with the recent conjecture of Poonen and Rains about the moments of the orders
of -Selmer groups of elliptic curves. For our purpose, we are led to de ne
certain polynomials indexed by integer partitions and to study them in a
combinatorial way. Moreover, from our probabilistic model, we derive
combinatorial identities, some of which appearing to be new, the others being
related to the theory of symmetric functions. In some sense, our method
therefore gives for these identities a somehow natural algebraic context.Comment: 24 page
- …