Abstract

We consider two polytopes. The quadratic assignment polytope PQAP (n) is the convex hull of the set of tensors x ⊗ x, x ∈ Pn , where Pn is the set of n × n permutation matrices. The second polytope is defined as follows. For every permutation of vertices of the complete graph Kn we consider the appropriate permutation matrix of the edges of Kn . The Young polytope P((n – 2, 2)) is the convex hull of all such matrices. In 2009, S. Onn showed that the subgraph isomorphism problem can be reduced to optimization both over PQAP (n) and over P((n – 2, 2)). He also posed the question whether PQAP (n) and P((n – 2, 2)), having n! vertices each, are isomorphic. We show that PQAP (n) and P((n – 2, 2)) are not isomorphic. Also, we show that PQAP (n) is a face of P((2n 2 – 2, 2)), but P((n – 2, 2)) is a projection of PQAP (n).

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.