On the public citation graph

Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix

0 signed · 148 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1215/s0012-7094-59-02606-7openalex-snapshot
On the minimum of the permanent of a doubly stochastic matrix
inferredcites →https://doi.org/10.5948/upo9781614440147openalex-snapshot
Combinatorial Mathematics

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jcd.20048openalex-snapshot
Triangular embeddings of complete graphs (neighborly maps) with 12 and 13 vertices
inferred← citeshttps://doi.org/10.1002/jcd.21413openalex-snapshot
Multidimensional Permanents and an Upper Bound on the Number of Transversals in Latin Squares
inferred← citeshttps://doi.org/10.1002/jgt.22650openalex-snapshot
Perfect matchings in random subgraphs of regular bipartite graphs
inferred← citeshttps://doi.org/10.1002/jgt.22658openalex-snapshot
Perfect matchings and derangements on graphs
inferred← citeshttps://doi.org/10.1002/jgt.23080openalex-snapshot
Sharp lower bounds for the number of maximum matchings in bipartite multigraphs
inferred← citeshttps://doi.org/10.1002/rsa.20365openalex-snapshot
Approximate Hamilton decompositions of random graphs
inferred← citeshttps://doi.org/10.1002/rsa.20487openalex-snapshot
An upper bound on the number of Steiner triple systems
inferred← citeshttps://doi.org/10.1002/rsa.20742openalex-snapshot
Intercalates and discrepancy in random Latin squares
inferred← citeshttps://doi.org/10.1002/rsa.20815openalex-snapshot
Counting Hamilton cycles in sparse random directed graphs
inferred← citeshttps://doi.org/10.1002/rsa.20855openalex-snapshot
On the threshold problem for Latin boxes
inferred← citeshttps://doi.org/10.1006/eujc.1998.0221openalex-snapshot
A Note on the Asymptotic Number of Latin Rectangles
inferred← citeshttps://doi.org/10.1006/jctb.1997.1798openalex-snapshot
Counting 1-Factors in Regular Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/11549345_39openalex-snapshot
On the Complexity of Mixed Discriminants and Related Problems
inferred← citeshttps://doi.org/10.1007/978-0-387-21696-6_6openalex-snapshot
Multi-Dimensional Capacity, Pressure and Hausdorff Dimension
inferred← citeshttps://doi.org/10.1007/978-1-4614-4565-4_21openalex-snapshot
Quest for Negative Dependency Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4899-3791-9_4openalex-snapshot
P
inferred← citeshttps://doi.org/10.1007/978-3-031-02104-6_1openalex-snapshot
Log-majorization Type Inequalities
inferred← citeshttps://doi.org/10.1007/978-3-0348-6290-5_3openalex-snapshot
The van der Waerden Permanent Conjecture
inferred← citeshttps://doi.org/10.1007/978-3-319-07557-0_23openalex-snapshot
Short Tours through Large Linear Forests
inferred← citeshttps://doi.org/10.1007/978-3-319-65624-3_11openalex-snapshot
Herbert Busemann and Convexity
inferred← citeshttps://doi.org/10.1007/978-3-540-39890-5_2openalex-snapshot
Matching, Edge-Colouring, and Dimers
inferred← citeshttps://doi.org/10.1007/978-3-642-24488-9_10openalex-snapshot
Maximum Matchings
inferred← citeshttps://doi.org/10.1007/978-3-642-25401-7_10openalex-snapshot
Kardinalitätsmaximale Matchings
inferred← citeshttps://doi.org/10.1007/978-3-642-32278-5_7openalex-snapshot
Combinatorial Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_45openalex-snapshot
A Note on Deterministic Poly-Time Algorithms for Partition Functions Associated with Boolean Matrices with Prescribed Row and Column Sums
inferred← citeshttps://doi.org/10.1007/978-3-662-21708-5_10openalex-snapshot
Maximum Matchings
inferred← citeshttps://doi.org/10.1007/978-3-662-56039-6_10openalex-snapshot
Maximum Matchings
inferred← citeshttps://doi.org/10.1007/978-3-662-57767-7_24openalex-snapshot
Van der Waerdens Permanenten-Vermutung
inferred← citeshttps://doi.org/10.1007/978-94-011-0924-6_17openalex-snapshot
On the Complexity of Some Basic Problems in Computational Convexity
inferred← citeshttps://doi.org/10.1007/978-94-015-1237-4_2openalex-snapshot
P
inferred← citeshttps://doi.org/10.1007/bf00119936openalex-snapshot
A simple solution of the van der Waerden permanent problem
inferred← citeshttps://doi.org/10.1007/bf01104103openalex-snapshot
Some problems of the theory of enumerating the permutations with restricted positions
inferred← citeshttps://doi.org/10.1007/bf01190508openalex-snapshot
A lower bound on the probability of conflict under nonuniform access in database systems
inferred← citeshttps://doi.org/10.1007/bf01864169openalex-snapshot
Every 8-uniform 8-regular hypergraph is 2-colorable
inferred← citeshttps://doi.org/10.1007/bf02104831openalex-snapshot
Combinatorial analysis (nonnegative matrices, algorithmic problems)
inferred← citeshttps://doi.org/10.1007/bf02187736openalex-snapshot
Embeddings of graphs in euclidean spaces
inferred← citeshttps://doi.org/10.1007/bf02463209openalex-snapshot
The mixed Hodge-Riemann bilinear relations in the linear situation
inferred← citeshttps://doi.org/10.1007/bf02579193openalex-snapshot
Bounds on the number of Eulerian orientations
inferred← citeshttps://doi.org/10.1007/bf02579296openalex-snapshot
Discrete hyperbolic geometry
inferred← citeshttps://doi.org/10.1007/s00453-005-1175-9openalex-snapshot
Exact Sampling from Perfect Matchings of Dense Regular Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s00454-001-0083-2openalex-snapshot
A Deterministic Algorithm for Approximating the Mixed Discriminant and Mixed Volume, and a Combinatorial Corollary
inferred← citeshttps://doi.org/10.1007/s00454-009-9147-5openalex-snapshot
A Polynomial-Time Algorithm to Approximate the Mixed Volume within a Simply Exponential Factor
inferred← citeshttps://doi.org/10.1007/s00454-013-9554-5openalex-snapshot
On the Vertices of the d-Dimensional Birkhoff Polytope
inferred← citeshttps://doi.org/10.1007/s00493-004-0025-8openalex-snapshot
Triangle Factors In Sparse Pseudo-Random Graphs
inferred← citeshttps://doi.org/10.1007/s00493-011-2842-8openalex-snapshot
An upper bound on the number of high-dimensional permutations
inferred← citeshttps://doi.org/10.1007/s00493-014-2842-8openalex-snapshot
An upper bound on the number of high-dimensional permutations
inferred← citeshttps://doi.org/10.1007/s00493-014-2969-7openalex-snapshot
Equal coefficients and tolerance in coloured Tverberg partitions
inferred← citeshttps://doi.org/10.1007/s10107-016-0998-2openalex-snapshot
Relative entropy optimization and its applications
inferred← citeshttps://doi.org/10.1007/s10955-011-0170-6openalex-snapshot
An Asymptotic Expansion and Recursive Inequalities for the Monomer-Dimer Problem
inferred← citeshttps://doi.org/10.1007/s11856-017-1518-7openalex-snapshot
Packing, counting and covering Hamilton cycles in random directed graphs
inferred← citeshttps://doi.org/10.1007/s13226-021-00195-5openalex-snapshot
Law of large numbers for permanents of random constrained matrices
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90537-popenalex-snapshot
Almost all quasigroups have rank 2
inferred← citeshttps://doi.org/10.1016/0024-3795(94)90111-2openalex-snapshot
Minimum permanents of doubly stochastic matrices with prescribed zero entries on the main diagonal
inferred← citeshttps://doi.org/10.1016/0095-8956(90)90128-mopenalex-snapshot
Asymptotic enumeration of Latin rectangles
inferred← citeshttps://doi.org/10.1016/j.aim.2004.12.002openalex-snapshot
The Van der Waerden conjecture for mixed discriminants
inferred← citeshttps://doi.org/10.1016/j.aim.2006.07.012openalex-snapshot
Brunn–Minkowski inequalities for contingency tables and integer flows
inferred← citeshttps://doi.org/10.1016/j.aim.2024.110079openalex-snapshot
On the codimension of permanental varieties
inferred← citeshttps://doi.org/10.1016/j.disc.2005.11.059openalex-snapshot
Graph factors and factorization: 1985–2003: A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2016.11.024openalex-snapshot
On the numbers of 1-factors and 1-factorizations of hypergraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112168openalex-snapshot
Paths with many shortcuts in tournaments
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114107openalex-snapshot
Improved upper bounds on even-cycle creating Hamilton paths
inferred← citeshttps://doi.org/10.1016/j.endm.2015.06.014openalex-snapshot
Upper bounds on the numbers of 1-factors and 1-factorizations of hypergraphs
inferred← citeshttps://doi.org/10.1016/j.endm.2015.06.109openalex-snapshot
Packing, Counting and Covering Hamilton cycles in random directed graphs
inferred← citeshttps://doi.org/10.1016/j.ic.2014.09.007openalex-snapshot
Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: Combinatorial and algorithmic applications
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.10.015openalex-snapshot
Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2022.01.025openalex-snapshot
Results and questions on matchings in abelian groups and vector subspaces of fields
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.06.003openalex-snapshot
Classical complexity and quantum entanglement
inferred← citeshttps://doi.org/10.1016/j.jcta.2013.05.004openalex-snapshot
On the number of transversal designs
inferred← citeshttps://doi.org/10.1016/j.jctb.2004.12.003openalex-snapshot
On packing Hamilton cycles in ε -regular graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2021.12.002openalex-snapshot
Hamiltonian cycles above expectation in r-graphs and quasi-random r-graphs
inferred← citeshttps://doi.org/10.1016/j.laa.2006.09.021openalex-snapshot
Basic Soules matrices and their applications
inferred← citeshttps://doi.org/10.1016/j.laa.2006.10.014openalex-snapshot
Chebyshev type inequalities involving permanents and their applications
inferred← citeshttps://doi.org/10.1016/j.laa.2018.10.024openalex-snapshot
Partitions of the polytope of doubly substochastic matrices
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00227-9openalex-snapshot
Problems and results in extremal combinatorics—I
inferred← citeshttps://doi.org/10.1017/9781009490559.006openalex-snapshot
Transversals in Latin Squares
inferred← citeshttps://doi.org/10.1017/9781108332699.009openalex-snapshot
Robustness of graph properties
inferred← citeshttps://doi.org/10.1017/fmp.2024.20openalex-snapshot
Equality cases of the Alexandrov–Fenchel inequality are not in the polynomial hierarchy
inferred← citeshttps://doi.org/10.1017/s0963548304006637openalex-snapshot
Distance Graphs on the Integers
inferred← citeshttps://doi.org/10.1017/s0963548305006863openalex-snapshot
On the Number of Hamiltonian Cycles in a Tournament
inferred← citeshttps://doi.org/10.1017/s0963548307008668openalex-snapshot
Enumerating Contingency Tables via Random Permanents
inferred← citeshttps://doi.org/10.1017/s0963548307008747openalex-snapshot
Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer–Dimer Entropy
inferred← citeshttps://doi.org/10.1017/s0963548311000435openalex-snapshot
Computing the Partition Function for Perfect Matchings in a Hypergraph
inferred← citeshttps://doi.org/10.1017/s0963548321000122openalex-snapshot
Counting matchings via capacity-preserving operators
inferred← citeshttps://doi.org/10.1023/a:1014594331863openalex-snapshot
Bipartite Matching and Van der Waerden Conjecture
inferred← citeshttps://doi.org/10.1051/cocv:2008040openalex-snapshot
A new series of conjectures and open questions in optimization and matrix analysis
inferred← citeshttps://doi.org/10.1070/rm1984v039n06abeh003190openalex-snapshot
On the signature and kernel of the bilinear form associated with a permanent
inferred← citeshttps://doi.org/10.1070/sm1987v056n02abeh003036openalex-snapshot
ON SOME PROPERTIES OF MIXED DISCRIMINANTS
inferred← citeshttps://doi.org/10.1080/0025570x.1996.11996426openalex-snapshot
On the Asymptotic Solution of a Card-Matching Problem
inferred← citeshttps://doi.org/10.1080/03081080290019603openalex-snapshot
Minimum Permanents on a Face of the Polytope of Doubly Stochastic Matrices II
inferred← citeshttps://doi.org/10.1080/03081087.2012.675332openalex-snapshot
Remarks and open problems on the minimum permanent of acyclic doubly stochastic matrices
inferred← citeshttps://doi.org/10.1080/03081087.2018.1513448openalex-snapshot
Permanents of doubly substochastic matrices
inferred← citeshttps://doi.org/10.1080/03081088308817488openalex-snapshot
Theory of permanents 1978–1981
inferred← citeshttps://doi.org/10.1080/03081088908817922openalex-snapshot
On the permanent of doubly stochastic matrices with zero diagonal
inferred← citeshttps://doi.org/10.1080/03081089408818290openalex-snapshot
On some permanental conjectures
inferred← citeshttps://doi.org/10.1080/03081089508818428openalex-snapshot
Minimum permanents of doubly stochastic matrices with zero main diagonal
inferred← citeshttps://doi.org/10.1080/03081089708818508openalex-snapshot
The permanent of a class of matrices associated with a finite group
inferred← citeshttps://doi.org/10.1093/imrn/rnn133openalex-snapshot
Asymptotic Estimates for the Number of Contingency Tables, Integer Flows, and Volumes of Transportation Polytopes
inferred← citeshttps://doi.org/10.1109/focs.2012.81openalex-snapshot
A Permanent Approach to the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1109/focs.2019.00074openalex-snapshot
Spectral Analysis of Matrix Scaling and Operator Scaling
inferred← citeshttps://doi.org/10.1109/isit.2015.7282752openalex-snapshot
Bounds on the size of balls over permutations with the infinity metric
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206878openalex-snapshot
Bounding the Permanent of a Non-negative Matrix via its Degree- M Bethe and Sinkhorn Permanents
inferred← citeshttps://doi.org/10.1109/tit.2015.2482493openalex-snapshot
On the Number of Interference Alignment Solutions for the $K$ -User MIMO Channel With Constant Coefficients
inferred← citeshttps://doi.org/10.1109/tit.2017.2697423openalex-snapshot
Improved Lower Bounds on the Size of Balls Over Permutations With the Infinity Metric
inferred← citeshttps://doi.org/10.1109/tit.2024.3374787openalex-snapshot
Degree-MBethe and Sinkhorn Permanent Based Bounds on the Permanent of a Non-Negative Matrix
inferred← citeshttps://doi.org/10.1109/tit.2025.3559684openalex-snapshot
DNA-Correcting Codes: End-to-End Correction in DNA Storage Systems
inferred← citeshttps://doi.org/10.1111/j.2517-6161.1991.tb01809.xopenalex-snapshot
Discussion of the Paper by Bailey
inferred← citeshttps://doi.org/10.1134/s1990478916040141openalex-snapshot
Permanents of multidimensional matrices: Properties and applications
inferred← citeshttps://doi.org/10.1137/080735898openalex-snapshot
Design is as Easy as Optimization
inferred← citeshttps://doi.org/10.1137/120888168openalex-snapshot
Maximum Size of Reverse-Free Sets of Permutations
inferred← citeshttps://doi.org/10.1145/1132516.1132578openalex-snapshot
Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures
inferred← citeshttps://doi.org/10.1145/1993636.1993682openalex-snapshot
The computational complexity of linear optics
inferred← citeshttps://doi.org/10.1145/2462356.2462369openalex-snapshot
Equal coefficients and tolerance in coloured tverberg partitions
inferred← citeshttps://doi.org/10.1145/276698.276880openalex-snapshot
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
inferred← citeshttps://doi.org/10.1145/2897518.2897649openalex-snapshot
Maximizing determinants under partition constraints
inferred← citeshttps://doi.org/10.1145/335305.335311openalex-snapshot
A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume
inferred← citeshttps://doi.org/10.1145/3618260.3649646openalex-snapshot
Equality Cases of the Alexandrov–Fenchel Inequality Are Not in the Polynomial Hierarchy
inferred← citeshttps://doi.org/10.1145/780542.780545openalex-snapshot
Classical deterministic complexity of Edmonds' Problem and quantum entanglement
inferred← citeshttps://doi.org/10.1155/2013/289829openalex-snapshot
Spectrum of Permanent’s Values and Its Extremal Magnitudes in and
inferred← citeshttps://doi.org/10.1201/b16113-50openalex-snapshot
Permanents
inferred← citeshttps://doi.org/10.1214/lnms/1215459866openalex-snapshot
Expectation inequalities from convex geometry
inferred← citeshttps://doi.org/10.1215/00192082-11792788openalex-snapshot
Partitioning the hypercube into smaller hypercubes
inferred← citeshttps://doi.org/10.12988/imf.2006.06171openalex-snapshot
A note on the Dittert conjecture for permanents
inferred← citeshttps://doi.org/10.13001/1081-3810.1577openalex-snapshot
Results and open problems in matchings in regular graphs
inferred← citeshttps://doi.org/10.14760/owr-2015-17openalex-snapshot
Arbeitsgemeinschaft: The Kadison-Singer Conjecture
inferred← citeshttps://doi.org/10.1515/rose.2011.017openalex-snapshot
35 years of the Inverse Tangent Law
inferred← citeshttps://doi.org/10.2478/spma-2014-0007openalex-snapshot
The theory and applications of complex matrix scalings
inferred← citeshttps://doi.org/10.37236/487openalex-snapshot
The Many Formulae for the Number of Latin Rectangles
inferred← citeshttps://doi.org/10.37236/790openalex-snapshot
Van der Waerden/Schrijver-Valiant like Conjectures and Stable (aka Hyperbolic) Homogeneous Polynomials: One Theorem for all
inferred← citeshttps://doi.org/10.4086/toc.2013.v009a004openalex-snapshot
inferred← citeshttps://doi.org/10.4169/000298910x523380openalex-snapshot
On Leonid Gurvits’s Proof for Permanents
inferred← citeshttps://doi.org/10.4310/joc.2021.v12.n2.a5openalex-snapshot
Dominant tournament families
inferred← citeshttps://doi.org/10.48550/arxiv.1011.3245openalex-snapshot
The Computational Complexity of Linear Optics
inferred← citeshttps://doi.org/10.48550/arxiv.1102.2542openalex-snapshot
Analogs of the van der Waerden and Tverberg conjectures for haffnians
inferred← citeshttps://doi.org/10.48550/arxiv.1108.0065openalex-snapshot
Approximating the Permanent with Fractional Belief Propagation
inferred← citeshttps://doi.org/10.48550/arxiv.1108.5042openalex-snapshot
An Upper bound on the number of Steiner triple systems
inferred← citeshttps://doi.org/10.48550/arxiv.1110.0568openalex-snapshot
On a Problem of Gromov about Generalizing Alexandrov-Fenchel Inequality
inferred← citeshttps://doi.org/10.48550/arxiv.1208.4218openalex-snapshot
On the vertices of the d-dimensional Birkhoff polytope
inferred← citeshttps://doi.org/10.48550/arxiv.1506.00618openalex-snapshot
Packing, Counting and Covering Hamilton cycles in random directed graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1611.02400openalex-snapshot
A Graph-Theoretic Approach to Multitasking
inferred← citeshttps://doi.org/10.48550/arxiv.1701.01419openalex-snapshot
On Convex Programming Relaxations for the Permanent
inferred← citeshttps://doi.org/10.48550/arxiv.math/0402088openalex-snapshot
Combinatorics hidden in hyperbolic polynomials and related topics
inferred← citeshttps://doi.org/10.48550/arxiv.math/0603410openalex-snapshot
Generalized Friedland-Tverberg inequality: applications and extensions
inferred← citeshttps://doi.org/10.48550/arxiv.math/0703227openalex-snapshot
Counting magic squares in quasi-polynomial time
inferred← citeshttps://doi.org/10.5802/xups.2025-03openalex-snapshot
Algorithmique des matroïdes et polynômes log-concaves
inferred← citeshttps://doi.org/10.5831/hmj.2013.35.2.211openalex-snapshot
MINIMUM PERMANENTS ON DOUBLY STOCHASTIC MATRICES WITH PRESCRIBED ZEROS
inferred← citeshttps://doi.org/10.7907/84vv-s966.openalex-snapshot
On Elliptic Semiplanes, an Algebraic Problem in Matrix Theory, and Weight Enumeration of Certain Binary Cyclic Codes
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.