On maximal rank properties for symmetric polynomials in an equigenerated monomial complete intersection
Filip Jonsson Kling, Samuel Lundqvist
TL;DR
This work addresses when symmetric polynomials act as max-rank elements on equigenerated monomial complete intersections, extending the Lefschetz paradigm beyond the classical linear form. Via a refined $k$-degree grading, Macaulay inverse systems, and determinant analysis of Toeplitz matrices, the authors achieve a complete classification for power-sum polynomials and a detailed two-variable Schur-polynomial criterion, plus partial results and conjectures for elementary and complete homogeneous symmetric polynomials. The results illuminate intricate interactions between graded Gorenstein structure, invariant theory, and combinatorics, and expose several open questions for higher variables and broader partitions. The findings have potential implications for related topics in algebraic combinatorics, Hilbert-series symmetry, and representation theory, offering a solid foundation for future work on Lefschetz-type phenomena in symmetric-invariant algebras.
Abstract
It is well known that a monomial complete intersection has the strong Lefschetz property in characteristic zero. This property is equivalent to the statement that any power of the sum of the variables is a maximal rank element on the complete intersection. In this paper, we investigate what happens when this element is replaced by another symmetric polynomial, in an equigenerated complete intersection. We answer the question completely for the power sum symmetric polynomial using a grading technique, and for any Schur polynomial in the case of two variables by deriving a closed formula for the determinants of a family of Toeplitz matrices. Further, we obtain partial results in three or more variables for the elementary and the complete homogeneous symmetric polynomials and pose several open questions.
