New permanental upper bounds for nonnegative matrices
From MaRDI portal
Publication:4455138
DOI10.1080/0308108031000098450zbMath1045.15005OpenAlexW2033738503MaRDI QIDQ4455138
Publication date: 16 March 2004
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0308108031000098450
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) 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 (16)
A general law of large permanent ⋮ Brunn--Minkowski inequalities for contingency tables and integer flows ⋮ On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \) ⋮ Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\) ⋮ Concentration of the mixed discriminant of well-conditioned matrices ⋮ New permanental bounds for Ferrers matrices ⋮ Permanental bounds of the Laplacian matrix of trees with given domination number ⋮ An upper bound for permanents of nonnegative matrices ⋮ A relationship between subpermanents and the arithmetic-geometric mean inequality ⋮ An update on Minc's survey of open problems involving permanents ⋮ Permanental bounds for nonnegative matrices via decomposition ⋮ An approximation algorithm for counting contingency tables ⋮ Enumerating Contingency Tables via Random Permanents ⋮ Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs ⋮ Computing the Partition Function for Perfect Matchings in a Hypergraph ⋮ Random sampling of contingency tables via probabilistic divide-and-conquer
This page was built for publication: New permanental upper bounds for nonnegative matrices
