Advertisement

Determinant: Old algorithms, new insights

Extended abstract
  • Meena Mahajan
  • V. Vinay
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1432)

Abstract

In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of the coefficients of the characteristic polynomial, in terms of walks and closed walks of different kinds in the underlying graph. We develop algorithms based on these characterizations, and show that they tally with well-known algorithms arrived at independently from considerations in linear algebra.

Keywords

Characteristic Polynomial Tour Sequence Combinatorial Proof Combinatorial Interpretation Matrix Power 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Ber84]
    S. J. Berkowitz. On computing the determinant in small parallel time using a small number of processors. Information Processing Letters, 18:147–150, 1984.zbMATHCrossRefMathSciNetGoogle Scholar
  2. [Cha82]
    S. Chaiken. A combinatorial proof of the all minors matrix theorem. SIAM J. Algebraic Discrete Methods, 3:319–329, 1982.zbMATHMathSciNetGoogle Scholar
  3. [Chi85]
    A. L. Chistov. Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic. In Proc Int. Conf. Foundations of Computation Theory, LNCS 199, pages 63–69. Springer, 1985.Google Scholar
  4. [Csa76]
    L. Csanky. Fast parallel inversion algorithm. SIAM J of Computing, 5:818–823, 1976.MathSciNetGoogle Scholar
  5. [Dam91]
    C. Damm. DET=L(#L). Technical Report Informatik-Preprint 8, Fachbereich Informatik der Humboldt-UniversitÄt zu Berlin, 1991.Google Scholar
  6. [FF63]
    D. Fadeev and V. Fadeeva. Computational Methods in Linear Algebra. Freeman, San Francisco, 1963.Google Scholar
  7. [Foa65]
    D. Foata. Etude algébrique de certains problèmes d'analyse combinatoire et du calcul des probabilités. Publ. Inst. Statist. Univ. Paris, 14:81–241, 1965.zbMATHMathSciNetGoogle Scholar
  8. [Foa80]
    D. Foata. A combinatorial proof of Jacobi's identity. Ann. Discrete Math., 6:125–135, 1980.zbMATHMathSciNetCrossRefGoogle Scholar
  9. [GE]
    A. Garsia and ö. Egecioglu. Combinatorial foundations of computer science. unpublished collection.Google Scholar
  10. [Ges79]
    I. Gessel. Tournaments and Vandermonde's determinant. J Graph Theory, 3:305–307, 1979.zbMATHMathSciNetGoogle Scholar
  11. [Koz92]
    D. Kozen. The Design and Analysis of Algorithms. Springer-Verlag, New York, 1992.Google Scholar
  12. [Lei92]
    T. F. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers Inc., San Mateo, 1992.zbMATHGoogle Scholar
  13. [Min97]
    M. Minoux. Bideterminants, arborescences and extension of the matrix-tree theorem to semirings. Discrete Mathematics, 171:191–200, 1997.zbMATHCrossRefMathSciNetGoogle Scholar
  14. [MV97]
    M. Mahajan and V Vinay. Determinant: combinatorics, algorithms, complexity. Chicago Journal of Theoretical Computer Science http://cs-www.uchicago.edu/publications/cjtcs, 1997:5, 1997. A preliminary version appeared as “A combinatorial algorithm for the determinant” in Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms SODA97.MathSciNetGoogle Scholar
  15. [Orl78]
    J. B. Orlin. Line-digraphs, arborescences, and theorems of Tutte and Knuth. J. Combin. Theory Ser. B, 25:187–198, 1978.zbMATHCrossRefMathSciNetGoogle Scholar
  16. [Sam42]
    P. A. Samuelson. A method of determining explicitly the coefficients of the characteristic polynomial. Ann. Math. Stat., 13:424–429, 1942.zbMATHMathSciNetGoogle Scholar
  17. [Str73]
    V. Strassen. Vermeidung von divisionen. Journal of Reine U. Angew Math, 264:182–202, 1973.MathSciNetGoogle Scholar
  18. [Str83]
    H. Straubing. A combinatorial proof of the Cayley-Hamilton theorem. Discrete Maths., 43:273–279, 1983.zbMATHCrossRefMathSciNetGoogle Scholar
  19. [SW86]
    D. Stanton and D. White. Constructive Combinatorics. Springer-Verlag, 1986.Google Scholar
  20. [Tem81]
    H. N. V. Tempereley. Graph Theory and Applications. Ellis Horwood, Chichester, 1981.Google Scholar
  21. [Tod91]
    S. Toda. Counting problems computationally equivalent to the determinant. manuscript, 1991.Google Scholar
  22. [Val92]
    L. G. Valiant. Why is boolean complexity theory difficult? In M. S. Paterson, editor, Boolean Function Complexity. Cambridge University Press, 1992. London Mathematical Society Lecture Notes Series 169.Google Scholar
  23. [Vin91]
    V Vinay. Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. In Proc. 6th Structure in Complexity Theory Conference, pages 270–284, 1991.Google Scholar
  24. [Zei85]
    D. Zeilberger. A combinatorial approach to matrix algebra. Discrete Mathematics, 56:61–72, 1985.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Meena Mahajan
    • 1
  • V. Vinay
    • 2
  1. 1.Institute of Mathematical SciencesChennaiIndia
  2. 2.Department of Computer Science and AutomationIndian Institute of ScienceBangaloreIndia

Personalised recommendations