Three-player Number On the Forehead communication may be thought of as a three-player Number In the Hand promise model, in which each player is given the inputs that are supposedly on the other two players' heads, and promised that they are consistent with the inputs of of the other players. The set of all allowed inputs under this promise may be thought of as an order-3 tensor. We surprisingly observe that this tensor is exactly the matrix multiplication tensor, which is widely studied in the design of fast matrix multiplication algorithms. Using this connection, we prove a number of results about both Number On the Forehead communication and matrix multiplication, each by using known results or techniques about the other. For example, we show how the Laser method, a key technique used to design the best matrix multiplication algorithms, can also be used to design communication protocols for a variety of problems. We also show how known lower bounds for Number On the Forehead communication can be used to bound properties of the matrix multiplication tensor such as its zeroing out subrank. Finally, we substantially generalize known methods based on slice-rank for studying communication, and show how they directly relate to the matrix multiplication exponent $\omega$.
翻译:在前台通信中,三玩家编号可能被视为三玩家编号。 在手头承诺模型中,每个玩家都得到假定在另外两个玩家头上的投入,并承诺它们与其他玩家的投入一致。 这个承诺下所有允许投入的一组可能被视为顺序3 - 高度。 我们惊讶地观察到, 这个阵列恰恰是矩阵乘数倍增分数, 在快速矩阵乘数算法的设计中广泛研究过。 使用这个连接, 我们通过使用已知的结果或对其它玩家的技术, 来证明在前台通信和矩阵乘数上的数字都取得了一些结果。 例如, 我们展示了激光法, 用于设计最佳矩阵乘数乘数算法的一种关键技术, 也可以用来设计各种问题的通信协议。 我们还展示了在前台通信中, 已知的数字的下限可以用来约束矩阵乘数倍增数变数的特性, 比如零分位。 最后, 我们大量推广了基于以 美元为单位的列表的已知方法, 来研究通信, 并显示它们与列表数 的反位数 。