Extensions of dually bipartite regular polytopes

Extensions of Regular ‎Rings‎

Let $R$ be an associative ring with identity. An element $x in R$ is called $mathbb{Z}G$-regular (resp. strongly $mathbb{Z}G$-regular) if there exist $g in G$, $n in mathbb{Z}$ and $r in R$ such that $x^{ng}=x^{ng}rx^{ng}$ (resp. $x^{ng}=x^{(n+1)g}$). A ring $R$ is called $mathbb{Z}G$-regular (resp. strongly $mathbb{Z}G$-regular) if every element of $R$ is $mathbb{Z}G$-regular (resp. strongly $...

extensions of regular ‎rings‎

let $r$ be an associative ring with identity. an element $x in r$ is called $mathbb{z}g$-regular (resp. strongly $mathbb{z}g$-regular) if there exist $g in g$, $n in mathbb{z}$ and $r in r$ such that $x^{ng}=x^{ng}rx^{ng}$ (resp. $x^{ng}=x^{(n+1)g}$). a ring $r$ is called $mathbb{z}g$-regular (resp. strongly $mathbb{z}g$-regular) if every element of $r$ is $mathbb{z}g$-regular (resp. strongly $...

Small bipartite subgraph polytopes

We compute a complete linear description of the bipartite subgraph polytope, for up to seven nodes, and a conjectured complete description for eight nodes. We then show how these descriptions were used to compute the integrality ratio of various relaxations of the max-cut problem, again for up to eight nodes.

Regular polytopes

Simple Extensions of Polytopes

We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P . We devise a combinatorial method to establish lower bounds on the simple extension complexity and show for several polytopes that they have large simple extension complexities. These example...