Arithmetic Properties of Summands of Partitions

Let d d, d2 2. We prove that for almost all partitions of an integer the parts are well distributed in residue classes mod d. The limitations of the uniformity of this distribution are also studied.     

On the distribution of the summands of partitions in residue classes

Summary It is proved that the summands of almost all partitions of nare well-distributed modulo dfor dup to d= n^1/2-ε.     

On the distribution of the summands of unequal partitions in residue classes

Summary It is proved that the summands of almost all unequal partitions of nare well-distributed modulo dfor d=o(n^1/2).     

Lecture Hall Partitions II

For a non-decreasing integer sequence a=(a₁,...,a_n) we define L_a to be the set of n-tuples of integers = (₁,...,_n) satisfying . This generalizes the so-called lecture hall partitions corresponding to a_i=i and previously studied by the authors and by Andrews. We find sequences a such that the weight generating function for these a-lecture hall partitions has the remarkable form In the limit when n tends to infinity, we obtain a family of identities of the kind the number of partitions of an integer m such that the quotient between consecutive parts is greater than is equal to the number of partitions of m into parts belonging to the set P, for certain real numbers and integer sets P. We then underline the connection between lecture hall partitions and Ehrhart theory and discuss some reciprocity results.     

Arithmetic Properties of Non-Squashing Partitions into Distinct Parts

A partition with is non-squashing if On their way towards the solution of a certain box-stacking problem, Sloane and Sellers were led to consider the number b(n) of non-squashing partitions of n into distinct parts. Sloane and Sellers did briefly consider congruences for b(n) modulo 2. In this paper we show that 2^r-2 is the exact power of 2 dividing the difference b(2^r+1n)–b(2^r-1n) for n odd and r 2.     

On the Combinatorics of Lecture Hall Partitions

A lecture hall partition of length n is an integer sequence satisfying Bousquet-Mélou and Eriksson showed that the number of lecture hall partitions of length n of a positive integer N whose alternating sum is k equals the number of partitions of N into k odd parts less than 2n. We prove the fact by a natural combinatorial bijection. This bijection, though defined differently, is essentially the same as one of the bijections found by Bousquet-Mélou and Eriksson.     

Jagged Partitions

By jagged partitions we refer to an ordered collection of non-negative integers (n₁, n₂,..., n_m) with n_m≥ p for some positive integer p, further subject to some weakly decreasing conditions that prevent them for being genuine partitions. The case analyzed in greater detail here corresponds to p = 1 and the following conditions n_i≥ n_i+1−1 and n_i≥ n_i+2. A number of properties for the corresponding partition function are derived, including rather remarkable congruence relations. An interesting application of jagged partitions concerns the derivation of generating functions for enumerating partitions with special restrictions, a point that is illustrated with various examples. 2000 Mathematics Subject Classification: Primary—05A15, 05A17, 05A19     

Lecture Hall Partitions

We prove a finite version of the well-known theorem that says that the number of partitions of an integer N into distinct parts is equal to the number of partitions of N into odd parts. Our version says that the number of lecture hall partitions of length n of N equals the number of partitions of N into small odd parts: 1,3,5, ldots, 2n-1 . We give two proofs: one via Bott's formula for the Poincaré series of the affine Coxeter group , and one direct proof.     

Cylindric Partitions

A new object is introduced into the theory of partitions that generalizes plane partitions: cylindric partitions. We obtain the generating function for cylindric partitions of a given shape that satisfy certain row bounds as a sum of determinants of -binomial coefficients. In some special cases these determinants can be evaluated. Extending an idea of Burge (J. Combin. Theory Ser. A 63 (1993), 210-222), we count cylindric partitions in two different ways to obtain several known and new summation and transformation formulas for basic hypergeometric series for the affine root system . In particular, we provide new and elementary proofs for two basic hypergeometric summation formulas of Milne (Discrete Math. 99 (1992), 199-246).

     

Jean-Louis Nicolas and the Partitions

A survey of Jean-Louis Nicolas’s papers on partitions is given.Dedicated to Jean-Louis Nicolas on the occasion of his 60th birthdayPartially supported by the Hungarian National Foundation for Scientific Research, Grant No. T 029759.2000 Mathematics Subject Classification: Primary—11P81     

On a Problem of Lehmer on Partitions into Squares

In 1948, D.H.Lehmer published a brief work discussing the difference between representations of the integer n as a sum of squares and partitions of n into square summands. In this article, we return to this topic and consider four partition functions involving square parts and prove various arithmetic properties of these functions. These results provide a natural extension to the work of Lehmer.     

乘法分拆的计数函数的估值

