arXiv 1306.18772013-06cs.CCmath.CO

Communication is bounded by root of rank

Shachar Lovett

英文摘要：

We prove that any total boolean function of rank $r$ can be computed by a deterministic communication protocol of complexity $O(\sqrt{r} \cdot \log(r))$. Equivalently, any graph whose adjacency matrix has rank $r$ has chromatic number at most $2^{O(\sqrt{r} \cdot \log(r))}$. This gives a nearly quadratic improvement in the dependence on the rank over previous results.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

The square root rank of the correlation polytope is exponential

The square root rank of a nonnegative matrix $A$ is the minimum rank of a matrix $B$ such that $A=B \circ B$, where $\circ$ denotes entrywise product. We show that the square root rank of the slack matrix of the correlation polytope is exponential. Our main technique is a way to lower bound the rank of certain matrices under arbitrary sign changes of the entries using properties of the roots of polynomials in number fields. The square root rank is an upper bound on the positive semidefinite rank of a matrix, and corresponds the special case where all matrices in the factorization are rank-one.

2014-11-25cs.CCmath.COmath.OC

The tensor rank of 5x5 matrices multiplication is bounded by 98 and its border rank by 89

We present a non-commutative algorithm for the product of 3x5 by 5x5 matrices using 58 multiplications. This algorithm allows to construct a non-commutative algorithm for multiplying 5x5 (resp. 10x10, 15x15) matrices using 98 (resp. 686, 2088) multiplications. Furthermore, we describe an approximate algorithm that requires 89 multiplications and computes this product with an arbitrary small error.

2021-02-01cs.CC

关于有界秩矩阵的线性空间

On Linear spaces of of matrices bounded rank

受理论计算机科学和量子信息理论启发，本文研究有界秩矩阵线性空间的经典问题，首次给出两个有界秩四的非经典空间实例，并完成基本有界秩四空间的完整分类（同构意义下共四个），同时整合了线性代数与代数几何的研究方法。

2023-06-26cs.CCmath.AG

Geometric Rank and Linear Determinantal Varieties

There are close relations between tripartite tensors with bounded geometric ranks and linear determinantal varieties with bounded codimensions. We study linear determinantal varieties with bounded codimensions, and prove upper bounds of the dimensions of the ambient spaces. Using those results, we classify tensors with geometric rank 3, find upper bounds of multilinear ranks of primitive tensors with geometric rank 4, and prove the existence of such upper bounds in general. We extend results of tripartite tensors to n-part tensors, showing the equivalence between geometric rank 1 and partition…

2022-11-28cs.CCmath.AG

Characterizing Polytopes Contained in the $0/1$-Cube with Bounded Chvátal-Gomory Rank

Let $S \subseteq \{0,1\}^n$ and $R$ be any polytope contained in $[0,1]^n$ with $R \cap \{0,1\}^n = S$. We prove that $R$ has bounded Chvátal-Gomory rank (CG-rank) provided that $S$ has bounded notch and bounded gap, where the notch is the minimum integer $p$ such that all $p$-dimensional faces of the $0/1$-cube have a nonempty intersection with $S$, and the gap is a measure of the size of the facet coefficients of $\mathsf{conv}(S)$. Let $H[\bar{S}]$ denote the subgraph of the $n$-cube induced by the vertices not in $S$. We prove that if $H[\bar{S}]$ does not contain a subdivision of a large …

2017-11-07cs.CCcs.DMmath.OC