Some algorithms in invariant theory of finite groups
The paper is concerned with various algorithms for invariant theory of finite groups. The main aim is the computation of the invariant ring of a given finite matrix group over a base field of arbitrary characteristic. Of particular interest is the modular case, i.e., the case where the characteristic of the base field \(K\) divides the group order. The authors have choosen the following approach: First they construct a system of primary invariants, i.e., homogeneous invariants \(f_1,\ldots,f_n\) which are algebraically independent and the invariant ring is a finitely generated module over \(A=K[f_1,\ldots,f_n]\). Then the authors calculate the generators of the invariant ring as an \(A\)-module (named secondary invariants). The algorithms for finding the secondary invariants are completely different for the modular and the non-modular cases. At the end the authors give easy algorithms to compute several properties of the invariant ring, such as the Cohen-Macaulay property, depth, free resolutions, the Hilbert series, and the complete intersection property. For the entire collection see [Zbl 0920.00022].
- Generating a Noetherian normalization of the invariant ring of a finite group
- On the Cohen-Macaulay property of modular invariant rings
- An algorithm for computing invariants of linear actions of algebraic groups up to a given degree.
- Finite affine groups: cycle indices, Hall-Littlewood polynomials, and probabilistic algorithms
- Computational invariant theory
- Minimal generating sets of non-modular invariant rings of finite groups
- Gröbner bases, invariant theory and equivariant dynamics
- Depth of modular invariant rings
- Computing the invariant ring of a finite group
- On the ring of invariants of ordinary quartic curves in characteristic 2
- scientific article; zbMATH DE number 1684362 (Why is no real title available?)
- Invariant theory for unipotent groups and an algorithm for computing invariants
- Algorithms for twisted involutions in Weyl groups.
- A Database of Invariant Rings
- scientific article; zbMATH DE number 5139459 (Why is no real title available?)
- Algorithms for the character theory of the symmetric group
- scientific article; zbMATH DE number 4042057 (Why is no real title available?)
- Invariant \(\mathrm G^2\mathrm V\) algorithm for computing SAGBI-Gröbner bases
- Algorithmic Recognition of Actions of 2-Homogeneous Groups on Pairs
- Calculs d'invariants primitifs de groupes finis
- scientific article; zbMATH DE number 488084 (Why is no real title available?)
- Using extended Derksen ideals in computational invariant theory
- Symmetric powers of modular representations, hilbert series and degree bounds
- Algorithms for fundamental invariants and equivariants of finite groups
- Constructing class invariants
- Algorithms in invariant theory
- Algorithms in invariant theory
- Explicit Galois realization of transitive groups of degree up to 15
- Symmetric powers of modular representations for groups with a Sylow subgroup of prime order
This page was built for publication: Some algorithms in invariant theory of finite groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4270322)
