Let M(m,n) and N(m,n) denote, respectively, the numbers of partitions of n with crank and rank m. Let M(a,c;n) and N(a,c;n) denote, respectively, the numbers of partitions of n with crank and rank congruent to a (modc). For sequences a={a(n)}n=1∞ and b={b(n)}n=1∞, write a≤Nb when a(n)≤b(n) for n≥N, and write a≤b when a(n)≤b(n) for n≥0. For 0≤j,d<11, define
Nj,d(n):=N(j,11;11n+d),Mj,d(n):=M(j,11;11n+d),pd(n):=p(11n+d).
Borozenets' conjecture. The following chains of inequalities hold:
N5,0N5,1N5,2N5,3N5,4N5,5N5,6N5,7N5,8N5,9N5,10≤N4,0≤2N3,0≤M1,0≤11p0≤M0,0≤1N2,0≤N1,0≤3N0,0,≤N4,1≤N3,1≤1M0,1≤M2,1≤11p1≤M1,1≤1N2,1≤N1,1≤N0,1,≤N4,2≤N3,2≤M0,2≤11p2≤M2,2≤1N2,2≤N1,2≤3N0,2,≤N4,3≤N3,3≤M1,3≤11p3≤M0,3≤N2,3≤1N1,3≤2N0,3,≤3N4,4≤N3,4≤1M1,4≤11p4≤M0,4≤1N2,4≤N1,4≤3N0,4,≤N4,5≤1N3,5≤M2,5≤11p5≤M0,5≤N2,5≤N1,5≤N0,5,≤1N4,6≤N3,6≤11p6≤N2,6≤N1,6≤1N0,6,≤N4,7≤N3,7≤M0,7≤11p7≤M1,7≤N2,7≤1N1,7≤N0,7,≤N4,8≤N3,8≤M0,8≤311p8≤3M1,8≤N2,8≤N1,8≤3N0,8,≤N4,9≤N3,9≤1M0,9≤11p9≤M1,9≤N2,9≤N1,9≤2N0,9,≤N4,10≤N3,10≤1M3,10≤11p10≤M0,10≤N2,10≤N1,10≤3N0,10.
These inequalities were conjectured by Borozenets and are the subject of the paper's proofs; the supplied source does not explicitly provide a resolution status for this statement.