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

关节的紧界与结构定理

Tight Bound and Structural Theorem for Joints

Ting-Wei Chao, Hung-Hsun Hans Yu

AI总结:

本文通过精细的多项式方法证明了关节问题中 Guth-Katz 构造的最优性及唯一性,给出首个紧界与结构定理,并强化了重数定义及证明相关猜想。

摘要:

在域 $\mathbb{F}^d$ 中,一组直线 $\mathcal{L}$ 的关节是指被 $d$ 条方向线性无关的直线所包含的点。关节问题询问 $L$ 条直线最多能形成多少个关节。Guth 和 Katz 利用多项式方法证明了在 $\mathbb{R}^3$ 中关节数量至多为 $O(L^{3/2})$。这一上界可通过如下构造达到:取一般位置下 $M$ 个超平面的所有 $d$ 维交点和所有 $(d-1)$ 维交点分别作为关节和直线。此外,该构造被猜想为最优的。在本文中,我们通过更精细的多项式方法论证验证了这一猜想,并证明这是唯一的最优构造。这是首次利用该方法得到的紧界和结构定理。我们还给出了重数的新定义,强化了 Tidor、Zhao 和本文第二作者先前工作的主要结果。最后,我们将关节问题与一些集合论问题联系起来,并证明了 Bollobás 和 Eccles 关于部分阴影的猜想。

英文摘要:

A joint of a set of lines $\mathcal{L}$ in $\mathbb{F}^d$ is a point that is contained in $d$ lines with linearly independent directions. The joints problem asks for the maximum number of joints that are formed by $L$ lines. Guth and Katz showed that the number of joints is at most $O(L^{3/2})$ in $\mathbb{R}^3$ using polynomial method. This upper bound is met by the construction given by taking the joints and the lines to be all the $d$-wise intersections and all the $(d-1)$-wise intersections of $M$ hyperplanes in general position. Furthermore, this construction is conjectured to be optimal. In this paper, we verify the conjecture and show that this is the only optimal construction by using a more sophisticated polynomial method argument. This is the first tight bound and structural theorem obtained using this method. We also give a new definition of multiplicity that strengthens the main result of a previous work by Tidor, Zhao and the second author. Lastly, we relate the joints problem to some set-theoretic problems and prove conjectures of Bollobás and Eccles regarding partial shadows.

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

↑