arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2605.28709math.COmath.MG
收藏

双盖猜想的改进上界

Improved bounds for the double cap conjecture

HUN-REN Alfréd Rényi Institute of Mathematics(匈牙利科学院阿尔弗雷德·雷尼数学研究所);Department of Analysis and Operations Research, Institute of Mathematics, Budapest University of Technology and Economics(布达佩斯技术与经济大学数学研究所分析与运筹学系)

Domonkos Czifra, Ákos Dúcz, Máté Matolcsi, Dániel Varga, Pál Zsámboki

AI总结:

本文通过结合调和分析与有限图的几何分数色数,并借助计算机搜索找到33个点的集合,将Witsenhausen问题中n=3时的上界从0.2977改进到0.2953。

摘要:

1974年,Witsenhausen提出了一个问题:求单位球面$\mathbb{S}^{n-1}\subset \mathbb{R}^n$上可测子集$A$的最大可能密度$\alpha_n$,使得$A$中不含正交向量对。对于$n=3$,已知的最佳下界是$1 - 1/\sqrt{2} = 0.29289\dots$,由两个对径球冠的自然“双盖”构造得到,Gil Kalai猜想该构造对所有$n$都是最优的。本文采用一种新方法建立了$\alpha_3\le 0.2953$的上界,改进了Bekker等人(2025)之前的最佳上界0.2977。我们的方法将调和分析论证与Ambrus等人(2024)最近引入的有限图几何分数色数相结合。在此框架下,球面上的任何有限子集都能给出$\alpha_n$的上界,我们通过大规模计算机搜索确定了一个包含33个点的适当点集,从而得到了该上界。同样的方法也可用于更高维数,以改进已知的最佳上界。

英文摘要:

In 1974, Witsenhausen asked for the maximum possible density $α_n$ of a measurable subset $A$ of the unit sphere $\mathbb{S}^{n-1}\subset \mathbb{R}^n$ such that $A$ contains no pair of orthogonal vectors. For $n=3$, the best known lower bound is $1 - 1/\sqrt{2} = 0.29289\dots$, obtained from the natural "double cap" construction of two opposite spherical caps, which is conjectured to be optimal for all $n$ by Gil Kalai. In this paper, we use a novel approach to establish an upper bound of $α_3\le 0.2953$, improving the previous best known bound $0.2977$ due to Bekker et al. (2025). Our approach combines harmonic-analytic arguments with the geometric fractional chromatic number of finite graphs, recently introduced by Ambrus et al. (2024). In this framework, any finite subset of the sphere yields an upper bound for $α_n$, and we obtain our bound by identifying an appropriate 33-element point set through a large-scale computer search. The same method can also be used in higher dimensions to yield potential improvements of the best known bounds.

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

↑