Permutohedra and minimal matrices

The notions of minimality, π-uniqueness and additivity originated in discrete tomography. They have applications to Kronecker products of characters of the symmetric group and arise as the optimal solutions of quadratic transportation problems. Here, we introduce the notion of real-minimality and give geometric characterizations of all these notions for a matrix A, by considering the intersection of the permutohedron determined by A with the transportation polytope in which A lies. We also study the computational complexity of deciding if the properties of being additive, real-minimal, π-unique and minimal hold for a given matrix, and show how to efficiently construct some matrix with any of these properties.

[1]  R. Jackson.  Inequalities , 2007, Algebra for Parents.

[2]  P. Fishburn,et al.  Sets of Uniqueness and Additivity in Integer Lattices , 1999 .

[3]  Wojciech Szatzschneider,et al.  An Inequality , 1991, SIAM Rev..

[4]  G. Herman,et al.  Discrete tomography : foundations, algorithms, and applications , 1999 .

[5]  Ernesto Vallejo,et al.  Plane Partitions and Characters of the Symmetric Group , 2000 .

[6]  Minimal nonnegative integral matrices and uniquely determined (0,1)-matrices , 2002 .

[7]  J. Humphreys.  Polytopes, Graphs and Optimisation , 2022 .

[8]  M. Minoux.  Solving integer minimum cost flows with separable convex cost objective polynomially , 1986 .

[9]  T. Mansour,et al.  Involutions avoiding the class of permutations in Sk with prefix 12 , 2007 .

[10]  Rekha R. Thomas,et al.  The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases , 2002, Adv. Appl. Math..

[11]  Uriel G. Rothblum,et al.  Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions , 1996, Math. Oper. Res..

[12]  A. Torres-Chazaro,et al.  Sets of Uniqueness and Minimal Matrices , 1998 .

[13]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[14]  P. Fishburn,et al.  Sets Uniquely Determined by Projections on Axes I , 1990 .

[15]  Audra E. Kosh,et al.  Linear Algebra and its Applications , 1992 .

[16]  Jesús A. De Loera,et al.  All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables , 2004, IPCO.

[17]  Jesús A. De Loera,et al.  The Complexity of Three-Way Statistical Tables , 2002, SIAM J. Comput..

[18]  David K. Smith.  Theory of Linear and Integer Programming , 1987 .

[19]  Louis J. Billera,et al.  The Combinatorics of Permutation Polytopes , 1994, Formal Power Series and Algebraic Combinatorics.

[20]  László Lovász,et al.  Brick decompositions and the matching rank of graphs , 1982, Comb..

[21]  Rekha R. Thomas.  A Geometric Buchberger Algorithm for Integer Programming , 1995, Math. Oper. Res..

[22]  Rekha R. Thomas,et al.  Variation of cost functions in integer programming , 1997, Math. Program..

[23]  Sven de Vries,et al.  On the algorithmic inversion of the discrete Radon transform , 2002, Theor. Comput. Sci..

[24]  Ernesto Vallejo.  The classification of minimal matrices of size 2×q , 2002 .

[25]  V. A. Yemelicher,et al.  Polytopes, Graphs and Optimisation , 1984 .

[26]  Shmuel Onn,et al.  Geometry, Complexity, and Combinatorics of Permutation Polytopes , 1993, J. Comb. Theory A.

[27]  I. Olkin,et al.  Inequalities: Theory of Majorization and Its Applications , 1980 .

[28]  Yan Gérard,et al.  On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional X-rays , 2001 .

[29]  Ernesto Vallejo.  Reductions of additive sets, sets of uniqueness and pyramids , 1997, Discret. Math..

[30]  Ernesto Vallejo.  A characterization of additive sets , 2002, Discret. Math..