Engineering↗
The Dedekind Criterion for p-Maximality
A cheap modular test deciding whether an order is maximal at a given prime, without computing the maximal order.
Every page in the KEVOS library tagged Dedekind Criterion. 2 pages.
A cheap modular test deciding whether an order is maximal at a given prime, without computing the maximal order.
The Pohst-Zassenhaus theorem, the Dedekind criterion, the radical and the ring of multipliers, and the Round 2 algorithm for computing the ring of integers.