• Corpus ID: 235624159

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

@article{Aprile2021SlackMK,
  title={Slack matrices, k-products, and 2-level polytopes},
  author={Manuel Aprile and Michele Conforti and Yuri Faenza and Samuel Fiorini and Tony Huynh and Marco Macchia},
  journal={ArXiv},
  year={2021},
  volume={abs/2106.12829}
}
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 a matrix in R1212 whose columns are the concatenation of each column of S1 with each column of S2. The k-product generalizes the 1-product, by taking as input two matrices S1, S2 together with k − 1 special rows of each of those matrices, and outputting a certain composition of S1, S2. Our first… 

References

SHOWING 1-10 OF 28 REFERENCES

Recognizing Cartesian products of matrices and polytopes

TLDR
Determining whether a given matrix is a slack matrix is an intriguing problem whose complexity is unknown, and the algorithm reduces the problem to irreducible instances, based on minimizing a symmetric submodular function that expresses mutual information in information theory.

On some problems related to 2-level polytopes

TLDR
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.

Enumeration of 2-level polytopes

TLDR
The approach is based on the notion of a simplicial core, that allows the problem to be reduced to the enumeration of the closed sets of a discrete closure operator, along with some convex hull computations and isomorphism tests.

On 2-Level Polytopes Arising in Combinatorial Settings

TLDR
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

A VERY GENERAL THEOREM ON SYSTEMS OF DISTINCT REPRESENTATIVES

1. Introduction. Currently the theory of systems of distinct representatives (and the closely allied theory of transversals) is being carefully examined and reworked, often in a more general context

Regular matroids have polynomial extension complexity

We prove that the extension complexity of the independence polytope of every regular matroid on [Formula: see text] elements is [Formula: see text]. Past results of Wong and Martin on extended

Binary scalar products