期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：1998
卷号：1998
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：We study pairs of families 21r such that ABL for any
A, B. We are interested in the maximal
product , given r and L. We give
asymptotically optimal bounds for L containing only elements
of sq residue classes modulo q, where q is arbitrary
(even non-prime) and s is a constant. As a consequence, we
obtain a version of Frankl-R\"{o}dl result about forbidden
intersections for the case of two forbidden intersections. We
also give tight bounds for L=0k .
