Rank bounds for design matrices with block entries and geometric applications

DOI10.19086/da.3118zbMath1404.52017arXiv1610.08923OpenAlexW2962763948WikidataQ129736655 ScholiaQ129736655MaRDI QIDQ4645030

No author found.

Publication date: 9 January 2019

Published in: Discrete Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.08923

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Special Riemannian manifolds (Einstein, Sasakian, etc.) (53C25) Erd?s problems and related topics of discrete geometry (52C10)

Related Items (4)

On a conjecture of Kelly on (1, 3)-representation of Sylvester-Gallai designs ⋮ Configurations of lines in space and combinatorial rigidity ⋮ Unnamed Item ⋮ Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling

Cites Work

• The Hesse pencil of plane cubic curves
• Scalings of matrices which have prespecified row sums and column sums via optimization
• Classical complexity and quantum entanglement
• The Brascamp-Lieb inequalities: Finiteness, structure and extremals
• On graphs and rigidity of plane skeletal structures
• IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM
• A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
• Unnamed Item
• Unnamed Item

This page was built for publication: Rank bounds for design matrices with block entries and geometric applications