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
On two set-systems with restricted cross-intersections
β Scribed by Chuanzhong Zhu
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 170 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In [Blokhuis and Lavrauw (Geom. Dedicata 81 (2000), 231-243)] a construction of a class of two-intersection sets with respect to hyperplanes in PGΓ°r Γ 1; q t Γ; rt even, is given, with the same parameters as the union of Γ°q t=2 Γ 1Γ=Γ°q Γ 1Γ disjoint Baer subgeometries if t is even and the union of Γ°
The growth function for a class of subsets C of a set X is defined by m'(N) = max {AC(F): F G X, IFI = N} , N = 1,2,. . . , where AC(F) = ({F n C: C E C}l, the number of possible sets obtained by intersecting an element of C with the set F. Sauer (1972) showed that if C forms a Vapnik-Chervonenkis c
We present a conjecture, with some supporting results, concerning the maximum size of a family of subsets satisfying the following conditions: the intersection of any two members of the family has cardinal@ at least s, and the intersection of the complements of any two members has cardinal@ at least