From sylvester-gallai configurations to rank bounds

DOI10.1145/2528403zbMath1281.68231OpenAlexW2059084795MaRDI QIDQ5395729

Nitin Saxena, C. Seshadhri

Publication date: 17 February 2014

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2528403

zbMATH Keywords

identitiescombinatorial designincidence geometrySylvester-Gallaiideal theoryChinese remainderingdepth-3 circuit

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Randomized algorithms (68W20)

Related Items

On a conjecture of Kelly on (1, 3)-representation of Sylvester-Gallai designs ⋮ Sylvester-Gallai type theorems for quadratic polynomials ⋮ Read-once polynomial identity testing ⋮ Unnamed Item ⋮ A generalized sylvester-gallai type theorem for quadratic polynomials ⋮ Unnamed Item ⋮ Univariate ideal membership parameterized by rank, degree, and number of generators ⋮ Improved hitting set for orbit of ROABPs ⋮ Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits ⋮ IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM