Results 291 to 300 of about 268,307 (331)
Some of the next articles are maybe not open access.

Factoring Polynomials Over Algebraic Number Fields

ACM Transactions on Mathematical Software, 1976
A method for factoring polynomials whose coefficients are in an algebraic number field is presented. This method is a natural extension of the usual Henselian technique for factoring polynomials with integral coefficients. In addition to working in any number field, our algorithm has the advantage of factoring nonmonic polynomials without inordinately ...
Weinberger, P. J.   +1 more
openaire   +2 more sources

Algebraic Number Fields

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

ALGEBRAIC NUMBER FIELDS WITH LARGE CLASS NUMBER

Mathematics of the USSR-Izvestiya, 1974
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Algebraic Number Fields

2012
This chapter is an introduction to algebraic number fields, which arose from both a generalization of the arithmetic in ℤ and the necessity to solve certain Diophantine equations. After recalling basic concepts from algebra and providing some polynomial irreducibility tools, the ring of integers \(\mathcal {O}_{\mathbb {K}}\) of an algebraic number ...
openaire   +1 more source

Algebraic number fields

1993
An algebraic number field F is a finite extension field of the rational numbers ℚ. It can be generated by a root p of a monic irreducible polynomial $$f(t) = {{t}^{n}} + {{a}_{1}}{{t}^{{n - 1}}} + {\text{ }} \ldots + {{a}_{n}}\epsilon \mathbb{Z}[t]$$ , (27) where n is also called the degree of F.
openaire   +1 more source

Factoring Polynomials over Algebraic Number Fields

SIAM Journal on Computing, 1985
The author describes an algorithm for factoring polynomials over arbitrary number fields. This algorithm works as follows. Given a polynomial f, defined over a number field K. We take the norm N f of f to \({\mathbb{Q}}[X]\), and factor N f over \({\mathbb{Q}}\). If N f is square free we derive a factorization of f.
openaire   +2 more sources

Algebraic Numbers and Number Fields

1998
A number α is called an algebraic number if it satisfies an equation of degree m of the form $${\alpha ^m} + {a_1}{\alpha ^{m - 1}} + {a_2}{\alpha ^{m - 2}} + \cdots + {a_m} = 0$$ where a 1, a 2,..., a m are rational numbers.
openaire   +1 more source

Algebra of Number Fields

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

Algebraic Number Fields

2017
Garrett Birkhoff, Saunders Mac Lane
openaire   +1 more source

Cancer treatment and survivorship statistics, 2022

Ca-A Cancer Journal for Clinicians, 2022
Kimberly D Miller   +2 more
exaly  

Home - About - Disclaimer - Privacy