### Integrality of Linearizations of Polynomials over Binary Variables using Additional Monomials. (arXiv:1911.06894v1 [cs.DM])

Polynomial optimization problems over binary variables can be expressed as integer programs using a linearization with extra monomials in addition to those arising in the given polynomial. We characterize when such a linearization yields an integral relaxation polytope, generalizing work by Del Pia and Khajavirad (SIAM Journal on Optimization, 2018). We also present an algorithm…