# Arithmetic properties of triangular partitions

## Main Article Content

## Abstract

We obtain a two variable generating function for the number of triangular partitions. Using this generating function, we study arithmetic properties of a certain weighted count of triangular partitions. Finally, we introduce a rank-type function for triangular partitions, which gives a combinatorial explanation for a triangular partition congruence.

## Article Details

## Supporting Agencies

## References

[1] G.E. Andrews, The Theory of Partitions, Addison-Wesley, Reading, MA, 1976; reissued: Cambridge University Press, Cambridge, 1998. Google Scholar

[2] G.E. Andrews and F. Garvan, Dyson’s crank of a partition, Bull. Amer. Math. Soc. 18 (1988) (2), 167–171. Google Scholar

[3] A.O.L. Atkin and P. Swinnerton-Dyer, Some properties of partitions, Proc. London Math. Soc. 4 (1954), 84–106. Google Scholar

[4] B.C. Berndt, Number theory in the spirit of Ramanujan, Student Mathematical Library, 34. American Mathematical Society, Providence, RI, 2006. Google Scholar

[5] F.J. Dyson, Some guesses in the theory of partitions, Eureka 8 (1944), 10–15. Google Scholar

[6] F. Garvan, New combinatorial interpretations of Ramanujan’s partition congruences mod 5, 7 and 11, Trans. Amer. Math. Soc. 305 (1988), no. 1, 47–77. Google Scholar

[7] B. Kim, Group Actions on Partitions, Elect. J. Comb. 24 (2017), Paper #P3.58. Google Scholar

[8] B. Kim, Polygonal partitions, Korean J. Math. 26 (2018), no. 2, 167–174. Google Scholar