arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1107.5651math.CO
收藏

指定交叉点

Specified Intersections

Dhruv Mubayi, Vojtech Rodl

摘要:

设M是{0,.,n}和F是一个n元集合的子集族,使得对于F中的每个A,B,A的交集B的大小在M中。假设l是M中包含的连续整数的最大数目,并且n足够大。然后我们证明了|F| < min {1.622 ^n 100 ^l,2^{n/2+l log^2 n}}。第一个界限补充了Frankl和第二个作者的前一个界限,即大约(1.99)^n,即使当M={0,1,.,n} - {n/4}。对于小的l,上述第二个界限变得比第一个界限更好。在这种情况下,它产生2^{n/2+o(n)},这可以被看作是著名的伯利坎普事件城定理的推广(在渐近意义上)。我们的第二个结果在不同的方向上补充了Frankl-Rodl的结果。固定eps>0和eps n < t < n/5,并且令M={0,1,.,n)-(t,t+n^{0.525})。然后,在上面的符号中,我们证明了对于足够大的n,|F| < n{n \choose(n+t)/2}。除了n的乘法因子外,这基本上是尖锐的。简短的证明使用了Frankl-Wilson定理和关于素数分布的结果。

英文摘要:

Let M be a subset of {0, .., n} and F be a family of subsets of an n element set such that the size of A intersection B is in M for every A, B in F. Suppose that l is the maximum number of consecutive integers contained in M and n is sufficiently large. Then we prove that |F| < min {1.622^n 100^l, 2^{n/2+l log^2 n}}. The first bound complements the previous bound of roughly (1.99)^n due to Frankl and the second author which applies even when M={0, 1,.., n} - {n/4}. For small l, the second bound above becomes better than the first bound. In this case, it yields 2^{n/2+o(n)} and this can be viewed as a generalization (in an asymptotic sense) of the famous Eventown theorem of Berlekamp. Our second result complements the result of Frankl-Rodl in a different direction. Fix eps>0 and eps n < t < n/5 and let M={0, 1, .., n)-(t, t+n^{0.525}). Then, in the notation above, we prove that for n sufficiently large, |F| < n{n \choose (n+t)/2}. This is essentially sharp aside from the multiplicative factor of n. The short proof uses the Frankl-Wilson theorem and results about the distribution of prime numbers.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