## Abstract

We introduce a class of polynomials, which we call *U*-*polynomials*, and show that the problem of explicitly constructing a rigid matrix can be reduced to the problem of explicitly constructing a small hitting set for this class. We prove that small-bias sets are hitting sets for the class of *U*-polynomials, though their size is larger than desired. Furthermore, we give two alternative proofs for the fact that small-bias sets induce rigid matrices.

Finally, we construct rigid matrices from unbalanced expanders, with essentially the same size as the construction via small-bias sets.

## Keywords

Matrix rigidity small-bias sets unbalanced expanders## Subject classification

68Q17 68R05## Preview

Unable to display preview. Download preview PDF.

## References

- N. Alon, J. Bruck, J. Naor, M. Naor & R. Roth (1992a). Construction of Asymptotically Good Low-Rate Error-Correcting Codes through Pseudo-Random Graphs.
*IEEE Transactions on Information Theory***38**, 509–516.Google Scholar - Alon N., Chung F.R.K. (1988) Explicit Construction of Linear Sized Tolerant Networks. Discrete Mathematics
**72**(1): 15–19zbMATHMathSciNetCrossRefGoogle Scholar - Alon N., Goldreich O., Håstad J., Peralta R. (1992) Simple Construction of Almost k-wise Independent Random Variables. Random Structures and Algorithms
**3**(3): 289–304zbMATHMathSciNetCrossRefGoogle Scholar - N. Alon, R. Panigrahy & S. Yekhanin (2009). Deterministic approximation algorithms for the nearest codeword problem. In
*APPROX 09 / RANDOM 09: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques*, 339–351.Google Scholar - Alon N., Roichman Y. (1994) Random Cayley Graphs and Expanders. Random Structures and Algorithms
**5**(2): 271–285zbMATHMathSciNetCrossRefGoogle Scholar - V. Arvind & S. Srinivasan (2010). The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets. In
*Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS)*, 59–70.Google Scholar - A. Ben-Aroya & A. Ta-Shma (2009). Constructing small-bias sets from algebraic-geometric codes. In
*Proceedings of the 50th Annual IEEE symposium on Foundations of Computer science (FOCS)*, 191–197.Google Scholar - Z. Dvir (2010). On Matrix Rigidity and Locally Self-Correctable Codes. In
*Proceedings of the 25th IEEE Conference on Computational Complexity (CCC)*, 291–298.Google Scholar - Friedman J. (1993) A note on matrix rigidity. Combinatorica
**13**(2): 235–239zbMATHMathSciNetCrossRefGoogle Scholar - Guruswami V., Umans C., Vadhan S. (2009) Unbalanced expanders and randomness extractors from Parvaresh–Vardy codes. J. ACM
**56**(4): 1–34MathSciNetCrossRefGoogle Scholar - Hoory S., Linial N., Wigderson A. (2006) Expander Graphs and their Applications. Bulleting of the American Mathematical Society
**43**: 439–561zbMATHMathSciNetCrossRefGoogle Scholar - Kashin B.S., Razborov A.A. (1998) Improved lower bounds on the rigidity of Hadamard matrices. Mathematical Notes
**63**(4): 471–475zbMATHMathSciNetCrossRefGoogle Scholar - S. V. Lokam (1995). Spectral Methods for Matrix Rigidity with Applications to Size-Depth Tradeoffs and Communication Complexity. In
*Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS)*, 6–15.Google Scholar - Lokam S.V. (2009) Complexity Lower Bounds using Linear Algebra. Foundations and Trends in Theoretical Computer Science
**4**(1-2): 1–155zbMATHMathSciNetGoogle Scholar - F. J. MacWilliams & N. J. A. Sloane (1977).
*The Theory of Error-Correcting Codes, Part II*. North-Holland.Google Scholar - Naor J., Naor M. (1993) Small-Bias Probability Spaces: Efficient Constructions and Applications. SIAM J. on Computing
**22**(4): 838–856zbMATHMathSciNetCrossRefGoogle Scholar - R. O’Donnell (2014).
*Analysis of boolean functions*. Cambridge University Press.Google Scholar - Pudlák P., Rödl V. (2004) Pseudorandom sets and explicit constructions of Ramsey graphs. Quad. Mat
**13**: 327–346Google Scholar - Shokrollahi M.A., Spielman D., Stemann V. (1997) A remark on matrix rigidity. Information Processing Letters
**64**(6): 283–285MathSciNetCrossRefGoogle Scholar - L. G. Valiant (1977). Graph-theoretic arguments in low-level complexity. In
*Lecture notes in Computer Science*, volume 53, 162–176. Springer.Google Scholar

## Copyright information

© Springer Basel 2015