English
Related papers

Related papers: Klein polyhedra and lattices with positive norm mi…

200 papers

We analyze polyhedra composed of hexagons and triangles with three faces around each vertex, and their 3-regular planar graphs of edges and vertices, which we call "trihexes". Trihexes are analogous to fullerenes, which are 3-regular planar…

Combinatorics · Mathematics 2025-07-01 Linda Green , Stellen Li

Compact polyhedra of cubic point symmetry Oh, exhibit surfaces of planar sections (facets) characterized by normal vector families {abc} with up to 48 members each, compatible with Oh symmetry. We focus first on polyhedra confined by facets…

Atomic and Molecular Clusters · Physics 2022-09-20 KLaus E. Hermann

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…

Metric Geometry · Mathematics 2019-09-09 E. Makai,

A spectrahedron is a set defined by a linear matrix inequality. Given a spectrahedron we are interested in the question of the smallest possible size $r$ of the matrices in the description by linear matrix inequalities. We show that for the…

Algebraic Geometry · Mathematics 2016-06-30 Mario Kummer

First, we calculate the Ehrhart polynomial associated to an arbitrary cube with integer coordinates for its vertices. Then, we use this result to derive relationships between the Ehrhart polynomials for regular lattice tetrahedrons and…

Combinatorics · Mathematics 2011-11-07 Eugen J. Ionascu

In this work we prove a criterion for an algebraic continued fraction to have a proper palindromic symmetry in dimension $4$. As a multidimensional generalization of continued fractions, we consider Klein polyhedra.

Number Theory · Mathematics 2022-06-01 I. A. Tlyustangelov

A convex polyhedron $P$ is $k$-equiprojective if all of its orthogonal projections, i.e., shadows, except those parallel to the faces of $P$ are $k$-gon for some fixed value of $k$. Since 1968, it is an open problem to construct all…

Computational Geometry · Computer Science 2010-09-14 Masud Hasan , Mohammad Monoar Hossain , Alejandro López-Ortiz , Sabrina Nusrat , Saad Altaful Quader , Nabila Rahman

We describe a new method of weaving a model of the Klein quartic, a highly symmetric, but abstract genus-3 surface akin to a platonic polyhedron, with negatively-curved geometry. The Klein quartic cannot be realized in its fully symmetric…

Combinatorics · Mathematics 2024-03-06 Chaim Goodman-Strauss

The classical Steinitz theorem states that if the origin belongs to the interior of the convex hull of a set $S \subset \mathbb{R}^d$, then there are at most $2d$ points of $S$ whose convex hull contains the origin in the interior.…

Metric Geometry · Mathematics 2024-03-06 Grigory Ivanov , Márton Naszódi

In this paper we give a matrix version of Handelman's Positivstellensatz [1], representing polynomial matrices which are positive definite on convex, compact polyhedra. Moreover, we propose also a procedure to find such a representation. As…

Algebraic Geometry · Mathematics 2017-08-10 Công-Trình Lê , Thi-Hoa-Binh Du

We prove that every three-dimensional polyhedron is uniquely determined by its dihedral angles and edge lengths, even if nonconvex or self-intersecting, under two plausible sufficient conditions: (i) the polyhedron has only convex faces and…

Geometric Topology · Mathematics 2023-07-28 Yunhi Cho , Seonhwa Kim

Compact polyhedral surfaces (or, equivalently, compact Riemann surfaces with conformal flat conical metrics) of an arbitrary genus are considered. After giving a short self-contained survey of their basic spectral properties, we study the…

Differential Geometry · Mathematics 2009-06-04 Alexey Kokotov

The Gauss-Bonnet theorem for a polyhedron (a union of finitely many compact convex polytopes) in $n$-dimensional Euclidean space expresses the Euler characteristic of the polyhedron as a sum of certain curvatures, which are different from…

Metric Geometry · Mathematics 2017-08-18 Rolf Schneider

A spectrahedron is a set defined by a linear matrix inequality. A projection of a spectrahedron is often called a semidefinitely representable set. We show that the convex hull of a finite union of such projections is again a projection of…

Optimization and Control · Mathematics 2009-08-25 Tim Netzer , Rainer Sinn

We prove that any polyhedron of genus zero or genus one built out of rectangular faces must be an orthogonal polyhedron, but that there are nonorthogonal polyhedra of genus seven all of whose faces are rectangles. This leads to a resolution…

Computational Geometry · Computer Science 2007-05-23 Melody Donoso , Joseph O'Rourke

Given a flag in each of the vertex-transitive tessellations of the Euclidean plane by regular polygons, we determine the flag stabilizer under the action of the automorphism group of a regular cover. In so doing we give a presentation of…

Combinatorics · Mathematics 2012-06-29 Gordon Williams , Daniel Pellicer

In this paper we describe the group of symmetries of a two-dimensional continued fraction. As a multidimensional generalization of continued fractions we consider Klein polyhedra. We distinguish two types of symmetries: the Dirichlet-type…

Number Theory · Mathematics 2021-09-01 Oleg N. German , Ibragim A. Tlyustangelov

Partial permutohedra are lattice polytopes which were recently introduced and studied by Heuer and Striker. For positive integers $m$ and $n$, the partial permutohedron $\mathcal{P}(m,n)$ is the convex hull of all vectors in…

The integer hull of a polyhedron is the convex hull of the integer points contained in it. We show that the vertices of the integer hulls of a rational family of polyhedra of size O(n) have quasipolynomial coordinates. As a corollary, we…

Combinatorics · Mathematics 2013-07-17 Danny Calegari , Alden Walker

Let $P$ be a rational polyhedron in $\mathbb{R}^d$ and let $\mathcal{L}$ be a class of $d$-dimensional maximal lattice-free rational polyhedra in $\mathbb{R}^d$. For $L \in \mathcal{L}$ by $R_L(P)$ we denote the convex hull of points…

Optimization and Control · Mathematics 2012-08-21 Gennadiy Averkov