中文
相关论文

相关论文: Nonorthogonal Polyhedra Built from Rectangles

200 篇论文

When the number of non-triangular faces adjacent to a vertex $v$ is less than or equal to three, the vertex $v$ will be called (\emph{combinatorially}) \emph{rigid}. We study the number of rigid vertices and suggest a conjecture on a…

度量几何 · 数学 2017-03-16 Seonhwa Kim , Yunhi Cho

In contrast to many known results concerning periodic tilings of the Euclidean plane with pentagons, here tilings with rotational symmetry are investigated. A certain class of convex pentagons is introduced. It can be shown that for any…

度量几何 · 数学 2025-07-02 Bernhard Klaassen

We describe how to construct a dodecahedron, tetrahedron, cube, and octahedron out of pvc pipes using standard fittings.

历史与综述 · 数学 2017-05-02 David Glickenstein

In this paper, we show that Oda's question holds for $n$-dimensional simplicial reflexive polytope $P$ and lattice polytope $Q$ containing the origin, when the vertex of $Q$ is either a vertex of $P$ or the origin, provided that $P$ has no…

组合数学 · 数学 2025-11-07 Binnan Tu

We show an explicit construction in 3 dimensions for a convex, mono-monostatic polyhedron (i.e., having exactly one stable and one unstable equilibrium) with 21 vertices and 21 faces. This polyhedron is a 0-skeleton, with equal masses…

度量几何 · 数学 2022-08-10 Gábor Domokos , Flórián Kovács

We construct, for any positive integer n, a family of n congruent convex polyhedra in R^3, such that every pair intersects in a common facet. Previously, the largest such family contained only eight polytopes. Our polyhedra are Voronoi…

组合数学 · 数学 2007-05-23 Jeff Erickson

The face ring of a simplicial complex modulo m generic linear forms is shown to have finite local cohomology if and only if the link of every face of dimension m or more is `nonsingular', i.e., has the homology of a wedge of spheres of the…

交换代数 · 数学 2010-01-19 Ezra Miller , Isabella Novik , Ed Swartz

We show how to edge-unfold a new class of convex polyhedra, specifically a new class of prismatoids (the convex hull of two parallel convex polygons, called the top and base), by constructing a nonoverlapping "petal unfolding" in two new…

计算几何 · 计算机科学 2021-06-29 Vincent Bian , Erik Demaine , Rachana Madhukara

For given finite system of convex polygons in the plane which have no transversal, find such homothety transformations of polygons (having fixed centres inside given polygons) with minimal similarity ratio c>1 that the transformed system…

度量几何 · 数学 2007-05-23 Michal Kaukic

We present and apply a method for disproving the existence of polyhedral immersions in $\mathbb{R}^3$ of certain triangulations on non-orientable surfaces. In particular, it is proved that neither of the two vertex-minimal, neighborly…

几何拓扑 · 数学 2016-06-16 Undine Leopold

A rectilinear polygon is a polygon whose edges are axis-aligned. Walking counterclockwise on the boundary of such a polygon yields a sequence of left turns and right turns. The number of left turns always equals the number of right turns…

We consider triangle faced convex polyhedra inscribed in the unit sphere $S^2$ in ${\Bbb{R}}^3$. One way of measuring their deviation from regular polyhedra with triangular faces is to consider the quotient of the lengths of the longest and…

度量几何 · 数学 2019-09-09 E. Makai,

We construct new topological invariants of three-dimensional manifolds which can, in particular, distinguish homotopy equivalent lens spaces L(7,1) and L(7,2). The invariants are built on the base of a classical (not quantum) solution of…

几何拓扑 · 数学 2015-06-26 I. G. Korepanov , E. V. Martyushev

In the study of monostatic polyhedra, initiated by John H. Conway in 1966, the main question is to construct such an object with the minimal number of faces and vertices. By distinguishing between various material distributions and…

度量几何 · 数学 2023-04-17 Dávid Papp , Krisztina Regős , Gábor Domokos , Sándor Bozóki

A longstanding open question of Archdeacon and Craft asks whether every complete graph has a minimum genus embedding with at most one nontriangular face. We exhibit such an embedding for each complete graph except $K_8$, the complete graph…

组合数学 · 数学 2018-08-31 Timothy Sun

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…

组合数学 · 数学 2020-06-01 Gabe Cunningham , Mark Mixer

A tiling of a topological disc by topological discs is called monohedral if all tiles are congruent. Maltby (J. Combin. Theory Ser. A 66: 40-52, 1994) characterized the monohedral tilings of a square by three topological discs. Kurusa,…

度量几何 · 数学 2023-06-27 Bushra Basit , Zsolt Lángi

We explore some generalizations of fullerenes F_v (simple polyhedra with v vertices and only 5- and 6-gonal faces) seen as (d-1)-dimensional simple manifolds (preferably, spherical or polytopal) with only 5- and 6-gonal 2-faces. First,…

组合数学 · 数学 2007-05-23 M. Deza , M. I. Shtogrin

A simple cut-and-patch method is presented for the construction and classification for fullerenes belonging to the octahedral point groups, $O$ or $O_h$. In order to satisfy the symmetry requirement of the octahedral group, suitable numbers…

原子与分子团簇 · 物理学 2014-06-30 Yuan-Jia Fan , Bih-Yaw Jin

We describe computer algorithms that produce the complete set of isohedral tilings by n-omino or n-iamond tiles in which the tiles are fundamental domains and the tilings have 3-, 4-, or 6-fold rotational symmetry. The symmetry groups of…

计算几何 · 计算机科学 2012-01-17 Hiroshi Fukuda , Chiaki Kanomata , Nobuaki Mutoh , Gisaku Nakamura , Doris Schattschneider