Combinatorial congruences and Stirling numbers
Zhi-Wei Sun (2007)
Acta Arithmetica
Similarity:
Zhi-Wei Sun (2007)
Acta Arithmetica
Similarity:
Tsuneo Ishikawa (2006)
Acta Arithmetica
Similarity:
Song Heng Chan (2012)
Acta Arithmetica
Similarity:
Stanley Burris (1971)
Colloquium Mathematicae
Similarity:
Bruce C. Berndt, Ae Ja Yee (2002)
Acta Arithmetica
Similarity:
Henry H. Kim (2007)
Acta Arithmetica
Similarity:
Tran Duc Mai (1974)
Archivum Mathematicum
Similarity:
Sanoli Gun (2010)
Acta Arithmetica
Similarity:
Michael Dewar (2010)
Acta Arithmetica
Similarity:
Tsuneo Ishikawa (2003)
Acta Arithmetica
Similarity:
Matthew Boylan (2004)
Acta Arithmetica
Similarity:
S.A. Rankin (1991)
Semigroup forum
Similarity:
Harlan Stevens (1962)
Mathematische Zeitschrift
Similarity:
Stephen L. Bloom (1974)
Colloquium Mathematicae
Similarity:
Chris Jennings-Shaffer (2016)
Acta Arithmetica
Similarity:
We continue to investigate spt-type functions that arise from Bailey pairs. In this third paper on the subject, we proceed to introduce additional spt-type functions. We prove simple Ramanujan type congruences for these functions which can be explained by an spt-crank-type function. The spt-crank-type functions are actually defined first, with the spt-type functions coming from setting z = 1 in this definition. We find some of the spt-crank-type functions to have interesting representations...
Tao Yan Zhao, Lily J. Jin, C. Gu (2016)
Open Mathematics
Similarity:
Let p3(n) denote the number of 3-component multipartitions of n. Recently, using a 3-dissection formula for the generating function of p3(n), Baruah and Ojah proved that for n ≥ 0, p3(9n + 5) ≡ 0 (mod 33) and p3 (9n + 8) ≡ 0 (mod 34). In this paper, we prove several congruences modulo powers of 3 for p3(n) by using some theta function identities. For example, we prove that for n ≥ 0, p3 (243n + 233) ≡ p3 (729n + 638) ≡ 0 (mod 310).