๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Inclusion sets for roots of polynomials

โœ Scribed by F. L. Bauer

Publisher
Springer-Verlag
Year
1966
Tongue
English
Weight
169 KB
Volume
9
Category
Article
ISSN
0029-599X

No coin nor oath required. For personal study only.

๐Ÿ“œ 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

On splitting sets in block designs and f
On splitting sets in block designs and finding roots of polynomials
โœ P.C. Van Oorschot; S.A. Vanstone ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1006 KB

The general notion of t-splitting sets is introduced within the context of combinatorial block designs. A greatest lower bound on cardinality of such sets, and an upper bound on cardinality of the smallest such set in a given design are established. The abstraction of t-splitting sets is shown to pr