✦ LIBER ✦

Roots of Polynomials Modulo Prime Powers

✍ Scribed by Bruce Dearden; Jerry Metzger

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 202 KB
Volume: 18
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1996.0124

No coin nor oath required. For personal study only.

✦ Synopsis

In general , not every set of values modulo n will be the set of roots modulo n of some polynomial . In this note , some characteristics of those sets which are root sets modulo a prime power are developed , and these characteristics are used to determine the number of dif ferent sets of integers which are root sets of polynomials modulo some prime powers .

📜 SIMILAR VOLUMES

Root Sets of Polynomials Modulo Prime Po

Root Sets of Polynomials Modulo Prime Powers

✍ Davesh Maulik 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 194 KB

A subset R of the integers modulo n is defined to be a root set if it is the set of roots of some polynomial. Using the Chinese Remainder Theorem, the question of finding and counting root sets mod n is reduced to finding root sets modulo a prime power. In this paper, we provide a recursive construc

A Binomial Coefficient Congruence Modulo

A Binomial Coefficient Congruence Modulo Prime Powers

✍ K. Davis; W. Webb 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 94 KB

AND WilLiam WebB Department of Mathematics, Washington State Unicersity, Pullman, Washington 99164-3113 Communicated hy Hans Zassenhaus

Set Systems with Restricted Intersection

Set Systems with Restricted Intersections modulo Prime Powers

✍ László Babai; Péter Frankl; Samuel Kutin; Daniel Štefankovič 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 236 KB

We study set systems satisfying Frankl Wilson-type conditions modulo prime powers. We prove that the size of such set systems is polynomially bounded, in contrast with V. Grolmusz's recent result that for non-prime-power moduli, no polynomial bound exists. More precisely we prove the following resul

Linear Gaps between Degrees for the Poly

Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes

✍ Sam Buss; Dima Grigoriev; Russell Impagliazzo; Toniann Pitassi 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 214 KB

This paper gives nearly optimal lower bounds on the minimum degree of polynomial calculus refutations of Tseitin's graph tautologies and the mod p counting principles, p 2. The lower bounds apply to the polynomial calculus over fields or rings. These are the first linear lower bounds for the polynom

The Commutant Modulo Cp of Co-prime Powe

The Commutant Modulo Cp of Co-prime Powers of Operators on a Hilbert Space

✍ B.P Duggal 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 114 KB

Let H be a separable infinite-dimensional complex Hilbert space and let A B ∈ B H , where B H is the algebra of operators on H into itself. Let δ A B B H → B H denote the generalized derivation δ AB X = AX -XB. This note considers the relationship between the commutant of an operator and the commuta

Integer Polynomials with Roots mod p for

Integer Polynomials with Roots mod p for all Primes p

✍ Rolf Brandl 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 128 KB

Let f X be an integer polynomial which is a product of two irreducible factors. Assume that f X has a root mod p for all primes p. If the splitting field of f X over the rationals is a cyclic extension of the stem fields, then the Galois group of f X over the rationals is soluble and of bounded Fitt