Some inequalities on cranks of cubic partitions modulo 4 and 6

From MaRDI portal
Publication:2681981





The crank is a partition statistic requested by \textit{J. W. Dyson} [``Some guesses in the theory of partitions, Eureka 8, 10--15 (1944)] in order to combinatorially prove a Ramanujan congruence for Euler's partition function \(p(n)\). The partition crank function was developed by \textit{G. E. Andrews} and \textit{F. G. Garvan} [Bull. Am. Math. Soc., New Ser. 18, No. 2, 167--171 (1988; Zbl 0646.10008)] and \textit{F. G. Garvan} [Trans. Am. Math. Soc. 305, No. 1, 47--77 (1988; Zbl 0641.10009)]. The partitions in which even parts come in two colors are known as cubic partitions. The concept of crank for cubic partitions which explains infinitely many cubic partition congruences modulo powers of \(3\) combinatorially, was defined by \textit{B. Kim} [Acta Arith. 148, No. 1, 1--19 (2011; Zbl 1219.11154)]. In this paper, the authors prove some inequalities on cranks of cubic partitions.











This page was built for publication: Some inequalities on cranks of cubic partitions modulo 4 and 6

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2681981)