Extending the minc-brègman upper bound for the permanent

DOI10.1080/03081080008818633zbMath0977.15009OpenAlexW2077064243MaRDI QIDQ4485089

George W. Soules

Publication date: 21 January 2002

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081080008818633

zbMATH Keywords

nonnegative matrixrecursionpermanentMinc-Brègman upper bound

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Combinatorial inequalities (05A20) Positive matrices and their generalizations; cones of matrices (15B48) Miscellaneous inequalities involving matrices (15A45)

Related Items (8)

Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\) ⋮ An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs ⋮ Permanents of almost regular complete bipartite graphs ⋮ New permanental bounds for Ferrers matrices ⋮ Permanental bounds of the Laplacian matrix of trees with given domination number ⋮ An update on Minc's survey of open problems involving permanents ⋮ Permanental bounds for nonnegative matrices via decomposition ⋮ Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs

Cites Work

• The rate of convergence of Sinkhorn balancing
• A short proof of Minc's conjecture
• An upper bound for the permanent of a nonnegative matrix
• A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains
• Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices

This page was built for publication: Extending the minc-brègman upper bound for the permanent