Rank and Conjugation for the Frobenius Representation of an Overpartition

We discuss conjugation and Dyson’s rank for overpartitions from the perspective of the Frobenius representation. More specifically, we translate the classical definition of Dyson’s rank to the Frobenius representation of an overpartition and define a new kind of conjugation in terms of this representation. We then use q-series identities to study overpartitions that are self-conjugate with respect to this conjugation. Received June 28, 2004     

Partitions and overpartitions with attached parts

We show how to interpret a certain q-series as a generating function for overpartitions with attached parts. A number of families of partition theorems follow as corollaries. Received: 12 April 2006     

An extension to overpartitions of the Rogers-Ramanujan identities for even moduli

We study a class of well-poised basic hypergeometric series , interpreting these series as generating functions for overpartitions defined by multiplicity conditions on the number of parts. We also show how to interpret the as generating functions for overpartitions whose successive ranks are bounded, for overpartitions that are invariant under a certain class of conjugations, and for special restricted lattice paths. We highlight the cases (a,q)→(1/q,q), (1/q,q²), and (0,q), where some of the functions become infinite products. The latter case corresponds to Bressoud's family of Rogers-Ramanujan identities for even moduli.     

Pairing conjugate partitions by residue classes

We study integer partitions in which the parts fulfill the same congruence relations with the parts of their conjugates, called conjugate-congruent partitions. The results obtained include uniqueness criteria, weight lower-bounds and enumerating generating functions.     

Ramsey partitions of integers and pair divisions

Ifk ₁ andk ₂ are positive integers, the partitionP = (₁,₂,..., _n ) ofk ₁+k ₂ is said to be a Ramsey partition for the pairk ₁,k ₂ if for any sublistL ofP, either there is a sublist ofL which sums tok ₁ or a sublist ofP –L which sums tok ₂. Properties of Ramsey partitions are discussed. In particular it is shown that there is a unique Ramsey partition fork ₁,k ₂ having the smallest numbern of terms, and in this casen is one more than the sum of the quotients in the Euclidean algorithm fork ₁ andk ₂.An application of Ramsey partitions to the following fair division problem is also discussed: Suppose two persons are to divide a cake fairly in the ratiok ₁k ₂. This can be done trivially usingk ₁+k ₂-1 cuts. However, every Ramsey partition ofk ₁+k ₂ also yields a fair division algorithm. This method yields fewer cuts except whenk ₁=1 andk ₂=1, 2 or 4.     

Summation and transformation formulas for elliptic hypergeometric series

Using matrix inversion and determinant evaluation techniques we prove several summation and transformation formulas for terminating, balanced, very-well-poised, elliptic hypergeometric series.     

Plancherel-Rotach asymptotics for certain basic hypergeometric series

In this work we study the chaotic and periodic asymptotics for the confluent basic hypergeometric series. For a fixed q∈(0,1), the asymptotics for Euler's q-exponential, q-Gamma function Γq(x), q-Airy function of K. Kajiwara, T. Masuda, M. Noumi, Y. Ohta and Y. Yamada, Ramanujan function (q-Airy function), Jackson's q-Bessel function of second kind, Ismail-Masson orthogonal polynomials (q⁻¹-Hermite polynomials), Stieltjes-Wigert polynomials, q-Laguerre polynomials could be derived as special cases.     

Discrete Tomography and plane partitions

A plane partition   is a p×q$p\times q$ matrix A=(_aij)$A=(a_{ij})$, where 1?i?p$1?i?p$ and 1?j?q$1?j?q$, with non-negative integer entries, and whose rows and columns are weakly decreasing. From a geometric point of view plane partitions are equivalent to pyramids  , subsets of the integer lattice Z³${\mathbb{Z}}^3$ which play an important role in Discrete Tomography. As a consequence, some typical problems concerning the tomography of discrete lattice sets can be rephrased and considered via plane partitions. In this paper we focus on some of them. In particular, we get a necessary and sufficient condition for additivity, a canonical procedure for checking the existence of (weakly) bad configurations, and an algorithm which constructs minimal pyramids (with respect to the number of levels) with assigned projection of a bad configurations.     

Euler transformation formula for multiple basic hypergeometric series of type A and some applications

A multiple generalization of the Euler transformation formula for basic hypergeometric series ₂φ₁ is derived. It is obtained from the symmetry of the reproducing kernel for Macdonald polynomials by a method of multiple principal specialization. As applications, elementary proofs of the Pfaff-Saalschutz summation formula and the Gauss summation formula for basic hypergeometric series in U(n+1) due to S.C. Milne are given. Some other multiple transformation and summation formulas for very-well-poised ₁₀φ₉ and ₈φ₇ series, balanced ₄φ₃ series and ₃φ₂ series are also given.     

Formulæ for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz)

The purpose of this short article is to announce, and briefly describe, a Maple package, PARTITIONS, that (inter alia) completely automatically   discovers, and then proves, explicit expressions (as sums of quasi-polynomials) for _pm(n)$p_m(n)$ for any desired m. We do this to demonstrate the power of “rigorous guessing” as facilitated by the quasi-polynomial ansatz.     

On the largest size of a partition that is both s-core and t-core

Text

Let s,t be relatively prime positive integers. We prove a conjecture of Aukerman, Kane and Sze regarding the largest size of a partition that is simultaneously s-core and t-core by solving an equivalent problem concerning sets S of positive integers with the property that for n∈S, n−s∈S whenever n?s and n−t∈S whenever n?t.

Video

For a video summary of this paper, please visit http://www.youtube.com/watch?v=o1OEug8LryU.     

Partitions of bipartite numbers

Letp _j(m, n) be the number of partitions of (m, n) into at mostj parts. We prove Landman et al.'s conjecture: for allj andn, p _j(x, 2n–x) is a maximum whenx-n. More generally we prove that for all positive integersm, n andj, p _j(n, m)=p_j(m, n)p_j(m–1, n+1) ifmn.     

Elliptic hypergeometric series on root systems

We derive a number of summation and transformation formulas for elliptic hypergeometric series on the root systems A_n, C_n and D_n. In the special cases of classical and q-series, our approach leads to new elementary proofs of the corresponding identities.     

Stacked lattice boxes

We study the number of solutions of the Diophantine equationn=x ₁ x ₂+x ₂ x ₃+x ₃ x ₄+...+x _k x _k+1 The combinatorial interpretation of this equation provides the name stacked lattices boxes. The study of these objects unites three separate threads in number theory: (1) the Liouville methods, (2) MacMahon's partitions withk different parts, (3) the asymptotics of divisor sums begun by Ingham.Partially supported by National Science Foundation Grant DMS-9206993, USA.     

Legendre inversions and balanced hypergeometric series identities

By means of Legendre inverse series relations, we prove two terminating balanced hypergeometric series formulae. Their reversals and linear combinations yield several known and new hypergeometric series identities.     

q-Pell sequences and two identities of V.A. Lebesgue

We examine a pair of Rogers-Ramanujan type identities of Lebesgue, and give polynomial identities for which the original identities are limiting cases. The polynomial identities turn out to be q-analogs of the Pell sequence. Finally, we provide combinatorial interpretations for the identities.     

On the properties of Newton-Euler pairs

If and are two sequences such that a₁=b₁ and , then we say that (a_n,b_n) is a Newton-Euler pair. In the paper, we establish many formulas for Newton-Euler pairs, and then make use of them to obtain new results concerning some special sequences such as and B_n, where p(n) is the number of partitions of n, σ(n) is the sum of divisors of n, and B_n is the nth Bernoulli number.