Home

# Inequalities for permanents and permanental minors

## Extract

Let Ωn denote the convex set of all n × n doubly stochastic matrices: chat is, the set of all n × n matrices with non-negative entries and row and column sums 1. If A = (aij) is an arbitrary n × n matrix, then the permanent of A is the scalar valued function of A defined by

where the subscripts i1, i2, …, in run over all permutations of 1, 2, …, n. The permanent function has been studied extensively of late (see, for example, (1), (2), (3), (4), (6)) and it is known that if A ∈ Ωn then 0 < cn ≤ per (A) ≤ 1, where the constant cn depends only on n. It is natural to inquire if per (A) is a convex function of A for A ∈ Ωn. That this is not the case was shown by a counter-example given by Marcus and quoted by Perfect in her paper ((5)). In this paper, however, she shows that per (½I + ½A) ≤ ½ + ½ per (A) for all A ∈ Ωn. Here I = In is the identity matrix of order n.

## References

Hide All
(1)Marcus, H. and Minc, H.A survey of matrix theory and matrix inequalities (Allyn and Bacon; Boston, 1964).
(2)Marcus, M. and Newman, M.Inequalities for the permanent function. Ann. of Math. 75 (1962), 4762.
(3)Marcus, M. and Newman, M.On the minimum of the permanent of a doubly stochastic matrix. Duke Math. J. 26 (1959), 6172.
(4)Marcus, M. and Gordon, W. R.Inequalities for subpermanents. Illinois J. Math. 8 (1964), 607614.
(5)Perfect, H.An inequality for the permanent function. Proc. Cambridge Philos. Soc. 60 (1964), 10301031.
(6)Ryser, H. J.Combinatorial mathematics. Garus Math. Monograph, no. 14 (Wiley; New York, 1963).

## Metrics

### Full text viewsFull text views reflects the number of PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 0 *