Combinatorial aspects of partitions of integers (05A17) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Matrices of integers (15B36) Inequalities and extremum problems involving convexity in convex geometry (52A40) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Contingency tables (62H17) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Linear programming (90C05)
Recommendations
- Minimal matrices and discrete tomography
- The classification of minimal matrices of size \(2\times q\)
- Uniqueness and additivity for n-dimensional binary matrices with respect to their 1-marginals
- Minimization of the permanent and matrices of freedom∗
- Minimizing the permanent over some faces of the polytope of doubly stochastic matrices
Cites work
- A characterization of additive sets
- A Geometric Buchberger Algorithm for Integer Programming
- An Inequality
- Brick decompositions and the matching rank of graphs
- Dimension of the fixed point set of nilpotent endomorphism on the flag variety
- Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions
- Geometric algorithms and combinatorial optimization.
- Geometry, complexity, and combinatorics of permutation polytopes
- scientific article; zbMATH DE number 3828715 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 193053 (Why is no real title available?)
- scientific article; zbMATH DE number 1551773 (Why is no real title available?)
- scientific article; zbMATH DE number 848091 (Why is no real title available?)
- Inequalities: theory of majorization and its applications
- Integer Programming and Combinatorial Optimization
- Kronecker products and the RSK correspondence.
- Minimal nonnegative integral matrices and uniquely determined (0,1)-matrices
- On the algorithmic inversion of the discrete Radon transform
- On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional X-rays
- Plane partitions and characters of the symmetric group
- Reductions of additive sets, sets of uniqueness and pyramids
- Sets of uniqueness and minimal matrices
- Sets uniquely determined by projections on axes. II: Discrete case
- Solving integer minimum cost flows with separable convex cost objective polynomially
- The classification of minimal matrices of size \(2\times q\)
- The Complexity of Three-Way Statistical Tables
- The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases.
- Variation of cost functions in integer programming
Cited in
(12)- The geometry of an interchange: Minimal matrices and circulants
- Generalized stability of Heisenberg coefficients
- Stability of Kronecker coefficients via discrete tomography
- Integral majorization polytopes
- On the closest point to the origin in transportation polytopes
- Minimal matrices and discrete tomography
- Kronecker products and the RSK correspondence.
- scientific article; zbMATH DE number 1139372 (Why is no real title available?)
- Uniqueness and additivity for n-dimensional binary matrices with respect to their 1-marginals
- The classification of minimal matrices of size \(2\times q\)
- Additivity obstructions for integral matrices and pyramids
- Majorization permutahedra and (0,1)-matrices
This page was built for publication: Permutohedra and minimal matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2576235)
