Advertisement

Foundations of Computational Mathematics

, Volume 16, Issue 3, pp 599–635 | Cite as

Complexity of Linear Circuits and Geometry

  • Fulvio Gesmundo
  • Jonathan D. Hauenstein
  • Christian Ikenmeyer
  • J. M. LandsbergEmail author
Article
  • 243 Downloads

Abstract

We use algebraic geometry to study matrix rigidity and, more generally, the complexity of computing a matrix–vector product, continuing a study initiated in Kumar et al. (2009), Landsberg et al. (preprint). In particular, we (1) exhibit many non-obvious equations testing for (border) rigidity, (2) compute degrees of varieties associated with rigidity, (3) describe algebraic varieties associated with families of matrices that are expected to have super-linear rigidity, and (4) prove results about the ideals and degrees of cones that are of interest in their own right.

Keywords

Matrix rigidity Discrete Fourier transform Vandermonde matrix Cauchy matrix 

Mathematics Subject Classification

68Q17 15B05 65T50 

Notes

Acknowledgments

We thank the anonymous referees for very careful reading and numerous useful suggestions.

References

  1. 1.
    Paolo Aluffi, Degrees of projections of rank loci, preprint arXiv:1408.1702.
  2. 2.
    E. Arbarello, M. Cornalba, P. A. Griffiths, and J. Harris, Geometry of algebraic curves. Vol. I, Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 267, Springer-Verlag, New York, 1985.Google Scholar
  3. 3.
    Bruno Codenotti, Matrix rigidity, Linear Algebra Appl. 304 (2000), no. 1–3, 181–192.MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Ronald de Wolf, Lower bounds on matrix rigidity via a quantum argument, Automata, languages and programming. Part I, Lecture Notes in Comput. Sci., vol. 4051, Springer, Berlin, 2006, pp. 62–71.Google Scholar
  5. 5.
    Zeev Dvir, On matrix rigidity and locally self-correctable codes, Comput. Complexity 20 (2011), no. 2, 367–388.MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Joel Friedman, A note on matrix rigidity, Combinatorica 13 (1993), no. 2, 235–239.MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    William Fulton, Intersection theory, second ed., Ergebnisse der Mathematik und ihrer Grenzgebiete. 3. Folge. A Series of Modern Surveys in Mathematics [Results in Mathematics and Related Areas. 3rd Series. A Series of Modern Surveys in Mathematics], vol. 2, Springer-Verlag, Berlin, 1998.Google Scholar
  8. 8.
    William Fulton and Joe Harris, Representation theory, Graduate Texts in Mathematics, vol. 129, Springer-Verlag, New York, 1991, A first course, Readings in Mathematics.Google Scholar
  9. 9.
    Joe Harris, Algebraic geometry, Graduate Texts in Mathematics, vol. 133, Springer-Verlag, New York, 1995, A first course, Corrected reprint of the 1992 original.Google Scholar
  10. 10.
    B. S. Kashin and A. A. Razborov, New lower bounds for the stability of Hadamard matrices, Mat. Zametki 63 (1998), no. 4, 535–540.MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, and Jayalal Sarma M. N., Using elimination theory to construct rigid matrices, Foundations of software technology and theoretical computer science—FSTTCS 2009, LIPIcs. Leibniz Int. Proc. Inform., vol. 4, Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2009, pp. 299–310.Google Scholar
  12. 12.
    J. M. Landsberg, Tensors: geometry and applications, Graduate Studies in Mathematics, vol. 128, American Mathematical Society, Providence, RI, 2012.Google Scholar
  13. 13.
    J. M. Landsberg, J. Taylor, and N. K. Vishnoi, The geometry of matrix rigidity (preprint). https://smartech.gatech.edu/handle/1853/6514.
  14. 14.
    F. Thomson Leighton, Introduction to parallel algorithms and architectures, Morgan Kaufmann, San Mateo, CA, 1992, Arrays, trees, hypercubes.Google Scholar
  15. 15.
    Satyanarayana V. Lokam, On the rigidity of Vandermonde matrices, Theoret. Comput. Sci. 237 (2000), no. 1-2, 477–483.MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Satyanarayana V. Lokam, Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity, J. Comput. System Sci. 63 (2001), no. 3, 449–473.MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Satyanarayana V. Lokam, Quadratic lower bounds on matrix rigidity, Theory and applications of models of computation, Lecture Notes in Comput. Sci., vol. 3959, Springer, Berlin, 2006, pp. 295–307.Google Scholar
  18. 18.
    Satyanarayana V. Lokam, Complexity lower bounds using linear algebra, Found. Trends Theor. Comput. Sci. 4 (2008), no. 1-2, front matter, 1–155 (2009).Google Scholar
  19. 19.
    Meena Mahajan and Jayalal Sarma M. N., Rigidity of a simple extended lower triangular matrix, Inform. Process. Lett. 107 (2008), no. 5, 149–153.MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    David Mumford, Algebraic geometry. I, Classics in Mathematics, Springer-Verlag, Berlin, 1995, Complex projective varieties, Reprint of the 1976 edition.Google Scholar
  21. 21.
    David Mumford, The red book of varieties and schemes, expanded ed., Lecture Notes in Mathematics, vol. 1358, Springer-Verlag, Berlin, 1999, Includes the Michigan lectures (1974) on curves and their Jacobians, With contributions by Enrico Arbarello.Google Scholar
  22. 22.
    Nicholas Pippenger, Superconcentrators, SIAM J. Comput. 6 (1977), no. 2, 298–304.MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Pavel Pudlák and Zdeněk Vavřín, Computation of rigidity of order \(n^2/r\) for one simple matrix, Comment. Math. Univ. Carolin. 32 (1991), no. 2, 213–218.MathSciNetzbMATHGoogle Scholar
  24. 24.
    M. A. Shokrollahi, D. A. Spielman, and V. Stemann, A remark on matrix rigidity, Inform. Process. Lett. 64 (1997), no. 6, 283–285.MathSciNetCrossRefGoogle Scholar
  25. 25.
    Richard P. Stanley, Enumerative combinatorics. Volume 1, second ed., Cambridge Studies in Advanced Mathematics, vol. 49, Cambridge University Press, Cambridge, 2012.Google Scholar
  26. 26.
    Harry Tamvakis, The connection between representation theory and Schubert calculus, Enseign. Math 50 (2004), no. 3-4, 267–286.MathSciNetzbMATHGoogle Scholar
  27. 27.
    Leslie G. Valiant, Graph-theoretic arguments in low-level complexity, Mathematical foundations of computer science (Proc. Sixth Sympos., Tatranská Lomnica, 1977), Springer, Berlin, 1977, pp. 162–176. Lecture Notes in Comput. Sci., Vol. 53.Google Scholar

Copyright information

© SFoCM 2015

Authors and Affiliations

  • Fulvio Gesmundo
    • 1
  • Jonathan D. Hauenstein
    • 2
  • Christian Ikenmeyer
    • 1
  • J. M. Landsberg
    • 1
    Email author
  1. 1.Texas A&M UniversityCollege StationUSA
  2. 2.University of Notre DameNotre DameUSA

Personalised recommendations