设f(n)表示自然数n的乘法分拆数。对于所有奇数，较大地改进了n的系数，证明了：若n为奇数，则f(n)≤n/15 7/5。     

Partitions of finite vector spaces into subspaces

Let V_n(q) denote a vector space of dimension n over the field with q elements. A set of subspaces of V_n(q) is a partition of V_n(q) if every nonzero element of V_n(q) is contained in exactly one element of . Suppose there exists a partition of V_n(q) into x_i subspaces of dimension n_i, 1 ≤ i ≤ k. Then x₁, …, x_k satisfy the Diophantine equation . However, not every solution of the Diophantine equation corresponds to a partition of V_n(q). In this article, we show that there exists a partition of V_n(2) into x subspaces of dimension 3 and y subspaces of dimension 2 if and only if 7x + 3y = 2ⁿ ? 1 and y ≠ 1. In doing so, we introduce techniques useful in constructing further partitions. We also show that partitions of V_n(q) induce uniformly resolvable designs on qⁿ points. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 329–341, 2008     

Equitable Partitions of Flat Association Schemes

Let (X, G) be an association scheme. We say that (X, G) is flat if it is homogeneous and if any two distinct points have at most one common g-neighbor for each g ∈ G. In this paper we prove that any nondiscrete equitable partition of (X, G) has at most one singleton if (X, G) is flat, and {X} is the unique equitable partition without any singleton if (X, G) is flat and |X| is a prime. This work was supported for two years by Korea Research Foundation Grant (KRF-2006-003-C00010) and Pusan National University Research Grant. Received: January 31, 2007. Final version received: Novmeber 14, 2007.     

Rogers-Ramanujan Type Identities for Partitions with Attached Odd Parts

In this paper we present a new infinite family of partition identities. The genesis of our work lies in two formulas of Lucy Slater related to the modulus 8. Hirschhorn, Agarwal and Subbarao have previously found intriguing interpretations for Slater's formula, but none has led to an infinite family of results.     

与正整数的无序分拆和有序分拆相关的一些恒等式

Agarwal在2003年给出了一个联系着正整数的无序分拆与有序分拆的恒等式．本文给出了该问题的另外的一些恒等式．此外,利用菲波拉契数讨论了将正整数n分拆成不含分部量1的有序分拆的几个组合性质．     

Partitions and Compositions Defined by Inequalities

We consider sequences of integers (₁,..., _k) defined by a system of linear inequalities _{i j>i}a_ijj with integer coefficients. We show that when the constraints are strong enough to guarantee that all _i are nonnegative, the generating function for the integer solutions of weight n has a finite product form , where the b_i are positive integers that can be computed from the coefficients of the inequalities. The results are proved bijectively and are used to give several examples of interesting identities for integer partitions and compositions. The method can be adapted to accommodate equalities along with inequalities and can be used to obtain multivariate forms of the generating function. We show how to extend the technique to obtain the generating function when the coefficients a_i,i+1 are allowed to be rational, generalizing the case of lecture hall partitions. Our initial results were conjectured thanks to the Omega package (G.E. Andrews, P. Paule, and A. Riese, European J. Comb. 22(7) (2001), 887–904).Research supported by NSA grants MDA 904-00-1-0059 and MDA 904-01-0-0083.     

Elementary Proofs of Identities for Schur Functions and Plane Partitions

We use elementary methods to prove formulas that represent sums of restricted classes of Schur functions as ratios of determinants. This includes recent formulas for sums over bounded partitions with even parts and sums over bounded partitions whose conjugates have only even parts. All of these formulas imply plane partition generating functions.     

Popularity of Sets Represented by the Partitions of n

Let us say that a partition of the positive integer n represents a, 0 a n, if there is a submultiset of the multiset of the parts whose sum is a. Erd os and Szalay have proved that almost all partitions of n represent all integers a, 0 a n. If is a finite set of positive integers, let us denote by p~(n, ) the number of partitions of n which represent all integers a, 0 a n, a , n – a but do not represent a for a . For instance, p~(n,) is the number of partitions of n which represent all integers between 0 and n; the result of Erd os and Szalay can be reformulated as p~(n,) p(n), where p(n) is the total number of partitions of n. The aim of this paper is the study of p~(n, ): we shall compare the values of p~(n, ) for small sets and we shall give a close formula for p~(n, ) when is the set of the first k integers.     

关于乘法分拆数的一个猜想和上界

本文证明了乘法分拆数的一个上界,由此证明了Hughes-Shallit的第二猜想,同时证明了对任意的正数a,存在一个自然数N,当n≥N时,n的乘法分拆数f(n)0,使这个集合中的自然数的乘法分拆数≤n~a。