Improved methods for the construction of relative invariants for permutation groups
From MaRDI portal
Publication:507130
DOI10.1016/J.JSC.2016.02.005zbMATH Open1393.12005OpenAlexW2307637559MaRDI QIDQ507130FDOQ507130
Authors: Andreas-Stephan Elsenhans
Publication date: 3 February 2017
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2016.02.005
Recommendations
Cites Work
- The Magma algebra system. I: The user language
- Computational invariant theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Determination of Galois Groups
- Endliche Gruppen I
- Constructing transitive permutation groups.
- The Transitive Permutation Groups of Degree 32
- Computation of Galois groups of rational polynomials
- Galois group computation for rational polynomials
- Invariants for the computation of intransitive and transitive Galois groups
Cited In (6)
- Effective Invariant Theory of Permutation Groups Using Representation Theory
- An improvement to the centralizer algorithm for permutation groups
- Title not available (Why is that?)
- Computing subfields of number fields and applications to Galois group computations
- On Göbel's bound for invariants of permutation groups
- Computing Galois groups of Ehrhart polynomials in OSCAR
Uses Software
This page was built for publication: Improved methods for the construction of relative invariants for permutation groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507130)