Symmetric Functions over Finite Fields

Mihai Prunescu

The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of algebraic relations found by the algorithm consists of polynomials having coefficients in the prime field F_p.

In Horaţiu Cheval, Laurenţiu Leuştean and Andrei Sipoş: Proceedings 7th Symposium on Working Formal Methods (FROM 2023), Bucharest, Romania, 21-22 September 2023, Electronic Proceedings in Theoretical Computer Science 389, pp. 131–143.
Published: 22nd September 2023.

ArXived at: https://dx.doi.org/10.4204/EPTCS.389.11 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org