Related papers: Generic Orthotopes

We consider a generalized angle in complex normed vector spaces. Its definition corresponds to the definition of the well known Euclidean angle in real inner product spaces. Not surprisingly it yields complex values as `angles'. This…

The notion of the orbifold Euler characteristic came from physics at the end of 80's. There were defined higher order versions of the orbifold Euler characteristic and generalized ("motivic") versions of them. In a previous paper the…

This is both an expository and research paper where we advocate a systematic study of continuous analogues of finite partially ordered sets, convex polytopes, oriented matroids, arrangements of subspaces, finite simplicial complexes, and…

Let $M$ be a subset of vector space or projective space. The authors define the \emph{generalized configuration space} of $M$ which is formed by $n$-tuples of elements of $M$ where any $k$ elements of each $n$-tuple are linearly…

Coordination geometries describe how the neighbours of a central particle are arranged around it. Such geometries can be thought to lie in an abstract topological space; a model of this space could provide a mathematical basis for…

Generalized alcoved polytopes are polytopes whose facet normals are roots in a given root system. We call a set of points in an alcoved polytope a generating set if there does not exist a strictly smaller alcoved polytope containing it. The…

Call a pure Hodge structure geometric if it is contained in the cohomology of a smooth complex projective variety. The main goal is to show that for any set of Hodge numbers (subject to the obvious constraints), there exists a geometric…

A rectangulation is a tiling of a rectangle by a finite number of rectangles. The rectangulation is called generic if no four of its rectangles share a single corner. We initiate the enumeration of generic rectangulations up to…

We revisit a classical theme of (general or translation invariant) valuations on convex polyhedra. Our setting generalizes the classical one, in a ``dual'' direction to previously considered generalizations: while previous research was…

We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of…

This paper presents an additional class of regular polyhedra--envelope polyhedra--made of regular polygons, where the arrangement of polygons (creating a single surface) around each vertex is identical; but dihedral angles between faces…

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…

When the standard representation of a crystallographic Coxeter group is reduced modulo an odd prime p, one obtains a finite group G^p acting on some orthogonal space over Z_p . If the Coxeter group has a string diagram, then G^p will often…

Generalised contact structures are studied from the point of view of reduced generalised complex structures, naturally incorporating non-coorientable structures as non-trivial fibering. The infinitesimal symmetries are described in detail,…

An orbitope is the convex hull of an orbit of a compact group acting linearly on a vector space. These highly symmetric convex bodies lie at the crossroads of several fields, in particular convex geometry, optimization, and algebraic…

This paper is devoted to the study of the $m$-point homogeneity property for the vertex sets of polytopes in Euclidean spaces. In particular, we present the classifications of $2$-point and $3$-point homogeneous polyhedra in $\mathbb{R}^3$.

We develop a generalized covering space theory for a class of uniform spaces called coverable spaces. Coverable spaces include all geodesic metric spaces, connected and locally pathwise connected compact topological spaces, in particular…

Starting from any finite simple graph, one can build a reflexive polytope known as a symmetric edge polytope. The first goal of this paper is to show that symmetric edge polytopes are intrinsically matroidal objects: more precisely, we…

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…

We introduce the notion of weighted Coxeter graph and associate to it a certain generalization of the standard geometric representation of a Coxeter group. We prove sufficient conditions for faithfulness and non-faithfulness of such a…