arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2307.04441cs.CCcs.DMcs.DS
收藏

小符号秩矩阵与图上的随机通信与隐式表示

Randomized Communication and Implicit Representations for Matrices and Graphs of Small Sign-Rank

Nathaniel Harms, Viktor Zamaraev

AI总结:

本文刻画了符号秩为3矩阵和单位圆盘图具有常数随机通信复杂度的结构条件,即不编码任意大的 Greater-Than 问题或不含任意大半图作为半导出子图,并由此证明了这些图的隐式表示存在性。

摘要:

我们证明了符号秩为3的矩阵和单位圆盘图(UDGs)上允许常数代价公共随机通信协议的结构条件刻画。因此,在这些条件下,这些图也承认隐式表示。矩阵 $M \in \{\pm 1\}^{N \times N}$ 的符号秩是满足对所有 $i,j \in [N]$ 都有 $M_{i,j} = \mathrm{sign}(R_{i,j})$ 的矩阵 $R$ 的最小秩;等价地,它是 $M$ 能被表示为点-半空间关联矩阵且半空间经过原点的最小维数 $d$,并且它本质上等价于无界误差通信复杂度。符号秩为3的矩阵可以达到最大可能的有界误差随机通信复杂度 $Θ(\log N)$,同时自至少2003年以来,有界符号秩图(包括符号秩为4的单位圆盘图)的隐式表示是否存在一直悬而未决。我们证明,符号秩为3的矩阵以及单位圆盘图具有常数随机通信复杂度当且仅当它们不编码任意大的 Greater-Than 通信问题实例,或者等价地,当且仅当它们不包含任意大的半图作为半导出子图。这也在相同条件下确立了这些图隐式表示的存在性。

英文摘要:

We prove a characterization of the structural conditions on matrices of sign-rank 3 and unit disk graphs (UDGs) which permit constant-cost public-coin randomized communication protocols. Therefore, under these conditions, these graphs also admit implicit representations. The sign-rank of a matrix $M \in \{\pm 1\}^{N \times N}$ is the smallest rank of a matrix $R$ such that $M_{i,j} = \mathrm{sign}(R_{i,j})$ for all $i,j \in [N]$; equivalently, it is the smallest dimension $d$ in which $M$ can be represented as a point-halfspace incidence matrix with halfspaces through the origin, and it is essentially equivalent to the unbounded-error communication complexity. Matrices of sign-rank 3 can achieve the maximum possible bounded-error randomized communication complexity $Θ(\log N)$, and meanwhile the existence of implicit representations for graphs of bounded sign-rank (including UDGs, which have sign-rank 4) has been open since at least 2003. We prove that matrices of sign-rank 3, and UDGs, have constant randomized communication complexity if and only if they do not encode arbitrarily large instances of the Greater-Than communication problem, or, equivalently, if they do not contain arbitrarily large half-graphs as semi-induced subgraphs. This also establishes the existence of implicit representations for these graphs under the same conditions.

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

↑