English
Related papers

Related papers: Dihedral angles and orthogonal polyhedra

200 papers

We formalize a ten-face triangular wing set on a regular icosahedron under a vertex labeling N, S, U1-U5, L1-L5 with rotation axis NS. The wing faces satisfy: (i) each face is an isosceles 36-36-108 triangle with a 36-degree angle anchored…

General Mathematics · Mathematics 2026-04-16 YoungJune Jeon

Let E be a point in the plane of a convex quadrilateral ABCD. The lines from E to the vertices of the quadrilateral form four triangles. If we locate a triangle center in each of these triangles, the four triangle centers form another…

History and Overview · Mathematics 2025-09-17 Stanley Rabinowitz , Ercole Suppa

Which convex 3D polyhedra can be obtained by gluing several regular hexagons edge-to-edge? It turns out that there are only 15 possible types of shapes, 5 of which are doubly-covered 2D polygons. We give examples for most of them, including…

Computational Geometry · Computer Science 2020-02-07 Elena Arseneva , Stefan Langerman

A panel structure on a topological space is just a locally finite family of closed subspaces. A space together with a panel structure is called a space with faces. In this paper, we introduce a notion of polyhedral product over a space with…

Algebraic Topology · Mathematics 2024-12-17 Li Yu

An edge-unfolding of a polyhedron is produced by cutting along edges and flattening the faces to a *net*, a connected planar piece with no overlaps. A *grid unfolding* allows additional cuts along grid edges induced by coordinate planes…

Computational Geometry · Computer Science 2007-05-23 Mirela Damian , Robin Flatland , Joseph O'Rourke

This article has been written for an educational magazine whose target audience consists of students and teachers of mathematics in universities, colleges and schools. It concerns a notion of duality between rectangles. A proof is given…

Number Theory · Mathematics 2009-06-18 Graham Everest , Jonny Griffiths

A polyhedron is pointed if it contains at least one vertex. Every pointed polyhedron P in R^n can be described by an H-representation consisting of half spaces or equivalently by a V-representation consisting of the convex hull of a set of…

Optimization and Control · Mathematics 2025-10-10 David Avis

In this paper, constructions of regular pentagon and decagon, and the calculation of the main trigonometric ratios of the corresponding central angles are approached. In this way, for didactic purposes, it is intended to show the reader…

General Mathematics · Mathematics 2019-10-29 José Gilvan de Oliveira , Moacir Rosado Filho , Domingos Sávio Valério Silva

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

This paper proves the following statement: {\it If a convex body can form a twofold translative tiling in $\mathbb{E}^3$, it must be a parallelohedron.} In other words, it must be a parallelotope, a hexagonal prism, a rhombic dodecahedron,…

Metric Geometry · Mathematics 2021-06-30 Mei Han , Qi Yang , Kirati Sriamorn , Chuanming Zong

Call {\em i-hedrite} any 4-valent n-vertex plane graph, whose faces are 2-, 3- and 4-gons only and $p_2+p_3=i$. The edges of an i-hedrite, as of any Eulerian plane graph, are partitioned by its {\em central circuits}, i.e. those, which are…

Geometric Topology · Mathematics 2007-05-23 M. Deza , M. Dutour , M. Shtogrin

We present explicit constructions of centrally symmetric polytopes with many faces: first, we construct a d-dimensional centrally symmetric polytope P with about (1.316)^d vertices such that every pair of non-antipodal vertices of P spans…

Metric Geometry · Mathematics 2011-11-21 Alexander Barvinok , Seung Jin Lee , Isabella Novik

A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are…

Metric Geometry · Mathematics 2014-03-12 István Kovács , Géza Tóth

We study spherical tetrahedra with rational dihedral angles and rational volumes. Such tetrahedra occur in the Rational Simplex Conjecture by Cheeger and Simons, and we supply vast families, discovered by computational efforts, of positive…

Metric Geometry · Mathematics 2019-10-17 Alexander Kolpakov , Sinai Robins

Every regular map on a closed surface gives rise to generally six regular maps, its "Petrie relatives", that are obtained through iteration of the duality and Petrie operations (taking duals and Petrie-duals). It is shown that the skeletal…

Combinatorics · Mathematics 2012-10-09 Anthony M. Cutler , Egon Schulte , Jorg M. Wills

We define and study a new family of polytopes which are formed as convex hulls of partial alternating sign matrices. We determine the inequality descriptions, number of facets, and face lattices of these polytopes. We also study partial…

Combinatorics · Mathematics 2022-03-09 Dylan Heuer , Jessica Striker

We consider orthogonal polynomials on the surface of a double cone or a hyperboloid of revolution, either finite or infinite in axis direction, and on the solid domain bounded by such a surface and, when the surface is finite, by…

Classical Analysis and ODEs · Mathematics 2019-12-17 Yuan Xu

A torus manifold is an even-dimensional manifold acted on by a half-dimensional torus with non-empty fixed point set and some additional orientation data. It may be considered as a far-reaching generalisation of toric manifolds from…

Algebraic Topology · Mathematics 2007-05-23 Mikiya Masuda , Taras Panov

We consider facet-Hamiltonian cycles of polytopes, defined as cycles in their skeleton such that every facet is visited exactly once. These cycles can be understood as optimal watchman routes that guard the facets of a polytope. We consider…

Combinatorics · Mathematics 2024-11-05 Hugo Akitaya , Jean Cardinal , Stefan Felsner , Linda Kleist , Robert Lauff

We show that any surface of infinite type admits an ideal triangulation. Furthermore, we show that a set of disjoint arcs can be completed into a triangulation if and only if, as a set, they intersect every simple closed curve a finite…

Geometric Topology · Mathematics 2021-02-19 Alan McLeay , Hugo Parlier
‹ Prev 1 8 9 10 Next ›