New permanent approximation inequalities via identities

DOI10.1007/S10986-020-09475-9zbMATH Open1451.15006arXiv1612.03702OpenAlexW3007731457MaRDI QIDQ779828FDOQ779828

Authors: B. Roos 

Publication date: 14 July 2020

Published in: Lithuanian Mathematical Journal (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1612.03702

Recommendations

• scientific article; zbMATH DE number 221380
• A stability result using the matrix norm to bound the permanent
• A note on the variation of permanents
• An inequality of Hadamard type for permanents
• Extending the minc-brègman upper bound for the permanent

zbMATH Keywords

elementary symmetric polynomialsapproximation of normalized permanentsexpansions for permanentspermanental inequalities

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Combinatorial identities, bijective combinatorics (05A19) Miscellaneous inequalities involving matrices (15A45) Combinatorial inequalities (05A20)

Cites Work

• Title not available (Why is that?)
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
• Title not available (Why is that?)
• The complexity of computing the permanent
• Title not available (Why is that?)
• Computing the permanent of (some) complex matrices
• Title not available (Why is that?)
• A permanent formula with many zero-valued terms
• Title not available (Why is that?)
• Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
• The permanent of a square matrix
• An inequality of Hadamard type for permanents
• Proof of the Monotone Column Permanent Conjecture
• Evaluation of permanents in rings and semirings
• Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices
• A note on the variation of permanents
• Variation of symmetric tensor powers and permanents
• Generalized symmetric polynomials and an approximate de Finetti representation
• Multilinear forms of Hilbert type and some other distinguished forms
• Some identities between arithmetic means and the other elementary symmetric functions of \(n\) numbers
• A remark on the variation of permanents
• On the variation of permanents
• Title not available (Why is that?)
• On Bobkov's approximate de Finetti representation via approximation of permanents of complex rectangular matrices

Cited In (5)

• On the variation of permanents
• Matrix permanent inequalities for approximating joint assignment matrices in tracking systems
• The permanent of a square matrix
• On the Accuracy in a Combinatorial Central Limit Theorem: The Characteristic Function Method
• On Bobkov's approximate de Finetti representation via approximation of permanents of complex rectangular matrices

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)