Results 301 to 310 of about 16,932,162 (348)
Some of the next articles are maybe not open access.
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
Journal of Soviet Mathematics, 1987
Translation from Itogi Nauki Tekh., Ser. Algebra Topol. Geom. 22, 117--204 (Russian) (1984; Zbl 0563.12002).
openaire +1 more source
Translation from Itogi Nauki Tekh., Ser. Algebra Topol. Geom. 22, 117--204 (Russian) (1984; Zbl 0563.12002).
openaire +1 more source
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
2019
A complex number \(\xi \) is called an algebraic integer if \(\mathbf {Z}[ \xi ]\) is a finitely generated \(\mathbf {Z}\)-module; this condition is equivalent to the fact that \(f( \xi )=0\) for some polynomial \(f(X)=X^m+a_1X^{m-1}+ \cdots +a_m\), \(a_i \in \mathbf {Z}\). Let \(\mathbf {A}\) be the set of all algebraic integers.
openaire +2 more sources
A complex number \(\xi \) is called an algebraic integer if \(\mathbf {Z}[ \xi ]\) is a finitely generated \(\mathbf {Z}\)-module; this condition is equivalent to the fact that \(f( \xi )=0\) for some polynomial \(f(X)=X^m+a_1X^{m-1}+ \cdots +a_m\), \(a_i \in \mathbf {Z}\). Let \(\mathbf {A}\) be the set of all algebraic integers.
openaire +2 more sources
1967
We shall need some elementary results about vector-spaces over Q, involving the following concept: Definition 1. Let E be a vector-space of finite dimension over Q. By a Q-lattice in E, we understand a finitely generated subgroup of E which contains a basis of E over Q. Proposition 1.
openaire +1 more source
We shall need some elementary results about vector-spaces over Q, involving the following concept: Definition 1. Let E be a vector-space of finite dimension over Q. By a Q-lattice in E, we understand a finitely generated subgroup of E which contains a basis of E over Q. Proposition 1.
openaire +1 more source
Polynomial Computability of Fields of Algebraic Numbers
Доклады академии наук, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alaev P., Selivanov V.
openaire +2 more sources
1981
A system of complex numbers is called a number field (or, more briefly, a field) if it contains more than one number and if along with the numbers α and β it always contains α + β, α − β,αβ, and, if β ≠ 0, α/β.
openaire +1 more source
A system of complex numbers is called a number field (or, more briefly, a field) if it contains more than one number and if along with the numbers α and β it always contains α + β, α − β,αβ, and, if β ≠ 0, α/β.
openaire +1 more source
1979
Any nonconstant polynomial with rational coefficients has roots in the complex numbers. Those complex numbers which are roots of polynomials with rational coefficients are called algebraic numbers.
openaire +1 more source
Any nonconstant polynomial with rational coefficients has roots in the complex numbers. Those complex numbers which are roots of polynomials with rational coefficients are called algebraic numbers.
openaire +1 more source
1988
Let us consider the diophantine equation $$x^2 - dy^2 = 1$$ (4.1) , erroneously called Pell’s equation. (For its history, see Ref. 9.) Here d ≠ 0 is a square-free integer. We seek the integer solutions of (4.1). If d 1, it is a nontrivial fact that (4.1) has infinitely many solutions in integers.
openaire +1 more source
Let us consider the diophantine equation $$x^2 - dy^2 = 1$$ (4.1) , erroneously called Pell’s equation. (For its history, see Ref. 9.) Here d ≠ 0 is a square-free integer. We seek the integer solutions of (4.1). If d 1, it is a nontrivial fact that (4.1) has infinitely many solutions in integers.
openaire +1 more source
A course in computational algebraic number theory
Graduate texts in mathematics, 1993H. Cohen
semanticscholar +1 more source