English
Related papers

Related papers: Convex Pentagons with Positive Heesch Number

200 papers

The main result of this paper is a proof that a nearly flat, acutely triangulated convex cap C in R^3 has an edge-unfolding to a non-overlapping polygon in the plane. A convex cap is the intersection of the surface of a convex polyhedron…

Computational Geometry · Computer Science 2021-01-07 Joseph O'Rourke

We establish an embedding from the Hecke algebra associated with the edge contraction of a Coxeter system along an edge to the Hecke algebra associated with the original Coxeter system.

Representation Theory · Mathematics 2024-07-01 Yiqiang Li

If the complement of a closed convex set in a closed convex cone is bounded, then this complement minus the apex of the cone is called a coconvex set. Coconvex sets appear in singularity theory (they are closely related to Newton diagrams)…

Metric Geometry · Mathematics 2013-12-04 Askold Khovanskii , Vladlen Timorin

In this paper we analyze theoretical properties of bi-objective convex-quadratic problems. We give a complete description of their Pareto set and prove the convexity of their Pareto front. We show that the Pareto set is a line segment when…

Optimization and Control · Mathematics 2018-12-04 Cheikh Toure , Anne Auger , Dimo Brockhoff , Nikolaus Hansen

In this paper we extend the notion of a Lorentz cone. We call a closed convex set isotone projection set with respect to a pointed closed convex cone if the projection onto the set is isotone (i.e., monotone) with respect to the order…

Optimization and Control · Mathematics 2014-12-12 S. Z. Németh , G. Zhang

We define new natural variants of the notions of weighted covering and separation numbers and discuss them in detail. We prove a strong duality relation between weighted covering and separation numbers and prove a few relations between the…

Metric Geometry · Mathematics 2013-12-17 Shiri Artstein-Avidan , Boaz A. Slomka

Diophantine tuples are of ancient and modern interest, with a huge literature. In this paper we study Diophantine graphs, i.e., finite graphs whose vertices are distinct positive integers, and two vertices are linked by an edge if and only…

Number Theory · Mathematics 2024-10-29 Gergő Batta , Lajos Hajdu , András Pongrácz

Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…

Combinatorics · Mathematics 2019-09-16 Toshinori Sakai , Jorge Urrutia

The microscopic structure of the high-index Si$(331)-(12\times1)$ surface is investigated combining scanning tunneling microscopy with ab initio calculations. We present a structural model of the Si(331) surface, employing a reconstruction…

Materials Science · Physics 2019-01-08 Ruslan Zhachuk , Sergey Teys

Several characterizations of complex ellipsoids among convex bodies in Cn, in terms of their sections and projections are proved. Characterizing complex symmetry in similar terms is an important tool.

Metric Geometry · Mathematics 2021-11-30 Jorge Arocha , Javier Bracho , Luis Montejano

We conjecture that certain curvature invariants of compact hyperk\"ahler manifolds are positive/negative. We prove the conjecture in complex dimension four, give an "experimental proof" in higher dimensions, and verify it for all known…

Differential Geometry · Mathematics 2021-12-23 Justin Sawon

In this paper, I shall demonstrate that sufficiently high-dimensional closed positively-curved Riemannian manifolds are either diffeomorphic to a spherical space form, or isometric to a locally compact rank one symmetric space. This…

Metric Geometry · Mathematics 2016-08-05 Yashar Memarian

An n-gon is defined as a sequence \P=(V_0,...,V_{n-1}) of n points on the plane. An n-gon \P is said to be convex if the boundary of the convex hull of the set {V_0,...,V_{n-1}} of the vertices of \P coincides with the union of the edges…

Computational Geometry · Computer Science 2007-05-23 Iosif Pinelis

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…

Metric Geometry · Mathematics 2017-03-16 Seonhwa Kim , Yunhi Cho

A permutation polytope is the convex hull of a group of permutation matrices. In this paper we investigate the combinatorics of permutation polytopes and their faces. As applications we completely classify permutation polytopes in…

Combinatorics · Mathematics 2010-02-14 Barbara Baumeister , Christian Haase , Benjamin Nill , Andreas Paffenholz

Kernel quadrature can exploit RKHS spectral structure and outperform Monte Carlo on smooth integrands, but optimized quadrature weights are generally signed and may be numerically unstable. We study whether spectral acceleration remains…

Numerical Analysis · Mathematics 2026-05-08 Satoshi Hayakawa

A regular polyhedron of type {p, q} has at least 2pq flags, and it is called tight if it has exactly 2pq flags. The values of p and q for which there exist tight orientably regular polyhedra were previously known. We determine for which…

Combinatorics · Mathematics 2016-04-12 Gabe Cunningham , Daniel Pellicer

We construct a sequence of convex polyhedra on n vertices with the property that, as n -> infinity, the fraction of its edge unfoldings that avoid overlap approaches 0, and so the fraction that overlap approaches 1. Nevertheless, each does…

Computational Geometry · Computer Science 2008-01-28 Alex Benton , Joseph O'Rourke

We give an explicit construction of a closed curve with constant torsion and everywhere positive curvature. We also discuss the restrictions on closed curves of constant torsion when they are constrained to lie on convex surfaces.

Differential Geometry · Mathematics 2012-07-02 Larr M. Bates , O. Michael Melko

We consider the conjecture by Aichholzer, Aurenhammer, Hurtado, and Krasser that any two points sets with the same cardinality and the same size convex hull can be triangulated in the "same" way, more precisely via \emph{compatible…