Related papers: On LP-orientations of cubes and crosspolytopes
Two distinct isotopy-isomorphy conditions, different from those of J. M. Osborn and Wilson's condition, for a weak inverse property loop(WIPL) are shown. Only one of them characterizes isotopy-isomorphy in WIPLs while the other is just a…
We consider two polytopes. The quadratic assignment polytope $QAP(n)$ is the convex hull of the set of tensors $x\otimes x$, $x \in P_n$, where $P_n$ is the set of $n\times n$ permutation matrices. The second polytope is defined as follows.…
In this paper, we give a characterization of the visibility graphs of pseudo-polygons. We first identify some key combinatorial properties of pseudo-polygons, and we then give a set of five necessary conditions based off our identified…
In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete…
A primary goal in this paper is to study the question that asks when a real analytic submanifold $M$ in ${\mathbb{C}}^{n+1}$ bounds a real analytic (up to $M$) Levi-flat hypersurface $\hat{M}$ near $p\in M$ such that $\hat{M}$ is foliated…
We prove that the combinatorial optimization problem of determining the hull number of a partial cube is NP-complete. This makes partial cubes the minimal graph class for which NP-completeness of this problem is known and improves some…
When can a polyomino piece of paper be folded into a unit cube? Prior work studied tree-like polyominoes, but polyominoes with holes remain an intriguing open problem. We present sufficient conditions for a polyomino with one or several…
We prove that there are 0/1 polytopes P that do not admit a compact LP formulation. More precisely we show that for every n there is a sets X \subseteq {0,1}^n such that conv(X) must have extension complexity at least 2^{n/2 * (1-o(1))}. In…
This article gives necessary and sufficient conditions for a relation to be the containment relation between the facets and vertices of a polytope. Also given here, are a set of matrices parameterizing the linear moduli space and another…
We present sufficient conditions for the cohomology of a closed aspherical manifold to be proper Lipschitz in sense of Connes-Gromov-Moscovici [CGM]. The conditions are stated in terms of the Stone-\v{C}ech compactification of the universal…
We establish some geometric constraints on compact Coxeter polytopes in hyperbolic spaces and show that these constraints can be a very useful tool for the classification problem of reflective anisotropic Lorentzian lattices and cocompact…
We determine necessary and sufficient conditions for real algebraic curves near the non-singular tropical limit to be hyperbolic with respect to a point, thus generalising Speyer's classification of stable curves near the tropical limit. In…
The tilt pattern of the CuO_6 octahedra in the LTT phase of the cuprate superconductors leads to planar anisotropies for the exchange coupling and hopping integrals. Here, we show that these anisotropies provide a possible structural…
Consider a variant of the graph diameter of a polyhedron where each step in a walk between two vertices travels maximally in a circuit direction instead of along incident edges. Here circuit directions are non-trivial solutions to…
Klee's Measure Problem (KMP) asks for the volume of the union of n axis-aligned boxes in d-space. Omitting logarithmic factors, the best algorithm has runtime O*(n^{d/2}) [Overmars,Yap'91]. There are faster algorithms known for several…
This paper establishes a necessary and sufficient condition for $L^p$-boundedness of a class of multilinear functionals which includes both the Brascamp-Lieb inequalities and generalized Radon transforms associated to algebraic incidence…
The purpose of this paper is twofold. We investigate a simple necessary condition, called the rhombus criterion, for two vertices in a polytope not to form an edge and show that in many examples of $0/1$-polytopes it is also sufficient. We…
The orbit graph of a k-orbit polytope is a graph on k nodes that shows how the flag orbits are related by flag adjacency. Using orbit graphs, we classify k-orbit polytopes and determine when a k-orbit polytope is i-transitive. We then…
Which polyominoes can be folded into a cube, using only creases along edges of the square lattice underlying the polyomino, with fold angles of $\pm 90^\circ$ and $\pm 180^\circ$, and allowing faces of the cube to be covered multiple times?…
We extend the assertion of the Generalized Lower Bound Theorem (GLBT) to general polytopes under the assumption that their low dimensional skeleton is simplicial, with partial results for the general case. We prove a quantitative version of…