A combinatorial approach to the Groebner bases for ideals generated by elementary symmetric functions (Q2153399)

Summary: Previous work by \textit{T. Mora} and \textit{M. Sala} [J. Symb. Comput. 35, No. 2, 177--194 (2003; Zbl 1042.13017)] provides the reduced Groebner basis of the ideal formed by the elementary symmetric polynomials in \(n\) variables of degrees \(k=1, \ldots, n, \langle e_{1,n} (x), \ldots, e_{n,n} (x) \rangle\). \textit{J. Haglund} et al. [Adv. Math. 329, 851--915 (2018; Zbl 1384.05043)] expand upon this, finding the reduced Groebner basis of the ideal of elementary symmetric polynomials in \(n\) variables of degree \(d\) for \(d=n-k+1, \ldots, n\) for \(k\leqslant n\). In this paper, we further generalize their findings by using symbolic computation and experimentation to conjecture the reduced Groebner basis for the ideal generated by the elementary symmetric polynomials in \(n\) variables of arbitrary degrees and prove that it is a basis of the ideal.