Slack matrices, k-products, and 2-level polytopes

by   Manuel Aprile, et al.

In this paper, we study algorithmic questions concerning products of matrices and their consequences for recognition algorithms for polyhedra. The 1-product of matrices S_1, S_2 is a matrix whose columns are the concatenation of each column of S_1 with each column of S_2. The k-product generalizes the 1-product, by taking as input two matrices S_1, S_2 together with k-1 special rows of each of those matrices, and outputting a certain composition of S_1,S_2. Our study is motivated by a close link between the 1-product of matrices and the Cartesian product of polytopes, and more generally between the k-product of matrices and the glued product of polytopes. These connections rely on the concept of slack matrix, which gives an algebraic representation of classes of affinely equivalent polytopes. The slack matrix recognition problem is the problem of determining whether a given matrix is a slack matrix. This is an intriguing problem whose complexity is unknown. Our algorithm reduces the problem to instances which cannot be expressed as k-products of smaller matrices. In the second part of the paper, we give a combinatorial interpretation of k-products for two well-known classes of polytopes: 2-level matroid base polytopes and stable set polytopes of perfect graphs. We also show that the slack matrix recognition problem is polynomial-time solvable for such polytopes. Those two classes are special cases of 2-level polytopes, for which we conjecture that the slack matrix recognition problem is polynomial-time solvable.


page 1

page 2

page 3

page 4


Recognizing Cartesian products of matrices and polytopes

The 1-product of matrices S_1 ∈R^m_1 × n_1 and S_2 ∈R^m_2 × n_2 is the m...

Recognising permuted Demidenko matrices

We solve the recognition problem (RP) for the class of Demidenko matrice...

Sets of Stochastic Matrices with Converging Products: Bounds and Complexity

An SIA matrix is a stochastic matrix whose sequence of powers converges ...

Hadamard Powers and the Identification of Mixtures of Products

The Hadamard Power of a matrix is the matrix consisting of all Hadamard ...

Morphological Matrices as a Tool for Crowdsourced Ideation

Designing a novel product is a difficult task not well suited for non-ex...

Non-Sturmian sequences of matrices providing the maximum growth rate of matrix products

One of the most pressing problems in modern analysis is the study of the...

On the Mortality Problem: from multiplicative matrix equations to linear recurrence sequences and beyond

We consider the following variant of the Mortality Problem: given k× k m...

Please sign up or login with your details

Forgot password? Click here to reset