Symmetric polynomials over finite fields
M\'aty\'as Domokos, Botond Mikl\'osi

TL;DR
The paper characterizes when two vectors over a finite field are in the same orbit under symmetric group action using elementary symmetric polynomials, providing a near-minimal separating set of invariants.
Contribution
It introduces a new set of polynomial invariants that effectively distinguish orbits over finite fields, especially when the field size equals the characteristic.
Findings
Identifies conditions for vectors to be in the same orbit using elementary symmetric polynomials.
Provides a near-minimal separating set of invariants for large dimensions.
Derives a small set of multisymmetric polynomial invariants over finite fields.
Abstract
It is shown that two vectors with coordinates in the finite -element field of characteristic belong to the same orbit under the natural action of the symmetric group if each of the elementary symmetric polynomials of degree , has the same value on them. This separating set of polynomial invariants for the natural permutation representation of the symmetric group is not far from being minimal when and the dimension is large compared to . A relatively small separating set of multisymmetric polynomials over the field of elements is derived.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Finite Group Theory Research · graph theory and CDMA systems
