DeepAI AI Chat
Log In Sign Up

Rigid Matrices From Rectangular PCPs

by   Amey Bhangale, et al.

We introduce a variant of PCPs, that we refer to as rectangular PCPs, wherein proofs are thought of as square matrices, and the random coins used by the verifier can be partitioned into two disjoint sets, one determining the row of each query and the other determining the *column*. We construct PCPs that are efficient, short, smooth and (almost-)rectangular. As a key application, we show that proofs for hard languages in NTIME(2^n), when viewed as matrices, are rigid infinitely often. This strengthens and considerably simplifies a recent result of Alman and Chen [FOCS, 2019] constructing explicit rigid matrices in FNP. Namely, we prove the following theorem: - There is a constant δ∈ (0,1) such that there is an FNP-machine that, for infinitely many N, on input 1^N outputs N × N matrices with entries in 𝔽_2 that are δ N^2-far (in Hamming distance) from matrices of rank at most 2^log N/Ω(loglog N). Our construction of rectangular PCPs starts with an analysis of how randomness yields queries in the Reed–Muller-based outer PCP of Ben-Sasson, Goldreich, Harsha, Sudan and Vadhan [SICOMP, 2006; CCC, 2005]. We then show how to preserve rectangularity under PCP composition and a smoothness-inducing transformation. This warrants refined and stronger notions of rectangularity, which we prove for the outer PCP and its transforms.


page 1

page 2

page 3

page 4


The rank of sparse random matrices

Generalising prior work on the rank of random matrices over finite field...

Recent Progress on Matrix Rigidity – A Survey

The concept of matrix rigidity was introduced by Valiant(independently b...

Distance Estimation Between Unknown Matrices Using Sublinear Projections on Hamming Cube

Using geometric techniques like projection and dimensionality reduction,...

Fourier and Circulant Matrices are Not Rigid

The concept of matrix rigidity was first introduced by Valiant in [Val77...

The rank of random matrices over finite fields

We determine the rank of a random matrix A over a finite field with pres...

On the structure of matrices avoiding interval-minor patterns

We study the structure of 01-matrices avoiding a pattern P as an interva...

Matrix rigidity and the Croot-Lev-Pach lemma

Matrix rigidity is a notion put forth by Valiant as a means for proving ...