Pages that link to "Item:Q2879417"
From MaRDI portal
The following pages link to IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM (Q2879417):
Displaying 13 items.
- Sylvester-Gallai for arrangements of subspaces (Q728498) (← links)
- Equiangular lines and spherical codes in Euclidean space (Q1692197) (← links)
- Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling (Q1746610) (← links)
- On a conjecture of Kelly on (1, 3)-representation of Sylvester-Gallai designs (Q2134948) (← links)
- A quantitative variant of the multi-colored Motzkin-Rabin theorem (Q2256582) (← links)
- On the number of ordinary lines determined by sets in complex space (Q2415380) (← links)
- Arithmetic Circuits: A Chasm at Depth 3 (Q2816300) (← links)
- SYLVESTER–GALLAI TYPE THEOREMS FOR APPROXIMATE COLLINEARITY (Q2879416) (← links)
- Rank bounds for design matrices with block entries and geometric applications (Q4645030) (← links)
- (Q5002633) (← links)
- A generalized Sylvester–Gallai-type theorem for quadratic polynomials (Q5058240) (← links)
- A generalized sylvester-gallai type theorem for quadratic polynomials (Q5092455) (← links)
- Sylvester-Gallai type theorems for quadratic polynomials (Q5126776) (← links)
