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
Set Systems with Restricted Intersections modulo Prime Powers
✍ Scribed by László Babai; Péter Frankl; Samuel Kutin; Daniel Štefankovič
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 236 KB
- Volume
- 95
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
✦ Synopsis
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 result.
Theorem. Let p be a prime and q= p k . Let + 1 , ..., + s be distinct integers, 0 + i q&1. Let X be a set of n elements and let A 1 , A 2 , ..., A m be subsets of X with the following properties:
v For all i, j (1 i< j m), there exists l (1 l s) such that
📜 SIMILAR VOLUMES
## Abstract In this paper, the necessary and sufficient conditions for the existence of cyclic 2__q__‐cycle and __m__‐cycle systems of the complete graph with __q__ a prime power and 3 ≤ __m__ ≤ 32 are given. © 2005 Wiley Periodicals, Inc. J Combin Designs
The application of fu::v logic controllers t o improve power-system darnping behavioiir has received some attention in the literature during the ltrst few years. The paper presents an approach in which besides speed and its jirst derivative, the second derivative is applied to the F u z z y e t base