English
Related papers

Related papers: The Edge-transitive Polytopes that are not Vertex-…

200 papers

In 1885, Fedorov discovered that a convex domain can form a lattice tiling of the Euclidean plane if and only if it is a parallelogram or a centrally symmetric hexagon. This paper proves the following results: Besides parallelograms and…

Metric Geometry · Mathematics 2018-03-20 Qi Yang , Chuanming Zong

In 1956, Tutte showed that every planar 4-connected graph is hamiltonian. In this article, we will generalize this result and prove that polyhedra with at most three 3-cuts are hamiltonian. In 2002 Jackson and Yu have shown this result for…

Combinatorics · Mathematics 2018-06-05 Gunnar Brinkmann , Carol T. Zamfirescu

A ball-polyhedron is the intersection with non-empty interior of finitely many (closed) unit balls in Euclidean 3-space. One can represent the boundary of a ball-polyhedron as the union of vertices, edges, and faces defined in a rather…

Metric Geometry · Mathematics 2013-02-13 Karoly Bezdek , Marton Naszodi

A pseudo-edge graph of a convex polyhedron K is a 3-connected embedded graph in K whose vertices coincide with those of K, whose edges are distance minimizing geodesics, and whose faces are convex. We construct a convex polyhedron K in…

Metric Geometry · Mathematics 2019-03-01 Nicholas Barvinok , Mohammad Ghomi

Polypolyhedra (after R. Lang) are compounds of edge-transitive 1-skeleta. There are 54 topologically different polypolyhedra, and each has icosidodecahedral, cuboctahedral, or tetrahedral symmetry, all are realizable as modular origami…

Metric Geometry · Mathematics 2016-01-14 Sarah-Marie Belcastro , Thomas C. Hull

The Wythoff construction takes a $d$-dimensional polytope $P$, a subset $S$ of $\{0,..., d\}$ and returns another $d$-dimensional polytope $P(S)$. If $P$ is a regular polytope, then $P(S)$ is vertex-transitive. This construction builds a…

Combinatorics · Mathematics 2008-08-11 Michel Deza , Mathieu Dutour , Sergey Shpectorov

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

We show that convex pentagons that can generate edge-to-edge monohedral tilings of the plane can be classified into exactly eight types. Using these results, it is also proved that no single convex polygon can be an aperiodic prototile…

Metric Geometry · Mathematics 2017-07-11 Teruhisa Sugimoto

We classify the 3-dimensional hyperbolic polyhedral orbifolds that contain no embedded essential 2-suborbifolds, up to decomposition along embedded hyperbolic triangle orbifolds (turnovers). We give a necessary condition for a 3-dimensional…

Geometric Topology · Mathematics 2015-03-18 Shawn Rafalski

The varietal hypercube $VQ_n$ is a variant of the hypercube $Q_n$ and has better properties than $Q_n$ with the same number of edges and vertices. This paper proves that $VQ_n$ is vertex-transitive. This property shows that when $VQ_n$ is…

Combinatorics · Mathematics 2012-12-21 Li Xiao , Jin Cao , Jun-Ming Xu

This article introduces the theory of Veronese polytopes, a broad generalisation of cyclic polytopes. These arise as convex hulls of points on curves with one or more connected components, obtained as the image of the rational normal curve…

Combinatorics · Mathematics 2024-11-22 Marie-Charlotte Brandenburg , Roland Púček

A theorem of Howe states that every 3-dimensional lattice polytope $P$ whose only lattice points are its vertices, is a Cayley polytope, i.e. $P$ is the convex hull of two lattice polygons with distance one. We want to generalize this…

Combinatorics · Mathematics 2008-09-11 Jaron Treutlein

In this paper we show that graphs of "neighbourly" cubical complexes -- cubical complexes in which every pair of vertices spans a (unique) cube -- have good expansion properties, using a technique based on multicommodity flows. By showing…

Combinatorics · Mathematics 2007-05-23 Thomas Voigt

Convex polytopes are convex hulls of point sets in the $n$-dimensional space $\E^n$ that generalize 2-dimensional convex polygons and 3-dimensional convex polyhedra. We concentrate on the class of $n$-dimensional polytopes in $\E^n$ called…

Quantum Physics · Physics 2010-12-15 Colin Wilmott , Hermann Kampermann , Dagmar Bruss

Consider a lattice in a real finite dimensional vector space. Here, we are interested in the lattice polytopes, that is the convex hulls of finite subsets of the lattice. Consider the group $G$ of the affine real transformations which map…

Combinatorics · Mathematics 2007-05-23 Nicolas Ressayre , Pierre-Louis Montagard

A graph $\Gamma$ of even order is a bicirculant if it admits an automorphism with two orbits of equal length. Symmetry properties of bicirculants, for which at least one of the induced subgraphs on the two orbits of the corresponding…

Combinatorics · Mathematics 2024-12-09 Robert Jajcay , Štefko Miklavič , Primož Šparl , Gorazd Vasiljević

The notion of a spiral unfolding of a convex polyhedron, resulting by flattening a special type of Hamiltonian cut-path, is explored. The Platonic and Archimedian solids all have nonoverlapping spiral unfoldings, although among generic…

Computational Geometry · Computer Science 2015-10-20 Joseph O'Rourke

A conjecture of Fuglede states that a bounded measurable set D, of measure 1, can tile space by translations if and only if the Hilbert space L^2(D) has an orthonormal basis consisting of exponentials exp(i 2 pi lambda x). If D has the…

Classical Analysis and ODEs · Mathematics 2007-05-23 Mihail N. Kolountzakis , Michael Papadimitrakis

Cycloids, hipocycloids and epicycloids have an often forgotten common property: they are homothetic to their evolutes. But what if use convex symmetric polygons as unit balls, can we define evolutes and cycloids which are genuinely…

Differential Geometry · Mathematics 2017-02-08 Marcos Craizer , Ralph Teixeira , Vitor Balestro

We introduce a graph structure on Euclidean polytopes. The vertices of this graph are the $d$-dimensional polytopes contained in $\mathbb{R}^d$ and its edges connect any two polytopes that can be obtained from one another by either…

Metric Geometry · Mathematics 2020-01-22 Julien David , Lionel Pournin , Rado Rakotonarivo
‹ Prev 1 3 4 5 6 7 10 Next ›