3 papers
cs.CC2025
An exposition of recent list-size bounds of FRS Codes
Abhibhav Garg, Prahladh Harsha, Mrinal Kumar +2
In the last year, there have been some remarkable improvements in the combinatorial list-size bounds of Folded Reed Solomon codes and multiplicity codes. Starting from the work on…
cs.DM2022
Robust Radical Sylvester-Gallai Theorem for Quadratics
Abhibhav Garg, Rafael Oliveira, Akash Sengupta
We prove a robust generalization of a Sylvester-Gallai type theorem for quadratic polynomials, generalizing the result in [S'20]. More precisely, given a parameter an…
cs.CC2020
Special-case Algorithms for Blackbox Radical Membership, Nullstellensatz and Transcendence Degree
Abhibhav Garg, Nitin Saxena
Radical membership testing, and the special case of Hilbert's Nullstellensatz (HN), is a fundamental computational algebra problem. It is NP-hard; and has a famous PSPACE algorithm…