Related papers: Construction and Analysis of Projected Deformed Pr…
We construct a new 2-parameter family E_mn of self-dual 2-simple and 2-simplicial 4-polytopes, with flexible geometric realisations. E_44 is the 24-cell. For large m,n the f-vectors have ``fatness'' close to 6. The E_t-construction of…
The Lasserre's reconstruction algorithm is extended to the D-polytopes with the construction of their shape space. Thus, the areas of d-skeletons $(1\leq d\leq D)$ can be expressed as functions of the areas and normal bi-vectors of the…
We describe the constructible derived category of sheaves on the $n$-sphere, stratified in a point and its complement, as a dg module category of a formal dg algebra. We prove formality by exploring two different methods: As a combinatorial…
It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2…
Faces play a central role in the combinatorial and computational aspects of polyhedra. In this paper, we present the first formalization of faces of polyhedra in the proof assistant Coq. This builds on the formalization of a library…
In this paper, we present a new method for computing the f-vector of a marked order polytope. Namely, given an arbitrary (polyhedral) subdivision of an arbitrary convex polytope, we construct a cochain complex (over the two-element field…
We describe a construction for d-polytopes generalising the well known stacking operation. The construction is applied to produce 2-simplicial and 2-simple 4-polytopes with g_2=0 on any number of n >= 13 vertices. In particular, this…
For each $d\geq 3$ we construct cube complexes homeomorphic to the $d$-sphere with $n$ vertices in which the number of facets (assuming $d$ constant) is $\Omega(n^{5/4})$. This disproves a conjecture of Kalai's stating that the number of…
A Coxeter polytope is a convex polytope in a real projective space equipped with linear reflections in its facets, such that the orbits of the polytope under the action of the group generated by the linear reflections tessellate a convex…
Given two convex polytopes, the join, the cartesian product and the direct sum of them are well understood. In this paper we extend these three kinds of products to abstract polytopes and introduce a new product, called the topological…
The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…
We develop tools for characterizing vertices of fiber products of polytopes and apply them to simplicial distribution polytopes, a class of probability polytopes arising in quantum foundations and quantum information. In the theory of…
The deformation space of real projective structures parametrizes the space of the convex real projective structures on an orbifold. The Coxeter orbifold can be obtained $D^2(;n_1,n_2,n_3,n_4)\times\mathbb{R}$ by embedding the Coxeter…
The deformed double covering of E(2) group, denoted by $\tilde{E}_\kappa(2)$, is obtained by contraction from the $SU_\mu(2)$. The contraction procedure is then used for producing a new examples of differential calculi: 3D-left covariant…
A new predictor-corrector type incremental algorithm is proposed for the exact construction of weighted straight skeletons of 2D general planar polygons of arbitrary complexity based on the notion of deforming polygon. In the proposed…
4-dimensional $A_{4}$ polytopes and their dual polytopes have been constructed as the orbits of the Coxeter-Weyl group $W(A_{4})$ where the group elements and the vertices of the polytopes are represented by quaternions. Projection of an…
We present a simple geometric construction linking geometric to deformation quantization. Both theories depend on some apparently arbitrary parameters, most importantly a polarization and a symplectic connection, and for real polarizations…
The problem of polycube construction or deformation is an essential problem in computer graphics. In this paper, we present a robust, simple, efficient and automatic algorithm to deform the meshes of arbitrary shapes into their polycube…
Factorization structures occur in toric differential and discrete geometry, and can be viewed in multiple ways, e.g., as objects determining substantial classes of explicit toric Sasaki and K\"ahler geometries, as special coordinates on…
This is the third in a series of papers which give an explicit description of the reconstruction algebra as a quiver with relations; these algebras arise naturally as geometric generalizations of preprojective algebras of extended Dynkin…