Skip to main content

Determinant versus Permanent: Salvation via Generalization?

  • Conference paper
The Nature of Computation. Logic, Algorithms, Applications (CiE 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7921))

Included in the following conference series:

Abstract

The fermionant \({\rm Ferm}^k_n(\bar x) = \sum_{\sigma \in S_n} (-k)^{c(\pi)}\prod_{i=1}^n x_{i,j}\) can be seen as a generalization of both the permanent (for k = − 1) and the determinant (for k = 1). We demonstrate that it is \(\textsc{VNP}\)-complete for any rational k ≠ 1. Furthermore it is #P-complete for the same values of k. The immanant is also a generalization of the permanent (for a Young diagram with a single line) and of the determinant (when the Young diagram is a column). We demonstrate that the immanant of any family of Young diagrams with bounded width and at least n ε boxes at the right of the first column is \(\textsc{VNP}\)-complete.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brylinski, J.-L., Brylinski, R.: Complexity and Completeness of Immanants. CoRR, cs.CC/0301024 (2003)

    Google Scholar 

  2. Bürgisser, P.: Completeness and Reduction in Algebraic Complexity Theory. Springer (2000)

    Google Scholar 

  3. Chandrasekharan, S., Wiese, U.-J.: Partition Functions of Strongly Correlated Electron Systems as ”Fermionants”. ArXiv e-prints (August 2011)

    Google Scholar 

  4. de Rugy-Altherre, N.: A dichotomy theorem for homomorphism polynomials, pp. 308–322 (2012)

    Google Scholar 

  5. Greene, C.: A rational-function identity related to the Murnaghan-Nakayama formula for the characters of Sn. J. Algebraic Comb. 1(3), 235–255 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  6. Littlewood, D.E.: The theory of group characters and matrix representations of groups. The Clarendon Press (1940)

    Google Scholar 

  7. Mertens, S., Moore, C.: The complexity of the fermionant, and immanants of constant width. ArXiv e-prints (October 2011)

    Google Scholar 

  8. Poizat, B.: À la recherche de la définition de la complexité d’espace pour le calcul des polynômes à la manière de valiant. Journal of Symbolic Logic 73 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Rugy-Altherre, N. (2013). Determinant versus Permanent: Salvation via Generalization?. In: Bonizzoni, P., Brattka, V., Löwe, B. (eds) The Nature of Computation. Logic, Algorithms, Applications. CiE 2013. Lecture Notes in Computer Science, vol 7921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39053-1_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39053-1_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39052-4

  • Online ISBN: 978-3-642-39053-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics