Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
From MaRDI portal
Publication:5725697
DOI10.1090/S0002-9904-1963-11031-9zbMath0116.25202OpenAlexW1488960947WikidataQ56169492 ScholiaQ56169492MaRDI QIDQ5725697
Publication date: 1963
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9904-1963-11031-9
Related Items (49)
A general law of large permanent ⋮ The m-Bézout bound and distance geometry ⋮ Estimates of the function and quotient by Minc-Sathre ⋮ On some inequalities involving \((n!)^{1/n}\) ⋮ Asymptotic expansions and inequalities relating to the gamma function ⋮ On a conjecture in the theory of permanents ⋮ Maximum permanents of matrices of zeros and ones ⋮ New upper bounds for the number of embeddings of minimally rigid graphs ⋮ Results and questions on matchings in abelian groups and vector subspaces of fields ⋮ Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\) ⋮ Comparison of permanental bounds of \((0,1)\)-matrices ⋮ Generalization of a Hadamard type inequality for permanents ⋮ Sequential importance sampling for estimating expectations over the space of perfect matchings ⋮ Permanents of multidimensional matrices: Properties and applications ⋮ Matrices of zeros and ones with fixed row and column sum vectors ⋮ Some upper bounds for permanents of (0, 1)-matrices ⋮ Permanents of almost regular complete bipartite graphs ⋮ Concentration of the mixed discriminant of well-conditioned matrices ⋮ New permanental bounds for Ferrers matrices ⋮ Maximum permanents on certain classes of nonnegative matrices ⋮ An upper bound for the permanent of \((0,1)\)-matrices. ⋮ Randomly colouring graphs (a combinatorial view) ⋮ The Permanent of a Transitive Relation ⋮ Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges ⋮ Permanental bounds of the Laplacian matrix of trees with given domination number ⋮ Notes on use of generalized entropies in counting ⋮ On the number of \(r\)-matchings in a tree ⋮ Some Inequalities involving (r!)1/r ⋮ Permanental bounds for nonnegative matrices via decomposition ⋮ The combinatorics of a three-line circulant determinant ⋮ Matrix factorizations of determinants and permanents ⋮ Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations ⋮ The maximum number of Hamiltonian paths in tournaments ⋮ On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs ⋮ An upper bound for the multidimensional dimer problem ⋮ A short proof of Minc's conjecture ⋮ Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs ⋮ Systems of representatives ⋮ Sharp bounds on the permanental sum of a graph ⋮ Term ranks and permanents of nonnegative matrices ⋮ New permanent approximation inequalities via identities ⋮ Combinatorial analysis. (Matrix problems, choice theory) ⋮ Extending the minc-brègman upper bound for the permanent ⋮ An Upper Bound for the Permanent of a Fully Indecomposable Matrix ⋮ Bounds on the number of Eulerian orientations ⋮ An algorithmic proof of Brégman–Minc theorem ⋮ A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I ⋮ A Tight Analysis of Bethe Approximation for Permanent ⋮ A New Lower Bound for the Number of Switches in Rearrangeable Networks
Cites Work
This page was built for publication: Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
