✦ LIBER ✦

Sums of subsequences modulo prime powers

✍ Scribed by N. Alon

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 130 KB
Volume: 71
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(88)90032-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Enumeration of power sums modulo a prime

✍ Andrew M. Odlyzko; Richard P. Stanley 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 418 KB

Roots of Polynomials Modulo Prime Powers

✍ Bruce Dearden; Jerry Metzger 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 202 KB

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 wh

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

An extension of Chevalley's theorem to c

An extension of Chevalley's theorem to congruences modulo prime powers

✍ Stephen H. Schanuel 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 330 KB