Results 31 to 40 of about 76 (75)

Congruences involving generalized Frobenius partitions

open access: yes, 1992
International Journal of Mathematics and Mathematical Sciences, Volume 16, Issue 2, Page 413-415, 1993.
James Sellers
wiley   +1 more source

© Hindawi Publishing Corp. A COMBINATORIAL PROOF OF A PARTITION IDENTITY OF ANDREWS AND STANLEY

open access: yes, 2004
In his paper, “On a partition function of Richard Stanley, ” George Andrews proves a certain partition identity analytically and asks for a combinatorial proof. This paper provides the requested combinatorial proof.
Andrew V. Sills
core  

Integer partitions into diophantine pairs

open access: yes, 2017
Let n, a and b be positive integers. The pair (a; b) is called an integer partition of n into Diophantine pair if n = a+b, ab+1 is a perfect square and a > b.
Bouroubi, S   +4 more
core  

Two congruences involving 4-cores

open access: yes, 1996
. The goal of this paper is to prove two new congruences involving 4-cores using elementary techniques; namely, if a4(n) denotes the number of 4-cores of n, then a4(9n+2) j 0 (mod 2) and a4(9n + 8) j 0 (mod 4).
Michael D. Hirschhorn, James A. Sellers
core  

New infinite families of congruences for Andrews' (K,I)-singular overpartitions

open access: yes, 2018
In a recent work, Andrews dened the singular overpartition functions, denoted by C̄k;i(n), which count the number of overpartitions of n in which no part is divisible by k and only parts ≡±i (mod k) may be overlined.
Yao, Olivia X.M., Li, Xiaorong
core  

© Hindawi Publishing Corp. CONGRUENCES IN ORDERED PAIRS OF PARTITIONS

open access: yes, 2003
Dyson defined the rank of a partition (as the first part minus the number of parts) whilst investigating certain congruences in the sequence p−1(n). The rank has been widely studied as have been other statistics, such as the crank.
Richard Lewis, Paul Hammond
core  

Short and Easy Computer Proofs of the Rogers-Ramanujan Identities and of Identities of Similar Type

open access: yes, 1994
New short and easy computer proofs of finite versions of the Rogers-Ramanujan identities and of similar type are given. These include a very short proof of the first Rogers-Ramanujan identity that was missed by computers, and a new proof of the well ...
Peter Paule
core  

On the Multiplicity of Parts in a Random Partition

open access: yes, 1998
Let be a partition of an integer n chosen uniformly at random among all such partitions. Let s() be a part size chosen uniformly at random from the set of all part sizes that occur in .
Sylvie Corteel   +3 more
core  

Sequences in overpartitions. [PDF]

open access: yesRamanujan J, 2023
Andrews GE, Uncu AK.
europepmc   +1 more source

Home - About - Disclaimer - Privacy