Skip to main content
SpringerLink
Log in

(0, 1)-matrices with minimal permanents

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

Abstract

It is shown that the permanent of a totally indecomposable (0,1)-matrix is equal to its largest row sum if and only if all its other row sums are 2.

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. F. R. Gantmacher,The Theory of Matrices, Vol. 2, Chelsea, New York, (1959), p. 63.

    MATH  Google Scholar 

  2. D. J. Hartfiel,A simplified form for nearly reducible and nearly decomposable matrices, Proc. Amer. Math. Soc.24 (1970), 388–393.

    Article  MATH  MathSciNet  Google Scholar 

  3. H. Minc,On lower bounds for permanents of (0,1)matrices, Proc. Amer. Math. Soc.22 (1969), 117–123.

    Article  MATH  MathSciNet  Google Scholar 

  4. H. Minc,Nearly decomposable matrices, Linear Algebra and Appl.5 (1972), 181–187.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of California, 93106, Santa Barbara, California, U.S.A.

    Henryk Minc

Authors
  1. Henryk Minc
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported by the U.S. Air Force Office of Scientific Research under Grant AFOSR-72-2164.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Minc, H. (0, 1)-matrices with minimal permanents. Israel J. Math. 15, 27–30 (1973). https://doi.org/10.1007/BF02771770

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02771770

Keywords

Search

Navigation