English
Related papers

Related papers: Regular Polyhedra of Index Two, II

200 papers

Let X be a space of constant curvature and P be a convex polyhedron in X. A Coxeter decomposition of the polyhedron P is a decomposition of P into finitely many Coxeter polyhedra, such that any two polyhedra having a common facet are…

Metric Geometry · Mathematics 2007-05-23 A. Felikson

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…

Combinatorics · Mathematics 2007-07-30 Barry Monson , Egon Schulte

We construct some example of a closed nondegenerate nonflexible polyhedron $P$ in Euclidean 3-space that is the limit of a sequence of nondegenerate flexible polyhedra each of which is combinatorially equivalent to $P$. This implies that…

Metric Geometry · Mathematics 2015-08-18 Victor Alexandrov

A Fuchsian polyhedron in hyperbolic space is a polyhedral surface invariant under the action of a Fuchsian group of isometries (i.e. a group of isometries leaving globally invariant a totally geodesic surface, on which it acts cocompactly).…

Differential Geometry · Mathematics 2007-05-23 François Fillastre

Recently the classification of all possible faithful transitive permutation representations of the group of symmetries of a regular toroidal map was accomplished. In this paper we complete this investigation on a surface of genus 1…

Group Theory · Mathematics 2020-05-19 Maria Elisa Fernandes , Claudio Alexandre Piedade

We review 28 uniform partitions of 3-space in order to find out which of them have graphs (skeletons) embeddable isometrically (or with scale 2) into some cubic lattice ${\bf Z}_n$. We also consider some relatives of those 28 partitions,…

Metric Geometry · Mathematics 2007-05-23 M. Deza , M. I. Shtogrin

We discuss a polyhedral embedding of the classical Fricke-Klein regular map of genus 5 in ordinary 3-space. This polyhedron was originally discovered by Grunbaum in 1999, but was recently rediscovered by Brehm and Wills. We establish…

Combinatorics · Mathematics 2016-11-26 Gabor Gevay , Egon Schulte , Jorg M. Wills

We show that several classes of polyhedra are joined by a sequence of O(1) refolding steps, where each refolding step unfolds the current polyhedron (allowing cuts anywhere on the surface and allowing overlap) and folds that unfolding into…

Computational Geometry · Computer Science 2023-10-27 Erik D. Demaine , Martin L. Demaine , Jenny Diomidova , Tonan Kamata , Ryuhei Uehara , Hanyu Alice Zhang

We discuss the computation of automorphism groups and normal forms of cones and polyhedra in Normaliz, and indicate its implementation via nauty. The types of automorphisms include integral, rational, Euclidean and combinatorial, as well as…

Combinatorics · Mathematics 2021-12-16 Winfried Bruns

A graph $\G$ with a group $H$ of automorphisms acting semiregularly on the vertices with two orbits is called a {\em bi-Cayley graph} over $H$. When $H$ is a normal subgroup of $\Aut(\G)$, we say that $\G$ is {\em normal} with respect to…

Combinatorics · Mathematics 2016-07-15 Jin-Xin Zhou

Consider an orthogonal polyhedron, i.e., a polyhedron where (at least after a suitable rotation) all faces are perpendicular to a coordinate axis, and hence all edges are parallel to a coordinate axis. Clearly, any facial angle and any…

Computational Geometry · Computer Science 2013-12-25 Therese Biedl , Martin Derka , Stephen Kiazyk , Anna Lubiw , Hamide Vosoughpour

A rotation in a Euclidean space V is an orthogonal map on V which acts locally as a plane rotation with some fixed angle. We give a classification of all pairs of rotations in finite-dimensional Euclidean space, up to simultaneous…

Representation Theory · Mathematics 2009-07-09 Erik Darpö

Finite connected cubic symmetric graphs of girth 6 have been classified by K. Kutnar and D. Maru\v{s}i\v{c}, in particular, each of these graphs has an abelian automorphism group with two orbits on the vertex set. In this paper all cubic…

Combinatorics · Mathematics 2015-04-14 Hiroki Koike , István Kovács

In this article we consider an open conjecture about coherently labelling a polyhedron in three dimensions. We exhibit all the forty eight possible coherent labellings of a tetrahedron. We also exhibit that some simplicial polyhedra like…

Combinatorics · Mathematics 2022-11-28 C. P. Anil Kumar

A graph admitting an automorphism with two orbits of the same length is called a bicirculant. Recently, Jajcay et al. initiated the investigation of the edge-transitive bicirculants with the properties that one of the subgraphs induced by…

Combinatorics · Mathematics 2021-11-16 István Kovács , János Ruff

We show that the isometry group of a polyhedral Hilbert geometry coincides with its group of collineations (projectivities) if and only if the polyhedron is not an n-simplex with n>=2. Moreover, we determine the isometry group of the…

Metric Geometry · Mathematics 2009-04-22 Bas Lemmens , Cormac Walsh

For any given finite group, Schulte and Williams (2015) establish the existence of a convex polytope whose combinatorial automorphisms form a group isomorphic to the given group. We provide here a shorter proof for a stronger result: the…

Combinatorics · Mathematics 2017-09-18 Jean-Paul Doignon

The discovery of binary and triple asteroids in addition to the execution of space missions to minor celestial bodies in the past several years have focused increasing attention on periodic orbits around irregular-shaped celestial bodies.…

Earth and Planetary Astrophysics · Physics 2016-11-01 Yu Jiang , Hexi Baoyin

When the standard representation of a crystallographic Coxeter group $\Gamma$ is reduced modulo an odd prime $p$, a finite representation in some orthogonal space over $\mathbb{Z}_p$ is obtained. If $\Gamma$ has a string diagram, the latter…

Metric Geometry · Mathematics 2007-05-23 Barry Monson , Egon Schulte

The classical Cauchy rigidity theorem for convex polytopes reads that if two convex polytopes have isometric developments then they are congruent. In other words, we can decide whether two polyhedra are isometric or not by using their…

Metric Geometry · Mathematics 2023-03-28 Victor Alexandrov
‹ Prev 1 4 5 6 7 8 10 Next ›