Minimal generating sets of non-modular invariant rings of finite groups

DOI10.1016/J.JSC.2012.05.002MaRDI QIDQ1760101zbMATH OpenOpenAlexFDO

Authors Simon King

Publication date 12 November 2012

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0703035

zbMATH Keywords

invariant ringfundamental invariantsirreducible secondary invariantstruncated Gröbner basis

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Actions of groups on commutative rings; invariant theory (13A50)

Abstract: It is a classical problem to compute a minimal set of invariant polynomial generating the invariant ring of a finite group as an algebra. We present here an algorithm for the computation of minimal generating sets in the non-modular case. Apart from very few explicit computations of Groebner bases, the algorithm only involves very basic operations, and is thus rather fast. As a test bed for comparative benchmarks, we use transitive permutation groups on 7 and 8 variables. In most examples, our algorithm implemented in Singular works much faster than the one used in Magma, namely by factors between 50 and 1000. We also compute some further examples on more than 8 variables, including a minimal generating set for the natural action of the cyclic group of order 11 in characteristic 0 and of order 15 in characteristic 2. We also apply our algorithm to the computation of irreducible secondary invariants.

Recommendations

• scientific article; zbMATH DE number 1741032
• Evaluation properties of invariant polynomials
• Effective Invariant Theory of Permutation Groups Using Representation Theory
• scientific article; zbMATH DE number 1361365
• Algorithms in invariant theory
• scientific article; zbMATH DE number 1329476
• Degree bounds -- an invitation to postmodern invariant theory
• Algorithms in invariant theory
• Semi-invariants, equivariants and algorithms
• Calculs d'invariants primitifs de groupes finis

Cited in

(6)

• Computing the invariant ring of a finite group
• Generation modulo the action of a permutation group
• Computational aspects of Calogero-Moser spaces
• Computation of invariants of finite abelian groups
• scientific article; zbMATH DE number 1741032 (Why is no real title available?)
• Algorithms for fundamental invariants and equivariants of finite groups

Describes a project that uses

Uses Software

• PerMuVAR
• SINGULAR
• MuPAD
• Magma

This page was built for publication: Minimal generating sets of non-modular invariant rings of finite groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1760101)