Using Gröbner bases for detecting polynomial identities: A case study on Fermat's ideal (Q1199983)

For Fermat polynomials \(F_ n=x^ n+y^ n-z^ n\) a recursive identity \(F_{n+3}=-(S_ 0F_ n + S_ 1F_{n+1} + S_ 2 F_{n+2})\) with the elementary symmetric polynomials \(S_ i\) in \(x,y,z\) is reduced to a computation of a Gröbner basis in the ideal \((F_ i)\), \(i>2\). By computing Hilbert functions a proof for the ideal identity \(\Sigma(F_ i) \equiv (F_ 3,F_ 4,F_ 5)\) is given. The authors claim that similar methods can be used for generating different polynomial relations.