Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Degree bound for separating invariants of abelian groups (1602.06597v1)

Published 21 Feb 2016 in math.AC, math.NT, and math.RA

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.

Summary

We haven't generated a summary for this paper yet.