On a theorem of Ore (Q1184186): Difference between revisions
From MaRDI portal
Removed claims |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Enric Nart Viñals / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: István Gaál / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3754073 / rank | |||
Normal rank |
Latest revision as of 16:02, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On a theorem of Ore |
scientific article |
Statements
On a theorem of Ore (English)
0 references
28 June 1992
0 references
The paper gives a generalization of a theorem of \textit{Ø. Ore} [Math. Ann. 99, 84--117 (1928; JFM 54.0191.02)] on the prime ideal decomposition of the rational primes in a number field \(K\). The authors use Newton's polygon techniques, as Ore and they give a much weaker condition, under which the method is still applicable. An effective criterion is formulated to decide if the condition is satisfied. The algorithm reduces the problem of prime ideal decomposition to polynomial factorizations over finite fields. The paper includes also a survey on the classical results of Kummer, Dedekind and on the work of Ore in this field.
0 references
absolute discriminant
0 references
survey on classical results
0 references
prime ideal decomposition
0 references
rational primes
0 references
Newton's polygon
0 references
algorithm
0 references
polynomial factorizations over finite fields
0 references