We report a novel polyhedral surface of genus~3 embedded in $\mathbb{R}^3$ with eight planar, simple, non-convex nonagonal faces, 24 vertices and 36 edges, in which every two faces share at least one edge: 20 pairs of faces share one edge and 8 pairs share two collinear edges. Its face planes are $3x-4y-2z=5$, $-2x+5y-5z=3$ and their images under the half-turns about the three coordinate axes, and all vertices are rational. The polyhedron has the same face vector, face sizes and number of edge multiplicities as the polyhedron described by Mizhaev, but it is not combinatorially equivalent to it. Our realisation has the symmetry group $D_2$ of order~4, whereas Mizhaev's polyhedron has a rotoreflection symmetry. The example was found by a computational geometric search, and all its properties were verified in exact rational arithmetic.
We present an integer-coordinate realization of a genus-3 polyhedral surface with eight planar simple nonagonal faces. It has 24 vertices and 36 edges, and each vertex is incident with three faces. Every pair of faces shares an edge: 20 pairs share one edge and 8 pairs share two. Vertex coordinates, face walks, and pla...
Each of the 12 known conjecturally optimal kissing configurations in dimensions 5, 6, and 7 carries a contact-graph polytope: a polytope whose vertices are the configuration points and whose edges are exactly its contacts. Eight of these polytopes are non-convex and distinct from their convex hulls, which include longe...
Choose uniformly among the combinatorial types of convex three-dimensional polyhedra with a fixed admissible number $e$ of edges, and let $V_e$ be the number of vertices. This resolves a fixed-edge limit-distribution question posed by R\"udinger: if $\beta_e=V_e/(e+2)$, then $\sqrt e(\beta_e-1/2)\Rightarrow N(0,1/32)$,...
We prove that every configuration of four through eight points in three-dimensional space, with no four points coplanar, has a connected full geometric flip graph under $2 \leftrightarrow 3$ flips. Every point remains fixed and present throughout the sequence. The proof brings each tetrahedralization into placing form...
In this paper we construct new examples of diameter graphs and Reuleaux polyhedra in $\mathbb{R}^3$, obtaining a full characterization of their combinatorial structure. For a finite set of points $X\subset\mathbb{R}^d$, its diameter graph is the graph on vertex set $X$ where pairs forming a diameter pair are connected...
A finite family of planar convex bodies is called a non-separable family if no line disjoint from its union has at least one member in each open half-plane. In this paper, we prove that there exist finite non-separable families of positive homothetic triangles with covering factors strictly exceeding the sharp three-me...
Yan-Lu Lian, Fei Xue, Qing Yuan· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
