Skip to main content
SpringerLink
Log in

The Number of Matrices with Nonzero Permanent Over a Finite Field

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

A new method for obtaining lower bounds on the number of matrices over a finite field with nonzero permanent is developed. Some earlier results are improved.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. V. N. Sachkov and V. E. Tarakanov, Combinatorics of Nonnegative Matrices [in Russian], Scientific Publishers TPV, Moscow (2000).

    MATH  Google Scholar 

  2. L. A. Bassalygo, “On the number of nonzero permanents over a finite field of odd characteristic,” Probl. Inform. Transm., 49, 382–383 (2013).

    Article  MathSciNet  MATH  Google Scholar 

  3. R. A. Brualdi and H. J. Ryser, Combinatorial Matrix Theory, Cambridge Univ. Press (1991).

  4. M. V. Budrevich and A. E. Guterman, “Permanent has less zeros than determinant over finite fields,” Contemp. Math., 579, 33–42 (2012).

    Article  MathSciNet  MATH  Google Scholar 

  5. S. A. Cook, “The complexity of theorem proving procedures,” in: Proc. 3rd Ann. ACM Symp. Theory of Computing (1971), pp. 151–158.

  6. G. Dolinar, A. Guterman, B. Kuzma, and M. Orel, “On the Pólya permanent problem over finite fields”, Eur. J. Comb., 32, 116–132 (2011).

    Article  MATH  Google Scholar 

  7. M. Antónia Duffner, F. Henrique da Cruz, “A relation between the determinant and the permanent on singular matrices,” Linear Algebra Appl., 438, 3654–3660 (2013).

    Article  MathSciNet  MATH  Google Scholar 

  8. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completness, W. H. Freeman (1979).

  9. R. M. Karp, “Reducibility among combinatorial problems”, in: Complexity of Computer Computations, Plenum Press (1972), pp. 85–104.

  10. L. G. Valiant, “The complexity of computing the permanent,” Theor. Comput. Sci., 8, 189–201 (1979).

    Article  MathSciNet  MATH  Google Scholar 

  11. W. McCuaig, “Pólya’s permanent problem,” Electron. J. Combin., 11 (2004), Res. Paper 79.

  12. H. Minc, Permanents (Encycl. Math. Appl., 6), Addison-Wesley Publ. Company (1978).

  13. V. V. Vazirani and M. Yannakakis, “Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs,” Discrete Appl. Math., 25, 179–190 (1989).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lomonosov Moscow State University, Moscow, Russia

    M. V. Budrevich

  2. Moscow Institute of Physics and Technology, Dolgoprudny, Russia

    M. V. Budrevich

Authors
  1. M. V. Budrevich
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. V. Budrevich.

Additional information

Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 463, 2017, pp. 13–24.

Translated by M. V. Budrevich.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Budrevich, M.V. The Number of Matrices with Nonzero Permanent Over a Finite Field. J Math Sci 232, 752–759 (2018). https://doi.org/10.1007/s10958-018-3904-z

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-018-3904-z

Search

Navigation