Odd-part dominance for elementary symmetric products of partition parts

From papers

For a partition λ=(λ1,,λ)\lambda=(\lambda_1,\ldots,\lambda_\ell), let prei(λ)\operatorname{pre}_i(\lambda) be the partition whose parts are all products λi1λii\lambda_{i_1}\cdots\lambda_{i_i} with 1i1<<ii1\leq i_1<\cdots<i_i\leq\ell, and set prei(λ)=\operatorname{pre}_i(\lambda)=\emptyset when <i\ell<i. Let oi(n)o_i(n) be the number of partitions in prei(P(n))\operatorname{pre}_i(\mathcal P(n)) with odd parts, and let di(n)d_i(n) be the number with distinct parts. Odd-part dominance conjecture.

o2(n)d2(n)(n0),o3(n)d3(n)(n21).o_2(n)\geq d_2(n)\quad(n\geq0),\qquad o_3(n)\geq d_3(n)\quad(n\geq21).

These inequalities are based on numerical evidence and relate the parity and distinctness of partitions formed from elementary symmetric products; the source does not establish them.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Cristina Ballantine, George Beck and Mircea Merca, “Partitions and elementary symmetric polynomials – an experimental approach”, arXiv:2408.13346 (2024).

Solutions 0

No solutions have been posted yet.