6 papers
Low-Degree Testing Over Boolean Slices
Prashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan +2
We study low-degree testing for group-valued functions over a Boolean slice. Specifically given a degree parameter and oracle access to a function wher…
A Simple Algebraic Proof of the PCP Theorem
Prashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan +2
We give the simplest known algebraic proof of the PCP theorem, involving only ingredients like code concatenation, polynomial interpolation, and polynomial multiplication. Specific…
Ideals, Macaulay Bases, and PCPs
Prashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan +2
All known proofs of the PCP theorem rely on multiple "composition" steps, where PCPs over large alphabets are turned into PCPs over much smaller alphabets at a (relatively) small p…
Eigenvalue Bounds for Symmetric Markov Chains on Multislices With Applications
Prashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan +1
We consider random walks on ``balanced multislices'' of any ``grid'' that respects the ``symmetries'' of the grid, and show that a broad class of such walks are good spectral expan…
A Near-Optimal Polynomial Distance Lemma Over Boolean Slices
Prashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan +1
The celebrated Ore-DeMillo-Lipton-Schwartz-Zippel (ODLSZ) lemma asserts that n-variate non-zero polynomial functions of degree d over a field are non-zero over any "gr…
Low Degree Local Correction Over the Boolean Cube
Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar +2
In this work, we show that the class of multivariate degree- polynomials mapping to any Abelian group is locally correctable with $\widetilde{O}_{d}((\log n)^{…