Results 281 to 290 of about 382,616 (334)
Binary Quadratic Forms, Dihedral Fields and Decomposition Laws(Algebraic Number Theory)
, 1987 Franz Halter‐Koch
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
ON NONMONOGENIC ALGEBRAIC NUMBER FIELDS
Rocky Mountain Journal of Mathematics, 2023Let \(p\) be a prime number and \(f (x) = x^{p^ s}- ax^m- b\) belonging to \(\mathbb Z[x]\) be an irreducible polynomial. Let \( K = \mathbb Q(\theta )\) be an algebraic number field with \(\theta\) a root of \( f (x)\). Let \(r_1\) stand for the highest power of \(p\) dividing \(b^{p^s}- b -ab^m.\) This paper gives some explicit conditions involving ...
openaire +2 more sources
Realizing Algebraic Number Fields
1983In the paper [13], the authors studied the problem of realizing rational division algebras in a special way. Let D be a division algebra that is finite dimensional over the rational field Q. If p is a prime, we say that D is p-realizable when there is a p-local torsion free abelian group A whose rank is the dimension of D over Q, such that D is ...
R. S. Pierce, C. I. Vinsonhaler
openaire +1 more source
On the Class Numbers of Algebraic Number Fields
Journal of Mathematical Sciences, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
2016
Arithmetical algorithms considered in Chap. 5 are based on the arithmetical operations with matrices of the number systems. If the entries of these matrices are not integers or rationals, we need arithmetical algorithms which work with them. Such algorithms exist for algebraic numbers.
openaire +2 more sources
Arithmetical algorithms considered in Chap. 5 are based on the arithmetical operations with matrices of the number systems. If the entries of these matrices are not integers or rationals, we need arithmetical algorithms which work with them. Such algorithms exist for algebraic numbers.
openaire +2 more sources