Algorithmic invariant theory of nonreductive groups
From MaRDI portal
Recommendations
- Computing invariants of algebraic groups in arbitrary characteristic
- scientific article; zbMATH DE number 67334
- The computation of invariant fields and a constructive version of a theorem by Rosenlicht
- Computational invariant theory
- Computing invariants of reductive groups in positive characteristic
Cites work
- scientific article; zbMATH DE number 4215907 (Why is no real title available?)
- scientific article; zbMATH DE number 3697268 (Why is no real title available?)
- scientific article; zbMATH DE number 3737912 (Why is no real title available?)
- scientific article; zbMATH DE number 44019 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 1504682 (Why is no real title available?)
- scientific article; zbMATH DE number 217454 (Why is no real title available?)
- A Finite Separating Set for Daigle and Freudenburg's Counterexample to Hilbert's Fourteenth Problem
- A counterexample to Hilbert's fourteenth problem in dimension 5
- A course in commutative algebra
- Algorithms in invariant theory
- Computation of invariants for reductive groups
- Computational invariant theory
- Computing invariants of algebraic groups in arbitrary characteristic
- Computing invariants of reductive groups in positive characteristic
- Finite separating sets and quasi-affine quotients
- Invariant rings and quasiaffine quotients
- Invariant theory
- Invariant theory for unipotent groups and an algorithm for computing invariants
- Invariants of a group in an affine ring
- Krull dimension, transcendence degree and subalgebras of finitely generated algebras
- Lectures on the fourteenth problem of Hilbert
- Minimum number of fundamental invariants for the binary form of degree 7
- On Noether's bound for polynomial invariants of a finite group
- On Noetherian subrings of an affine domain
- Polarization of Separating Invariants
- Rational invariants of a group action. Construction and rewriting
- Reduction and reconstruction for symmetric ordinary differential equations
- Reductive groups are geometrically reductive
- Separating invariants
- Separating invariants and finite reflection groups
- The Magma algebra system. I: The user language
- The Noether bound in invariant theory of finite groups
- The computation of invariant fields and a constructive version of a theorem by Rosenlicht
- The invariants of the binary decimic
- The invariants of the binary nonic
- Über die Invarianten von linearen Gruppen
Cited in
(15)- A classification of computational assumptions in the algebraic group model
- Invariants of finite and discrete group actions via moving frames
- Using extended Derksen ideals in computational invariant theory
- An algorithm for computing invariants of linear actions of algebraic groups up to a given degree.
- scientific article; zbMATH DE number 4042057 (Why is no real title available?)
- Computation of invariants of finite abelian groups
- Separating invariants of finite groups
- Invariant theory for unipotent groups and an algorithm for computing invariants
- The separating variety for matrix semi-invariants
- Polynomial bounds for invariant functions separating orbits
- The separating variety for 2 × 2 matrix invariants
- scientific article; zbMATH DE number 4116805 (Why is no real title available?)
- scientific article; zbMATH DE number 67334 (Why is no real title available?)
- scientific article; zbMATH DE number 16177 (Why is no real title available?)
- Computing invariants of reductive groups in positive characteristic
This page was built for publication: Algorithmic invariant theory of nonreductive groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1936480)
