Related papers: Orbitopes
We consider a class of right-angled Coxeter orbifolds, named as simple orbifolds, which are a generalization of simple polytopes. Similarly to manifolds over simple polytopes, the topology and geometry of manifolds over simple orbifolds are…
A hyperbolic reflection group is a discrete group generated by reflections in the faces of an $n$-dimensional hyperbolic polyhedron. This survey article is dedicated to the study of arithmetic hyperbolic reflection groups with an emphasis…
A convexity point of a convex body is a point with the property that the union of the body and its reflection in the point is convex. It is proved that in the plane a typical convex body (in the sense of Baire category) has infinitely many…
A classic theorem by Steinitz states that a graph G is realizable by a convex polyhedron if and only if G is 3-connected planar. Zonohedra are an important subclass of convex polyhedra having the property that the faces of a zonohedron are…
Multiple orthogonal polynomials are a generalization of orthogonal polynomials in which the orthogonality is distributed among a number of orthogonality weights. They appear in random matrix theory in the form of special determinantal point…
Regular polygonal complexes in euclidean 3-space are discrete polyhedra-like structures with finite or infinite polygons as faces and with finite graphs as vertex-figures, such that their symmetry groups are transitive on the flags. The…
The main purpose of this paper is to study the vector groupoids. This is an algebraic structure which combines the concepts of Brandt groupoid and vector space such that these are compatible.
A query, about the orbit $P{\cal W}$ in real 3-space of a point $P$ under an isometry group ${\cal W}$ generated by edge rotations of a tetrahedron, leads to contrasting notions, ${\cal W}$ versus ${\cal S}$, of "rotation group". The set R…
We study orbit spaces of generalized gradient vector fields for Morse functions. Typically, these orbit spaces are non-Hausdorff. Nevertheless, they are quite structured topologically and are amenable to study. We show that these orbit…
The random polytope $K_n$, defined as the convex hull of $n$ points chosen uniformly at random on the boundary of a smooth convex body, is considered. Proofs for lower and upper variance bounds, strong laws of large numbers and central…
We study a class of coadjoint orbits of the area preserving diffeomorphism group of the plane consisting of vortex loops, namely closed curves in the plane decorated with one-forms (vorticity densities) allowed to have zeros.
Let $P$ be a set of $n$ points in the plane. We consider a variation of the classical Erd\H{o}s-Szekeres problem, presenting efficient algorithms with $O(n^3)$ running time and $O(n^2)$ space complexity that compute: (1) A subset $S$ of $P$…
Geodesic orbit manifolds (or g.o. manifolds) are those Riemannian manifolds $(M,g)$ whose geodesics are integral curves of Killing vector fields. Equivalently, there exists a Lie group $G$ of isometries of $(M,g)$ such that any geodesic…
The fundamental geometry of self-similar sets becomes significantly more complex when the generating contractive maps include non-trivial rotational components. A well-known family exemplifying this complexity is that of the dragon curves…
We give a partial description of the (s,t)-p-path polytope of a directed graph D which is the convex hull of the incidence vectors of simple directed (s,t)-paths in D of length p. First, we point out how the (s,t)-p-path polytope is located…
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…
An outerplanar graph is a planar graph that has a planar drawing with all vertices on the unbounded face. The matching complex of a graph is the simplicial complex whose faces are subsets of disjoint edges of the graph. In this paper we…
The bottom complex of a finite polyhedal pointed rational cone is the lattice polytopal complex of the compact faces of the convex hull of nonzero lattice points in the cone. The algebra, associated to the bottom complex of a cone, defines…
We show that a finite unitary group which has orbits spanning the whole space is necessarily the setwise stabilizer of a certain orbit.
Unlike the situation in the classical theory of convex polytopes, there is a wealth of semi-regular abstract polytopes, including interesting examples exhibiting some unexpected phenomena. We prove that even an equifacetted semi-regular…