New permanent approximation inequalities via identities
From MaRDI portal
(Redirected from Publication:779828)
Abstract: The aim of this paper is to present new upper bounds for the distance between a properly normalized permanent of a rectangular complex matrix and the product of the arithmetic means of the entries of its columns. It turns out that the bounds improve on those from earlier work. Our proofs are based on some new identities for the above-mentioned differences and also for related expressions for matrices over a rational associative commutative unital algebra. Some of our identities are generalizations of results in Dougall (Proceedings of the Edinburgh Mathematical Society, 24, 61-77, 1905). Second order results are also included.
Recommendations
Cites work
- scientific article; zbMATH DE number 3182201 (Why is no real title available?)
- scientific article; zbMATH DE number 3458807 (Why is no real title available?)
- scientific article; zbMATH DE number 3621932 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 3012708 (Why is no real title available?)
- scientific article; zbMATH DE number 3073200 (Why is no real title available?)
- A note on the variation of permanents
- A permanent formula with many zero-valued terms
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
- A remark on the variation of permanents
- An inequality of Hadamard type for permanents
- Computing the permanent of (some) complex matrices
- Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices
- Evaluation of permanents in rings and semirings
- Generalized symmetric polynomials and an approximate de Finetti representation
- Multilinear forms of Hilbert type and some other distinguished forms
- On Bobkov's approximate de Finetti representation via approximation of permanents of complex rectangular matrices
- On the variation of permanents
- Proof of the Monotone Column Permanent Conjecture
- Some identities between arithmetic means and the other elementary symmetric functions of \(n\) numbers
- The complexity of computing the permanent
- The permanent of a square matrix
- Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
- Variation of symmetric tensor powers and permanents
Cited in
(5)- On the accuracy in a combinatorial central limit theorem: the characteristic function method
- Matrix permanent inequalities for approximating joint assignment matrices in tracking systems
- On Bobkov's approximate de Finetti representation via approximation of permanents of complex rectangular matrices
- On the variation of permanents
- The permanent of a square matrix
This page was built for publication: New permanent approximation inequalities via identities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q779828)