On Blocky Ranks Of Matrices

被引:0
|
作者
Avraham, Daniel [1 ]
Yehudayoff, Amir [1 ,2 ]
机构
[1] Technion IIT, Dept Math, Hefa, Israel
[2] Univ Copenhagen, Dept Comp Sci, Copenhagen, Denmark
关键词
Communication complexity; matrix rank; threshold circuits; fat matchings; THRESHOLD CIRCUITS; GRAPH; DEPTH-2; EDGES;
D O I
10.1007/s00037-024-00248-1
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A matrix is blocky if it is a "blowup" of a permutation matrix. The blocky rank of a matrix M is the minimum number of blocky matrices that linearly span M. Hambardzumyan, Hatami and Hatami defined blocky rank and showed that it is connected to communication complexity and operator theory. We describe additional connections to circuit complexity and combinatorics, and we prove upper and lower bounds on blocky rank in various contexts.
引用
收藏
页数:18
相关论文
共 50 条