Related papers: Eberhard-type theorems with two kinds of polygons
This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…
We investigate similarities between the category of vector spaces and that of polytopal algebras, containing the former as a full subcategory. In Section 2 we introduce the notion of a polytopal Picard group and show that it is trivial for…
It is well known that there exist twenty two symmetry type graphs associated to 4-orbit maps. For this ones we give the feasible values taken by the degree of the vertices and the number appropriate of edges in the boundary of each face of…
We introduce orbifolds from the classical point of view, using charts, and present orbifold versions of elementary objects from Algebraic Topology, such as the fundamental group, coverings and Euler characteristic; Differential…
Wythoff's construction associates a uniform polytope to a Coxeter diagram whose vertices are decorated with crosses, which indicate the subgroup stabilizing a generic point. Champagne, Kjiri, Patera, and Sharp remarked that by associating…
Orbifolds of two-dimensional quantum field theories have a natural formulation in terms of defects or domain walls. This perspective allows for a rich generalisation of the orbifolding procedure, which we study in detail for the case of…
We discuss various old and new definitions of the notion of a vector field on a convenient manifold that can be proved to give rise to Lie algebras, and are in finite dimensions equivalent to the standard notion of a vector field.
Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…
Bidirectional typechecking, in which terms either synthesize a type or are checked against a known type, has become popular for its scalability (unlike Damas-Milner type inference, bidirectional typing remains decidable even for very…
Let $M$ be a $2$-space form. Let $P$ be a convex polygon in $M$. For these polygons, we define (and justify) a curvature $\kappa_i$ at each vertex $A_i$ of the polygon and and prove the following Blaschke's type theorem: If $P$ is a convex…
Group field theories are a generalization of matrix models which provide both a second quantized reformulation of loop quantum gravity as well as generating functions for spin foam models. While states in canonical loop quantum gravity, in…
We study unbounded 2-dimensional metric polytopes such as those arising as K\"ahler quotients of complete K\"ahler 4-manifolds with two commuting symmetries and zero scalar curvature. Under a mild closedness condition, we obtain a complete…
We prove discrete analogs of four-vertex type theorems of spherical curves, which imply corresponding results for space polygons. The smooth theory goes back to the work of Beniamino Segre and, more recently, by Mohammad Ghomi, and consists…
A first-order theory has the Schroder-Bernstein property if any two of its models that are elementarily bi-embeddable are isomorphic. We prove that if a countable theory T has the Schroder-Bernstein property then it is classifiable (it is…
A toric polyhedron is a reduced closed subscheme of a toric variety that are partial unions of the orbits of the torus action. We prove vanishing theorems for toric polyhedra. We also give a proof of the $E_1$-degeneration of Hodge to de…
For a Riemannian polyhedra, we study the geometry of the unit ball for the unidimensional stable norm (stable ball). In the case of a unidimensional Riemannian polyhedra (graph), we show that the stable ball is a polytope whose vertices are…
Cartwright-type and Bernstein-type theorems, previously known only for functions of exponential type in $\C^n$, are extended to the case of functions of arbitrary order in a cone.
We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the…
B\'ar\'any, Kalai, and Meshulam recently obtained a topological Tverberg-type theorem for matroids, which guarantees multiple coincidences for continuous maps from a matroid complex to d-dimensional Euclidean space, if the matroid has…
A projective mirror polyhedron is a projective polyhedron endowed with reflections across its faces. We construct an explicit diffeomorphism between the moduli space of a mirror projective polyhedron with fixed dihedral angles in…