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 p-maximality. 3 pages.
A cheap modular test deciding whether an order is maximal at a given prime, without computing the maximal order.
The maximal order problem, its reduction to a prime-by-prime question, and the factoring obstruction that limits it.
The theorem underlying maximal order computation: enlarging an order by the ring of multipliers of its radical.