Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
From MaRDI portal
Publication:1159744
DOI10.1007/BF01163285zbMath0475.15007WikidataQ123337731 ScholiaQ123337731MaRDI QIDQ1159744
Publication date: 1981
Published in: Mathematical Notes (Search for Journal in Brave)
Determinants, permanents, traces, other special matrix functions (15A15) Stochastic matrices (15B51)
Related Items
Contribution to van der Waerden's conjecture, The Van der Waerden conjecture for mixed discriminants, Functional equation approach to inequalities. VI, Minimum permanents of doubly stochastic matrices with prescribed zero entries on the main diagonal, A general law of large permanent, Counting matchings via capacity-preserving operators, The number of matchings in random regular graphs and bipartite graphs, Log-majorization Type Inequalities, Maximizing products of linear forms, and the permanent of positive semidefinite matrices, Classical complexity and quantum entanglement, Minimizing the permanent over some faces of the polytope of doubly stochastic matrices, Cycles of length 0 modulo k in directed graphs, Minimum Permanents on a Face of the Polytope of Doubly Stochastic Matrices II, A lower bound on the probability of conflict under nonuniform access in database systems, Singular values, doubly stochastic matrices, and applications, Upper bounds on the numbers of 1-factors and 1-factorizations of hypergraphs, The Steiner triple systems of order 19, Factorially many maximum matchings close to the Erdős-Gallai bound, Counting and packing Hamilton cycles in dense graphs and oriented graphs, Graph factors and factorization: 1985--2003: a survey, Chebyshev type inequalities involving permanents and their applications, On the proportion of transverse-free plane curves, Brunn--Minkowski inequalities for contingency tables and integer flows, Every 7-regular digraph contains an even cycle, Elementary proof for a Van der Waerden's conjecture and related theorems, Results and questions on matchings in abelian groups and vector subspaces of fields, Counting 1-factors in regular bipartite graphs, The geometry of diagonal groups, Substructures in Latin squares, Perfect matchings in random subgraphs of regular bipartite graphs, Perfect matchings and derangements on graphs, Hamilton transversals in random Latin squares, Enumerating coprime permutations, Permanents of multidimensional matrices: Properties and applications, Large deviations in random latin squares, Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor, Problems and results in extremal combinatorics. I., On the vertices of the \(d\)-dimensional Birkhoff polytope, Partitions of the polytope of doubly substochastic matrices, Randomly colouring graphs (a combinatorial view), Mixed Hodge-Riemann bilinear relations in the linear situation, Number of 1-factorizations of regular high-degree graphs, The van der Waerden conjecture: Two proofs in one year, Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer–Dimer Entropy, Basic Soules matrices and their applications, An upper bound on the number of high-dimensional permutations, Tropical determinant of integer doubly-stochastic matrices, Maximization of a matrix function related to the Dittert conjecture, Relative entropy optimization and its applications, On the numbers of 1-factors and 1-factorizations of hypergraphs, Packing, counting and covering Hamilton cycles in random directed graphs, Matching theory -- a sampler: From Dénes König to the present, An upper bound for permanents of nonnegative matrices, Equal coefficients and tolerance in coloured Tverberg partitions, Almost all quasigroups have rank 2, Approximating the permanent of graphs with large factors, A simple solution of the van der Waerden permanent problem, Enumerating extensions of mutually orthogonal Latin squares, An asymptotic expansion and recursive inequalities for the monomer-dimer problem, Asymptotic enumeration of Latin rectangles, Permanental bounds for nonnegative matrices via decomposition, The combinatorics of a three-line circulant determinant, Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations, The theory and applications of complex matrix scalings, On packing Hamilton cycles in \(\varepsilon\)-regular graphs, Every 8-uniform 8-regular hypergraph is 2-colorable, An approximation algorithm for counting contingency tables, On the number of Sudoku squares, Multidimensional permanents of polystochastic matrices, Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: combinatorial and algorithmic applications, The scaling mean and a law of large permanents, On the threshold problem for Latin boxes, A new series of conjectures and open questions in optimization and matrix analysis, Permanents of doubly substochastic matrices, A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor, Embeddings of graphs in Euclidean spaces, Permanents of d-dimensional matrices, A stronger form of the Egorychev-Falikman theorem on permanents, Some results towards the Dittert conjecture on permanents, Multinomial Probabilities, Permanents and a Conjecture of Karlin and Rinott, Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs, Inequalities for permanents involving Perron complements, Spectral Analysis of Matrix Scaling and Operator Scaling, Matrix permanent and quantum entanglement of permutation invariant states, On the number of 1-factors of locally finite graphs, Multidimensional Permanents and an Upper Bound on the Number of Transversals in Latin Squares, Approximate Hamilton decompositions of random graphs, Bounds on the number of Eulerian orientations, Solutions of permanental equations regarding stochastic matrices, Edge-disjoint Hamilton cycles in random graphs, Law of large numbers for permanents of random constrained matrices, Discrete hyperbolic geometry, Combinatorial analysis (nonnegative matrices, algorithmic problems), Extremal positive semidefinite doubly stochastic matrices, Tropical determinant on transportation polytopes, The minimum number of spanning trees in regular multigraphs
Cites Work
