Low-rank matrices, tournaments, and symmetric designs

DOI10.1016/j.laa.2024.04.006zbMATH Open1539.05071MaRDI QIDQ6541328

Niranjan Balachandran, Brahadeesh Sankarnarayanan

Publication date: 17 May 2024

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

symmetric designmultiplicitybipartite graphranktournament

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Extremal set theory (05D05) Other designs, configurations (05B30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random matrices (algebraic aspects) (15B52) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Eigenvalue multiplicity in triangle-free graphs
• Random matrices have simple spectrum
• Fractional \(L\)-intersecting families
• An ensemble of high rank matrices arising from tournaments
• Modular and fractional \(L\)-intersecting families of vector spaces
• Hadamard's determinant theorem and the sum of four squares
• On hierarchically closed fractional intersecting families
• Almost full rank matrices arising from transitive tournaments

This page was built for publication: Low-rank matrices, tournaments, and symmetric designs