Permutohedra and minimal matrices

DOI10.1016/J.LAA.2005.07.017zbMath1077.05019OpenAlexW2045162671MaRDI QIDQ2576235

Shmuel Onn, Ernesto Vallejo

Publication date: 27 December 2005

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2005.07.017

zbMATH Keywords

computational complexitydiscrete tomographymajorizationtransportation polytopeadditive matrix

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Linear programming (90C05) Combinatorial aspects of partitions of integers (05A17) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Inequalities and extremum problems involving convexity in convex geometry (52A40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Contingency tables (62H17) Matrices of integers (15B36)

Related Items (8)

On the closest point to the origin in transportation polytopes ⋮ Kronecker products and the RSK correspondence. ⋮ Generalized stability of Heisenberg coefficients ⋮ Additivity obstructions for integral matrices and pyramids ⋮ Majorization permutahedra and (0,1)-matrices ⋮ Stability of Kronecker coefficients via discrete tomography ⋮ INTEGRAL MAJORIZATION POLYTOPES ⋮ Minimal matrices and discrete tomography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kronecker products and the RSK correspondence.
• Geometry, complexity, and combinatorics of permutation polytopes
• Brick decompositions and the matching rank of graphs
• Sets uniquely determined by projections on axes. II: Discrete case
• Sets of uniqueness and minimal matrices
• Geometric algorithms and combinatorial optimization.
• Reductions of additive sets, sets of uniqueness and pyramids
• Variation of cost functions in integer programming
• The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases.
• On the algorithmic inversion of the discrete Radon transform
• A characterization of additive sets
• Plane partitions and characters of the symmetric group
• Solving integer minimum cost flows with separable convex cost objective polynomially
• The Complexity of Three-Way Statistical Tables
• Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions
• A Geometric Buchberger Algorithm for Integer Programming
• Integer Programming and Combinatorial Optimization
• An Inequality
• Inequalities: theory of majorization and its applications
• Dimension of the fixed point set of nilpotent endomorphism on the flag variety
• On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays
• The classification of minimal matrices of size \(2\times q\)
• Minimal nonnegative integral matrices and uniquely determined (0,1)-matrices

This page was built for publication: Permutohedra and minimal matrices