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

矩阵和超矩阵的迹重建

Trace reconstruction of matrices and hypermatrices

University of Science and Technology of China(中国科学技术大学);Hefei National Laboratory, University of Science and Technology of China(合肥国家实验室,中国科学技术大学)

Wenjie Zhong, Xiande Zhang

AI总结:

本文研究了矩阵和超矩阵的迹重建问题,通过改进的方法证明了更高效的迹数量需求。

摘要:

一个序列的迹是通过以固定概率独立删除每个位生成的。已研究的迹重建问题询问需要多少个迹才能以高概率重建未知的二进制序列。在本文中,我们研究了矩阵和超矩阵的多变量版本,其中迹是通过以恒定概率独立删除矩阵的行/列或超矩阵的切片生成的。此前,Krishnamurthy等人证明了$\exp(\widetilde{O}(n^{d/(d+2)}))$个迹足以重建任何未知的$n\times n$矩阵(对于$d=2$)和任何未知的$n^{\times d}$超矩阵。通过开发一种维度约简程序并建立一个多元版本的Littlewood型结果,我们改进了这个上界,证明了$\exp(\widetilde{O}(n^{3/7}))$个迹足以重建任何未知的$n\times n$矩阵,以及$\exp(\widetilde{O}(n^{3/5}))$个迹足以重建任何未知的$n^{\times d}$超矩阵。这打破了随着维度$d$增长而趋于平凡$\exp(O(n))$的趋势。

英文摘要:

A \emph{trace} of a sequence is generated by deleting each bit of the sequence independently with a fixed probability. The well-studied \emph{trace reconstruction} problem asks how many traces are required to reconstruct an unknown binary sequence with high probability. In this paper, we study the multivariate version of this problem for matrices and hypermatrices, where a trace is generated by deleting each row/column of the matrix or each slice of the hypermatrix independently with a constant probability. Previously, Krishnamurthy et al. showed that $\exp(\widetilde{O}(n^{d/(d+2)}))$ traces suffice to reconstruct any unknown $n\times n$ matrix (for $d=2$) and any unknown $n^{\times d}$ hypermatrix. By developing a dimension reduction procedure and establishing a multivariate version of the Littlewood-type result, we improve this upper bound by showing that $\exp(\widetilde{O}(n^{3/7}))$ traces suffice to reconstruct any unknown $n\times n$ matrix, and $\exp(\widetilde{O}(n^{3/5}))$ traces suffice to reconstruct any unknown $n^{\times d}$ hypermatrix. This breaks the tendency to trivial $\exp(O(n))$ as the dimension $d$ grows.

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

↑