Recognizing Cartesian products of matrices and polytopes

  title={Recognizing Cartesian products of matrices and polytopes},
  author={Manuel Aprile and Michele Conforti and Yuri Faenza and Samuel Fiorini and Tony Huynh and Marco Macchia},
The 1-product of matrices $S_1 \in \mathbb{R}^{m_1 \times n_1}$ and $S_2 \in \mathbb{R}^{m_2 \times n_2}$ is the matrix in $\mathbb{R}^{(m_1+m_2) \times (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… 

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

In this paper, we study algorithmic questions concerning products of matrices and their consequences for recognition algorithms for polyhedra. The 1-product of matrices S1 ∈ R m1×n1 , S2 ∈ R m2×n2 is

Submodular functions

These notes contain examples of submodular functions and describe certain algorithms for optimizing them. They are intended for students from the M.Sc. class IEORE4008 Computational Discrete



On some problems related to 2-level polytopes

This thesis investigates a number of problems related to 2-level polytopes, in particular regarding their combinatorial structure and extension complexity, and gives an output-efficient algorithm to write down extended formulations for the stable set polytope of perfect graphs.

Theta rank, levelness, and matroid minors

On 2-Level Polytopes Arising in Combinatorial Settings

A trade-off formula for the number of cliques and stable sets in a graph; a description of stable matching poly topes as affine projections of certain order polytopes; and a linear-size description of the base polytope of matroids that are 2-level in terms of cuts of an associated tree are presented.

Minimizing symmetric submodular functions

We describe a purely combinatorial algorithm which, given a submodular set functionf on a finite setV, finds a nontrivial subsetA ofV minimizingf[A] + f[V ∖ A]. This algorithm, an extension of the

Extended formulations in combinatorial optimization

This survey presents compact extended formulations for several graph problems involving cuts, trees, cycles and matchings, and for the mixing set, and presents the proof of Fiorini, Massar, Pokutta, Tiwary and de Wolf of an exponential lower bound for the cut polytope.

Matroid polytopes, nested sets and Bergman fans

The tropical variety defined by linear equations with constant coefficients is the Bergman fan of the corresponding matroid. Building on a self-contained introduction to matroid polytopes, we present

The projected faces property and polyhedral relations

It is proved that the projected faces property and affinely generated polyhedral relation are equivalent conditions.

Elements of Information Theory

The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.

Matroid theory

The current status has been given for all the unsolved problems or conjectures that appear in Chapter 14 and the corrected text is given with the inserted words underlined.

Expressing combinatorial optimization problems by linear programs

It is shown that expressing the matching and the Traveling Salesman Problem by a symmetric linear program requires exponential size, and the minimum size needed by a LP to express a polytope to a combinatorial parameter is related.