English
Related papers

Related papers: On the Archimedean or Semiregular Polyhedra

200 papers

A chiral polyhedron has a geometric symmetry group with two orbits on the flags, such that adjacent flags are in distinct orbits. Part I of the paper described the discrete chiral polyhedra in ordinary Euclidean 3-space with finite skew…

Metric Geometry · Mathematics 2007-05-23 Egon Schulte

In this paper we try to find examples of integrable natural Hamiltonian systems on the sphere $S^2$ with the symmetries of each Platonic polyhedra. Although some of these systems are known, their expression is extremely complicated; we try…

Mathematical Physics · Physics 2014-01-28 Giovanni Rastelli

We construct compact polyhedra with $m$-gonal faces whose links are generalized 3-gons. It gives examples of cocompact hyperbolic bildings of type $P(m,3)$. For $m=3$ we get compact spaces covered by Euclidean buildings of type $A_2$.

Combinatorics · Mathematics 2007-05-23 Alina Vdovina

A conjecture of Coleman implies that only finitely many quaternion algebras over the rational numbers can be the endomorphism $\mathbf{Q}$-algebras of abelian surfaces over the complex numbers which can be defined over $\mathbf{Q}$. One may…

Number Theory · Mathematics 2017-01-24 James Stankewicz

Given a finite simplicial complex L and a collection of pairs of spaces indexed by its vertex set, one can define their polyhedral product. We record a simple formula for its Euler characteristic. In special cases the formula simplifies…

Geometric Topology · Mathematics 2014-07-24 Michael W. Davis

The prism over a graph $G$ is the Cartesian product of $G$ with the complete graph on two vertices. A graph $G$ is prism-hamiltonian if the prism over $G$ is hamiltonian. We prove that every polyhedral graph (i.e. 3-connected planar graph)…

Combinatorics · Mathematics 2021-04-12 Simon Špacapan

We pose and answer several questions concerning the number of ways to fold a polygon to a polytope, and how many polytopes can be obtained from one polygon; and the analogous questions for unfolding polytopes to polygons. Our answers are,…

Computational Geometry · Computer Science 2007-05-23 Erik D. Demaine , Martin L. Demaine , Anna Lubiw , Joseph O'Rourke

We investigate the folding problem that asks if a polygon P can be folded to a polyhedron Q for given P and Q. Recently, an efficient algorithm for this problem has been developed when Q is a box. We extend this idea to regular polyhedra,…

Computational Geometry · Computer Science 2021-06-01 Tonan Kamata , Akira Kadoguchi , Takashi Horiyama , Ryuhei Uehara

The problem of finding perfect Euler cuboids or proving their non-existence is an old unsolved problem in mathematics. The second cuboid conjecture is one of the three propositions suggested as intermediate stages in proving the…

Number Theory · Mathematics 2012-01-06 Ruslan Sharipov

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

In this paper, we obtain some formulas for double nonlinear Euler sums involving harmonic numbers and alternating harmonic numbers. By using these formulas, we give new closed form sums of several quadratic Euler series through Riemann zeta…

Number Theory · Mathematics 2017-01-16 Ce Xu

In view of solving problems of geometric realizability of polyhedra with given geometric constraints, we describe the space of geometric realizations of a simply-connected triangulated euclidean polyhedron in $\mathbb{R}^3$ up to similarity…

Metric Geometry · Mathematics 2017-03-10 Maria Hempel

A way to construct and classify the three dimensional polynomially deformed algebras is given and the irreducible representations is presented. for the quadratic algebras 4 different algebras are obtained and for cubic algebras 12 different…

Mathematical Physics · Physics 2007-05-23 Bindu A. Bambah

This note establishes that every polyhedron that has a Hamiltonian quasigeodesic can be edge-unfolded to a net, and shows that the class of such polyhedra is infinite.

Computational Geometry · Computer Science 2025-06-24 Joseph O'Rourke

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 new formula is obtained in algebraic topology, in terms of Betti numbers, and a new method, called the spinal method, is suggested and developed for generating quadrangulations of closed orientable surfaces. Those surfaces arise as the…

Combinatorics · Mathematics 2013-08-14 Serge Lawrencenko

It is well known that Pythagorean triples can be parametrized by two triples of polynomials with integer coefficients. We show that no single triple of polynomials with integer coefficients in any number of variables is sufficient, but that…

Number Theory · Mathematics 2011-06-29 Sophie Frisch , Leonid Vaserstein

In this paper we consider piecewise linear (pl) isometric embeddings of Euclidean polyhedra into Euclidean space. A Euclidean polyhedron is just a metric space $\mathcal{P}$ which admits a triangulation $\mathcal{T}$ such that each…

Metric Geometry · Mathematics 2015-09-25 B. Minemyer

We show that the 2-associahedra are Eulerian, by exploiting their recursive structure.

Combinatorics · Mathematics 2019-10-23 Nathaniel Bottman , Dylan Mavrides

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