Related papers: Construction and Analysis of Projected Deformed Pr…
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is \textit{$k$-linked} if,…
We are generalizing to higher dimensions the Bavard-Ghys construction of the hyperbolic metric on the space of polygons with fixed directions of edges. The space of convex d-dimensional polyhedra with fixed directions of facet normals has a…
We investigate a novel setting for polytope rigidity, where a flex must preserve edge lengths and the planarity of faces, but is allowed to change the shapes of faces. For instance, the regular cube is flexible in this notion. We present…
We consider several families of combinatorial polytopes associated with the following NP-complete problems: maximum cut, Boolean quadratic programming, quadratic linear ordering, quadratic assignment, set partition, set packing, stable set,…
We consider the problem of approximating a two-dimensional shape contour (or curve segment) using discrete assembly systems, which allow to build geometric structures based on limited sets of node and edge types subject to edge length and…
We characterize the sets $\XX$ of all products $PQ$, and $\YY$ of all products $PQP$, where $P,Q$ run over all orthogonal projections and we solve the problems $\arg\min\{\|P-Q\|: (P,Q) \in \cal Z\}$, for $\cal Z=\XX$ or $\YY.$ We also…
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. We deal with the connectivity of the graphs of cubical polytopes. We first establish that, for any $d\ge 3$, the graph of a cubical $d$-polytope…
We describe and analyze a new construction that produces new Eulerian lattices from old ones. It specializes to a construction that produces new strongly regular cellular spheres (whose face lattices are Eulerian). The construction does not…
A deformed differential calculus is developed based on an associative star-product. In two dimensions the Hamiltonian vector fields model the algebra of pseudo-differential operator, as used in the theory of integrable systems. Thus one…
We prove that every 4-polytope is determined by its edge-polygon incidences, solving an open problem of Gr\"unbaum. For each $d \geq 3$, we show that not every $d$-polytope is determined by its $(d-3)$-skeleton and dual $(d-3)$-skeleton…
This paper considers the question of how to succinctly approximate a multidimensional convex body by a polytope. Given a convex body $K$ of unit diameter in Euclidean $d$-dimensional space (where $d$ is a constant) and an error parameter…
We investigate the algebro-geometric structure of a novel two-parameter quantum deformation which exhibits the nature of a semidirect or cross-product algebra built upon GL(2) x GL(1), and is related to several other known examples of…
We study the biparametric quantum deformation of GL(2) x GL(1) and exhibit its cross-product structure. We derive explictly the associated dual algebra, i.e., the quantised universal enveloping algebra employing the R-matrix procedure. This…
We present explicit constructions of centrally symmetric 2-neighborly d-dimensional polytopes with about 3^{d/2} = (1.73)^d vertices and of centrally symmetric k-neighborly d-polytopes with about 2^{c_k d} vertices where c_k=3/20 k^2 2^k.…
We study real nonsingular projective cubic fourfolds up to deformation equivalence combined with projective equivalence and prove that they are classified by the conjugacy classes of involutions induced by the complex conjugation in the…
Using the decomposition of semimagic squares into the associated and balanced symmetry types as a motivation, we introduce an equivalent representation in terms of block-structured matrices. This block representation provides a way of…
It is possible for a combinatorial type of polytope to have both decomposable and indecomposable realizations; here decomposability is meant with respect to Minkowski addition. Such polytopes are called conditionally decomposable. We show…
This paper is a continuation of our previous work in which we defined the notion of a polytope complex and its $K$-theory. In this paper we produce formulas for the delooping of a simplicial polytope complex and the cofiber of a morphism of…
Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…
This paper gives a complete classification of linear repetitivity (LR) for a natural class of aperiodic Euclidean cut and project schemes with convex polytopal windows. Our results cover those cut and project schemes for which the lattice…