The van der Waerden conjecture: Two proofs in one year
From MaRDI portal
(Redirected from The van der Waerden conjecture: Two proofs in one year)
Cites work
- A Permanent Inequality
- scientific article; zbMATH DE number 3621932 (Why is no real title available?)
- scientific article; zbMATH DE number 3023637 (Why is no real title available?)
- Notes on Egoritsjev's proof of the van der Waerden conjecture
- On the minimum of the permanent of a doubly stochastic matrix
- Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
- Some notes on the van der Waerden conjecture
- The solution of van der Waerden's problem for permanents
- Two combinatorial applications of the Aleksandrov-Fenchel inequalities
Cited in
(9)- Combinatorial analysis (nonnegative matrices, algorithmic problems)
- Functional equation approach to inequalities. VI
- Feasible arithmetic computations: Valiant's hypothesis
- Seidel's conjectures in hyperbolic 3-space
- Proof of van der Waerden's theorem in nine figures
- Log-concave poset inequalities
- Equality cases of the Alexandrov-Fenchel inequality are not in the polynomial hierarchy
- On a question of Erdős on doubly stochastic matrices
- Jack van Lint (1932--2004): a survey of his scientific work
This page was built for publication: The van der Waerden conjecture: Two proofs in one year
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1173137)