Recognizing Cartesian products of matrices and polytopes

02/06/2020
by   Manuel Aprile, et al.
0

The 1-product of matrices S_1 ∈R^m_1 × n_1 and S_2 ∈R^m_2 × n_2 is the matrix in R^(m_1+m_2) × (n_1n_2) whose columns are the concatenation of each column of S_1 with each column of S_2. Our main result is a polynomial time algorithm for the following problem: given a matrix S, is S a 1-product, up to permutation of rows and columns? Our main motivation is a close link between the 1-product of matrices and the Cartesian product of polytopes, which goes through the concept of slack matrix. Determining whether a given matrix is a slack matrix is an intriguing problem whose complexity is unknown, and our algorithm reduces the problem to irreducible instances. Our algorithm is based on minimizing a symmetric submodular function that expresses mutual information in information theory. We also give a polynomial time algorithm to recognize a more complicated matrix product, called the 2-product. Finally, as a corollary of our 1-product and 2-product recognition algorithms, we obtain a polynomial time algorithm to recognize slack matrices of 2-level matroid base polytopes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/24/2021

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

In this paper, we study algorithmic questions concerning products of mat...
research
09/13/2017

Mitigating Overexposure in Viral Marketing

In traditional models for word-of-mouth recommendations and viral market...
research
01/06/2016

A Polynomial-time Algorithm to Compute Generalized Hermite Normal Form of Matrices over Z[x]

In this paper, a polynomial-time algorithm is given to compute the gener...
research
05/22/2019

On the Restricted Isometry Property of Centered Self Khatri-Rao Products

In this work we establish the Restricted Isometry Property (RIP) of the ...
research
01/17/2022

Matrix Reordering for Noisy Disordered Matrices: Optimality and Computationally Efficient Algorithms

Motivated by applications in single-cell biology and metagenomics, we co...
research
09/29/2017

Recognizing Matroids

Let E be a finite set and P, S, L three classes of subsets of E, and ...
research
02/27/2018

Breaking the 1/√(n) Barrier: Faster Rates for Permutation-based Models in Polynomial Time

Many applications, including rank aggregation and crowd-labeling, can be...

Please sign up or login with your details

Forgot password? Click here to reset