2000 character limit reached
Degree bound for separating invariants of abelian groups
Published 21 Feb 2016 in math.AC, math.NT, and math.RA | (1602.06597v1)
Abstract: It is proved that the universal degree bound for separating polynomial invariants of a finite abelian group (in non-modular characteristic) is strictly smaller than the universal degree bound for generators of polynomial invariants, unless the goup is cyclic or is the direct product of $r$ even order cyclic groups where the number of two-element direct factors is not less than the integer part of the half of $r$. A characterization of separating sets of monomials is given in terms of zero-sum sequences over abelian groups.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.