Related papers: On the Archimedean or Semiregular Polyhedra
In Euclidean geometry, the Pythagorean theorem is presented as an equation involving three squares. This paper explores how analogous expressions may be identified in spherical and hyperbolic geometries.
Bosse et al. conjectured that for every natural number $d \ge 2$ and every $d$-dimensional polytope $P$ in $\real^d$ there exist $d$ polynomials $p_0(x),...,p_{d-1}(x)$ satisfying $P=\{x \in \mathbb{R}^d : p_0(x) \ge 0, >..., p_{d-1}(x) \ge…
We enumerate and classify all the semi equivelar maps on the surface of $ \chi=-2 $ with up to 12 vertices. We also determine which of these are vertex-transitive and which are not.
An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). It is a long unsolved problem to determine whether every polyhedron…
An orthant polyhedron is a polyhedron with $m$ hyperfaces, that could be realized as a section of the $m$-dimensional non-negative orthant. We classify all 2-dimensional orthant polyhedra and provide some partial results towards the…
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…
We prove that every homogeneous convex polyhedron with only one unstable equilibrium (known as a mono-unstable convex polyhedron) has at least $7$ vertices. Although it has been long known that no mono-unstable tetrahedra exist, and…
We find all polyhedral graphs such that their complements are still polyhedral. These turn out to be all self-complementary.
A closed quasigeodesic is a closed curve on the surface of a polyhedron with at most $180^\circ$ of surface on both sides at all points; such curves can be locally unfolded straight. In 1949, Pogorelov proved that every convex polyhedron…
We present a simple algorithm for determining the extremal points in Euclidean space whose convex hull is the nth polytope in the sequence known as the multiplihedra. This answers the open question of whether the multiplihedra could be…
We prove that the regular octahedron has the minimal surface area among 3-polytopes of given volume and having at most six vertices.
The space of shapes of a polyhedron with given total angles less than 2\pi at each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take…
The celebrated upper bound theorem of McMullen determines the maximal number of extreme points of a polyhedron in terms of its dimension and the number of constraints which define it, showing that the maximum is attained by the polar of the…
We use the octonion algebra to construct singular solutions of Hessian fully nonlinear uniformly elliptic equations in 21 or more dimensions. The regularity of these solutions is the least possible one. The same is proven for Isaacs…
In this paper, we study some properties of Euler polynomials arising from umbral calculus. Finally, we give some interesting identities of Euler polynomials using our results. Recently, Dere and Simsek have studied umbral calculus related…
An explicit construction of closed, orientable, smooth, aspherical 4-manifolds with any odd Euler characteristic greater than 12 is presented. The manifolds constructed here are all Haken manifolds in the sense of B. Foozwell and H.…
We study the abstract regular polyhedra with automorphism groups that act faithfully on their vertices, and show that each non-flat abstract regular polyhedron covers a "vertex-faithful" polyhedron with the same number of vertices. We then…
Nobody has discovered any perfect cuboid and there is no formula to deliver all possible Euler bricks. During investigations of famous open problems regarding the perfect cuboid and Euler brick; I have found new important conjectures on…
We prove that any simple polytope (and some non-simple polytopes) in $\mathbb R^3$ admits an inscribed regular octahedron.
In this paper we prove that the surface of the cuboctahedron can be triangulated into 8 non-obtuse triangles and 12 acute triangles. Furthermore, we show that both bounds are the best possible.