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

线上的点重构阈值

Sharp threshold for reconstructing points on the line

Mathematical Institute, University of Oxford(牛津大学数学研究所)

Georgii Zakharov

AI总结:

研究在线上点集重构问题,证明在特定概率下存在可重构子集,扩展了关于重构子集大小的猜想。

摘要:

对于n个点集V⊆R,定义随机图G(V,p),其中每条可能边独立以概率p存在。称子集U可重构,若所有保持G(V,p)边距离的映射也保持U中所有点对距离。本文证明当p=(1+ε)/n时,最大的可重构子集大小约为最大2-核组件大小的(1-o(1))倍,且该界是渐近最优的。

英文摘要:

For a set of $n$ points $V \subseteq \mathbb{R}$ let $G(V, p)$ be the random graph on $V$ where each possible edge is present independently with probability $p$. We call a subset $U \subseteq V$ {\emph {reconstructible}} if every injection $φ:V\to \mathbb{R}$ that preserves the distances along the edges of $G(V, p)$ also preserves all pairwise distances in $U$. How large is the size $\mathsf{R}$ of a largest reconstructible subset? Girão, Illingworth, Michel, Powierski and Scott conjectured that the answer is linear whp when $p = (1+\varepsilon)/n$ for every $\varepsilon > 0$. In this paper, we show that for every $\varepsilon>0$ whp there exists a reconstructible subset $U$ of the largest component $\mathcal{C}$ of the 2-core satisfying $|U| = |V(\mathcal{C})|(1-o(1))$, proving a stronger form of the conjecture. The bound is asymptotically best possible, since for $V \subseteq \mathbb{R}$ linearly independent over $\mathbb{Q}$ it is straightforward to verify that $\mathsf{R} \leq \max(2, |V(\mathcal{C})|)$. Furthermore, we extend these results to every $\varepsilon:= \varepsilon(n)$ satisfying $\varepsilon = ω(1/\ln n)$.

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

↑