---
title: "Implementation Notes"
canonical: "https://docs.magma-maths.org/v2.30-1/GlobalFields/ArtinRepresentations/notes.html"
source: "https://docs.magma-maths.org/v2.30-1/GlobalFields/ArtinRepresentations/notes.md"
part: "Global Fields"
chapter: "Artin Representations"
breadcrumbs:
  - {"title": "Magma Handbook", "source": "https://docs.magma-maths.org/v2.30-1/index.md"}
  - {"title": "Global Fields", "source": "https://docs.magma-maths.org/v2.30-1/GlobalFields/index-global-fields.md"}
  - {"title": "Artin Representations", "source": "https://docs.magma-maths.org/v2.30-1/GlobalFields/ArtinRepresentations/index-artin-representations.md"}
prev: {"title": "Arithmetic", "source": "https://docs.magma-maths.org/v2.30-1/GlobalFields/ArtinRepresentations/arithmetic.md"}
next: {"title": "Bibliography", "source": "https://docs.magma-maths.org/v2.30-1/GlobalFields/ArtinRepresentations/bibliography.md"}
---

<a id="notes"></a>
# Implementation Notes

The algorithms for recognizing Frobenius elements in Galois groups are described in [[DD13](https://docs.magma-maths.org/v2.30-1/references.md#cite-ddfrob13)]. They rely on the cycle type identification, Serre’s trick for alternating groups, and the general machinery from [[DD13](https://docs.magma-maths.org/v2.30-1/references.md#cite-ddfrob13)]. Magma is usually able to handle Galois groups of size $<10000$ acting on a small number of points easily, and much larger special groups such as $A_n$ and $S_n$.
