Separating invariants for multisymmetric polynomials
Abstract
This article studies separating invariants for the ring of multisymmetric polynomials in m sets of n variables over an arbitrary field K. We prove that in order to obtain separating sets it is enough to consider polynomials that depend only on n2 + 1 sets of these variables. This improves a general result by Domokos about separating invariants. In addition, for n ≤ 4 we explicitly give minimal separating sets (with respect to inclusion) for all m in case char(K) = 0 or char(K) > n.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.