Abstract
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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Noga Alon, Amos Beimel, Shay Moran & Uri Stemmer (2020). Closure properties for private classification and online prediction. In COLT, 119–152.
Kazuyuki Amano (2020). On the size of depth-two threshold circuits for the inner product mod 2 function. In LATA, 235–247.
Béla Bollobás, Paul Erdős, Joel Spencer & Douglas B West (1993). Clique coverings of the edges of a random graph. Combinatorica 13(1), 1–5.
Paul Erdös, Adolph W Goodman & Louis Pósa (1966). The representation of a graph by set intersections. Canadian Journal of Mathematics 18, 106–112.
Alan Frieze & Bruce Reed (1995). Covering the edges of a random graph by cliques. Combinatorica 15(4), 489–497.
Badih Ghazi, Noah Golowich, Ravi Kumar & Pasin Manurangsi (2021). Near-tight closure bounds for the Littlestone and threshold dimensions. In ALT, 686–696.
Ronald L Graham & Henry O Pollak (1971). On the addressing problem for loop switching. The Bell system technical journal 50(8), 2495–2519.
David A Gregory & Norman J Pullman (1982). On a clique covering problem of Orlin. Discrete Mathematics 41(1), 97–99.
András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy & György Turán (1993). Threshold circuits of bounded depth. Journal of Computer and System Sciences 46(2), 129–154.
Lianna Hambardzumyan, Hamed Hatami & Pooya Hatami (2023). Dimension-free bounds and structural results in communication complexity. Israel Journal of Mathematics 253(2), 555–616.
Stasys Jukna (2006). On graph complexity. Combinatorics, Probability and Computing 15(6), 855–876.
Daniel M Kane & Ryan Williams (2016). Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits. In STOC, 633–643.
Stanisław Kwapień & Aleksander Pełczyński (1970). The main triangle projection in matrix spaces and its applications. Studia Mathematica 34(1), 43–67.
Meena Mahajan (2019). Depth-2 threshold circuits. Resonance 24(3), 371–380.
James Orlin (1977). Contentment in graph theory: covering graphs with cliques. In Indagationes Mathematicae, volume 80, 406–424.
Ramamohan Paturi & Michael E Saks (1994). Approximating threshold circuits by rational functions. Information and Computation 112(2), 257–272.
Toniann Pitassi, Morgan Shirley & Adi Shraibman (2023). The strength of equality oracles in communication. In ITCS. Schloss Dagstuhl-Leibniz-Zentrum für Informatik.
Pavel Pudlák & Vojtech Rödl (1994). Some combinatorialalgebraic problems from complexity theory. Discrete Mathematics 1(136), 253–279.
Vwani Roychowdhury, Kai-Yeung Siu & Alon Orlitsky (1994). Neural models and spectral methods. In Theoretical Advances in Neural Computation and Learning, 3–36. Springer.
Richard RyanWilliams (2018). Limits on representing boolean functions by linear combinations of simple functions: thresholds, reLUs, and low-degree polynomials. In CCC, 1–24.
Funding
Open access funding provided by Technion - Israel Institute of Technology.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Avraham, D., Yehudayoff, A. On Blocky Ranks Of Matrices. comput. complex. 33, 2 (2024). https://doi.org/10.1007/s00037-024-00248-1
Received:
Published:
DOI: https://doi.org/10.1007/s00037-024-00248-1