When Are Monomial Symmetric Polynomials Hard?

Abstract

For a partition $\mathbf{\lambda }=({\lambda }_1,\dots ,{\lambda }_r)$ and $n\ge r$, the monomial symmetric polynomial is defined as $$m_{\mathbf{\lambda }}(x_1,\dots ,x_n):=\sum x_{i_1}^{{\lambda }_1}{x}_{i_2}^{{\lambda }_2}\cdots x_{i_r}^{{\lambda }_r},$$ where the sum ranges over all distinct monomials obtained by assigning the parts of $\mathbf{\lambda }$ to pairwise distinct variables. We establish an almost-complete dichotomy for the complexity of the monomial symmetric polynomials $m_{\mathbf{\lambda }}$: If a family of partitions contains polynomially many distinct parts, then the corresponding monomial symmetric polynomials (on sufficiently many variables) are VNP-complete. If the number of distinct parts is constant, the family admits polynomial-size circuits. Thus the only remaining gap concerns the intermediate regime where the number of distinct parts grows subpolynomially. As part of our proof, we use combinatorial properties of matching polynomials to establish VNP-hardness of the perfect matching polynomial for blow-up graphs; these are graphs with non-generic edge-weights that are obtained by "blowing up" a smaller graph. We reduce these matching polynomials to monomial-symmetric polynomials by combining classical techniques from algebraic complexity theory with structural properties of Sidon sets.

arXiv comment20 pages, 3 figures. Accepted at SODA 2027