English
Related papers

Related papers: Polyhedra with hexagonal and triangular faces and …

200 papers

A Tangle is a smooth simple closed curve formed from arcs (or ``links'') of circles with fixed radius. Most previous study of Tangles has dealt with the case where these arcs are quarter-circles, but Tangles comprised of thirds and sixths…

Combinatorics · Mathematics 2024-06-03 Rebecca M. Bowen , Sadie Pruitt , Douglas A. Torrance

This paper investigates the problem of listing faces of combinatorial polytopes, such as hypercubes, permutahedra, associahedra, and their generalizations. Firstly, we consider the face lattice, which is the inclusion order of all faces of…

I discuss the symmetry of fullerenes, viruses and geodesic domes within a unified framework of icosadeltahedral representation of these objects. The icosadeltahedral symmetry is explained in details by examination of all of these…

Popular Physics · Physics 2007-11-26 Antonio Siber

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

For a fixed integer h>=1, let G be a tripartite graph with N vertices in each vertex class, N divisible by 6h, such that every vertex is adjacent to at least 2N/3+h-1 vertices in each of the other classes. We show that if N is sufficiently…

Combinatorics · Mathematics 2016-05-24 Ryan R. Martin , Yi Zhao

A well-known result in the study of convex polyhedra, due to Minkowski, is that a convex polyhedron is uniquely determined (up to translation) by the directions and areas of its faces. The theorem guarantees existence of the polyhedron…

Computational Geometry · Computer Science 2017-12-06 Giuseppe Sellaroli

A fullerene graph is a 3-connected cubic planar graph with pentagonal and hexagonal faces. The leapfrog transformation of a planar graph produces the trucation of the dual of the given graph. A fullerene graph is leapfrog if it can be…

Combinatorics · Mathematics 2019-10-10 František Kardoš , Martina Mockovčiaková

In the present paper we study $\SXR$ and $\HXR$ geometries, which are homogeneous Thurston 3-geometries. We define and determine the generalized Apollonius surfaces and with them define the "surface of a geodesic triangle". Using the above…

Metric Geometry · Mathematics 2020-12-14 Jenő Szirmai

The present article includes the enumeration of $n$-polygons with two certain symmetry properties: For a number $3m$ of vertices, we count the $3m$-polygons with $m$ symmetry axes and the $3m$-polygons, that match after three elementary…

Combinatorics · Mathematics 2019-11-22 Rolf Haag

We establish a simple generalization of a known result in the plane. The simplices in any pure simplicial complex in R^d may be colored with d+1 colors so that no two simplices that share a (d-1)-facet have the same color. In R^2 this says…

Discrete Mathematics · Computer Science 2010-12-21 Joseph O'Rourke

Let X^{circ} be the space of all labeled tetrahedra in P^{3}. In [BGS] we constructed a smooth symmetric compactification X-tilde of X^{circ}. In this article we show that the complement X-tilde smallsetminus X^{circ} is a divisor with…

Algebraic Geometry · Mathematics 2007-05-23 Eric Babson , Paul E. Gunnells , Richard Scott

This article introduces the theory of Veronese polytopes, a broad generalisation of cyclic polytopes. These arise as convex hulls of points on curves with one or more connected components, obtained as the image of the rational normal curve…

Combinatorics · Mathematics 2024-11-22 Marie-Charlotte Brandenburg , Roland Púček

3D-facets of the Delone cells representing the deep and shallow holes of the root lattice D6 which tile the six-dimensional Euclidean space in an alternating order are projected into three-dimensional space. They are classified into six…

Metric Geometry · Mathematics 2021-03-03 Nazife Ozdes Koca , Ramazan Koc , Mehmet Koca , Abeer Al-Siyabi

If we label the vertices of a triangle with 1, 2 and 4, and the orthocentre with 7, then any of the four numbers 1, 2, 4, 7 is the nim-sum of the other three and is their orthocentre. Regard the triangle as an orthocentric quadrangle.…

History and Overview · Mathematics 2019-10-09 Richard K. Guy

The associahedron is a convex polytope whose face poset is based on nonintersecting diagonals of a convex polygon. In this paper, given an arbitrary simple polygon P, we construct a polytopal complex analogous to the associahedron based on…

Combinatorics · Mathematics 2015-06-16 Satyan L. Devadoss , Rahul Shah , Xuancheng Shao , Ezra Winston

We determine all non-edge-to-edge tilings of the sphere by regular spherical polygons of three or more sides.

Combinatorics · Mathematics 2021-01-27 Colin Adams , Cameron Edgar , Peter Hollander , Liza Jacoby

Extending previous results on a characterization of all equilateral triangle in space having vertices with integer coordinates ("in $\mathbb Z^3$"), we look at the problem of characterizing all regular polyhedra (Platonic Solids) with the…

Number Theory · Mathematics 2009-10-12 Eugen J. Ionascu , Andrei Markov

We analyze a remarkable class of centrally symmetric polytopes, the Hansen polytopes of split graphs. We confirm Kalai's 3^d-conjecture for such polytopes (they all have at least 3^d nonempty faces) and show that the Hanner polytopes among…

Metric Geometry · Mathematics 2012-01-30 Ragnar Freij , Matthias Henze , Moritz W. Schmitt , Günter M. Ziegler

In this paper we give a complete description about normal monohedral tilings of a convex disc with smooth boundary where we have at most three topological discs as tiles. This result is a far-reaching generalization of the results of…

Metric Geometry · Mathematics 2021-10-25 Kinga Nagy , Viktor Vigh

We define treetopes, a generalization of the three-dimensional roofless polyhedra (Halin graphs) to arbitrary dimensions. Like roofless polyhedra, treetopes have a designated base facet such that every face of dimension greater than one…

Computational Geometry · Computer Science 2020-08-10 David Eppstein