✦ LIBER ✦

On the Smallest Divisor of a Polynomial

✍ Scribed by Maurice Mignotte; Philippe Glesser

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 129 KB
Volume: 17
Category: Article
ISSN: 0747-7171
DOI: 10.1006/jsco.1994.1017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for the divisors of monic p

An algorithm for the divisors of monic polynomials over a commutative ring

✍ Ihsen Yengui 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB

Gilmer and Heinzer proved that given a reduced ring R, a polynomial f divides a monic polynomial in R[X] if and only if there exists a direct sum decomposition of R = R0 ⊕ . . . ⊕ Rm (m ≤ deg f ), associated to a fundamental system of idempotents e0, . . . , em, such that the component of f in each

On the sum of Divisors Function

✍ U. Balakrishnan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 484 KB

On the Zeroes of a Polynomial

✍ H. Alzer 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 70 KB

On the Proximity of Algebraic Units To D

On the Proximity of Algebraic Units To Divisors

✍ G.R. Everest 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 493 KB

An asymptotic formula counting algebraic units with respect to a proximity function on the group variety is given. The proximity function measures the local distance to a divisor on the variety. The formula allows a natural definition of mean distance between the group and the divisor. By allowing t

Bounds for the Height of a Factor of a P

Bounds for the Height of a Factor of a Polynomial in Terms of Bombieri's Norms: II. The Smallest Factor

✍ David W. Boyd 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 436 KB

Let \(f(x)\) be a polynomial of degree \(n\) with complex coefficients, which factors as \(f(x)=\) \(g(x) h(x)\). Let \(H(g)\) be the maximum of the absolute value of the coefficients of \(g\). For \(1 \leq p \leq \infty\), let \([f]_{p}\) denote the \(p^{\text {th }}\) Bombieri norm of \(f\). This

On the Computation of Elementary Divisor

On the Computation of Elementary Divisors of Integer Matrices

✍ Frank Lübeck 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 229 KB

We describe a "semi-modular" algorithm which computes for a given integer matrix A of known rank and a given prime p the multiplicities of p in the factorizations of the elementary divisors of A. Here "semi-modular" means that we apply operations to the integer matrix A but the operations are driven