Engineering↗
The Pohst-Zassenhaus Theorem
The theorem underlying maximal order computation: enlarging an order by the ring of multipliers of its radical.
Tag
Pohst-Zassenhaus
Every page in the KEVOS library tagged Pohst-Zassenhaus. 3 pages.
Engineering↗
The Round 2 Maximal Order Algorithm
The Round 2 algorithm: computing the maximal order prime by prime via radicals and rings of multipliers.
Engineering↗
Computing the Maximal Order: the Round 2 Algorithm
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.
Related
Other tags in the library.
mathematics 387
abstract algebra 252
Machine Design 184
business 179
project management 158
Computational Number Theory 123
algebra handbook 85
graduate mathematics 85
handbook 79
templates and examples 78
History of Engineering 77
Manufacturing 76
algebra and trigonometry 74
universal algebra 62
algebra 60
project delivery 60
principles of project management 58
advanced algebra 53
Fasteners and Joints 53
Civil Engineering 48
CAD 42
Context and scope 42
Machine Elements 40
Threading and Gaging 37
Mechanical Engineering 35
Power Transmission 34
template 34
Operational Excellence 32
example 31
project leadership 31
project teams 31
strategy 31
Business Expansion 29
Metrology 29
project management research 29
Sales & Marketing 29
personal development 27
behaviour change 26
habits 26
systems 26