arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1702.01097math.CO
收藏

关于PG(n,q)中的k-帽,其中q为偶数,n为\geq 3

On k-caps in PG(n, q), with q even and n \geq 3

J. A. Thas

摘要:

设m_2(n,q)为PG(n,q)中存在k-cap的k的最大值,m '_2(n,q)为PG(n,q)中存在完全k-cap的k的次大值。本文改进了Chao关于m '_2(3,q),q偶数,q \geq 8的上界q^2 - q + 5.作为推论,得到了m_2(n,q),q偶数,q \geq 8和n \geq 4的新界.曹和欧发表了一个更好的界限,但似乎有一个差距,他们的证明。

英文摘要:

Let m_2(n, q) be the maximum size of k for which there exists a k-cap in PG(n, q), and let m'_2(n, q) be the second largest value of k for which there exists a complete k-cap in PG(n, q). In this paper Chao's upper bound q^2 - q + 5 for m'_2(3, q), q even and q \geq 8, will be improved. As a corollary new bounds for m_2(n, q), q even, q\geq 8 and n \geq 4, are obtained. Cao and Ou published a better bound but there seems to be a gap in their proof.

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

↑