English
Related papers

Related papers: The equilateral small octagon of maximal width

200 papers

An annulus is, informally, a ring-shaped region, often described by two concentric circles. The maximum-width empty annulus problem asks to find an annulus of a certain shape with the maximum possible width that avoids a given set of $n$…

Computational Geometry · Computer Science 2018-11-16 Sang Won Bae , Arpita Baral , Priya Ranjan Sinha Mahapatra

A polygonal surface in the pseudo-hyperbolic space H^(2,n) is a complete maximal surface bounded by a lightlike polygon in the Einstein universe Ein^(1,n) with finitely many vertices. In this article, we give several characterizations of…

Differential Geometry · Mathematics 2026-05-05 Alex Moriani

We establish that the optimal bound for the size of the smallest integral solution of the Oppenheim Diophantine approximation problem $\abs{Q(x)-\xi}< \epsilon$ for a generic ternary form $Q$ is $\abs{x}\ll \epsilon^{-1}$. We also establish…

Number Theory · Mathematics 2018-01-04 Anish Ghosh , Alexander Gorodnik , Amos Nevo

Fix an integer n>=1. Suppose that a simple polygon is the union of n triangles whose vertices along the common boundary are arranged cyclically. How many sides can such a union -- to be called regular -- have at most? This gives OEIS…

Combinatorics · Mathematics 2026-04-16 Giedrius Alkauskas

We investigate slicings of combinatorial manifolds as properly embedded co-dimension 1 submanifolds. A focus is given to dimension 3 where slicings are normal surfaces. In the case of 2-neighborly 3-manifolds and quadrangulated slicings, a…

Combinatorics · Mathematics 2012-03-16 Jonathan Spreer

Polygon spaces have been studied extensively, and yet missing from the literature is a simple property that every polygon has: dimension. This is distinct (possibly) from the dimension of the ambient space in which the polygon lives. A…

General Topology · Mathematics 2020-09-17 Jack Love

For fixed $k$ we prove exponential lower bounds on the equilateral number of subspaces of $\ell_{\infty}^n$ of codimension $k$. In particular, we show that if the unit ball of a normed space of dimension $n$ is a centrally symmetric…

Combinatorics · Mathematics 2020-05-12 Nora Frankl

The diameter of an undirected or a directed graph is defined to be the maximum shortest path distance over all pairs of vertices in the graph. Given an undirected graph $G$, we examine the problem of assigning directions to each edge of $G$…

Data Structures and Algorithms · Computer Science 2022-03-09 Debajyoti Mondal , N. Parthiban , Indra Rajasingh

The present article includes the enumeration of $n$-polygons with a certain symmetry property: For an even number $n$ of vertices, we count the $n$-polygons with $\frac{n}{2}$ symmetry axes. In addition, if $n$ is a power of 2, we show the…

Combinatorics · Mathematics 2019-09-11 Rolf Haag

While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…

Probability · Mathematics 2021-03-03 Steven D. Hoehner , Carsten Schuett , Elisabeth M. Werner

A convex body $R$ in the hyperbolic plane is reduced if any convex body $K\subset R$ has a smaller minimal width than $R$. We examine the area of a family of hyperbolic reduced $n$-gons, and prove that, within this family, regular $n$-gons…

Metric Geometry · Mathematics 2024-09-04 Ádám Sagmeister

We prove that the 8^4_2 link complement is the minimal volume orientable hyperbolic manifold with 4 cusps. Its volume is twice of the volume V_8 of the ideal regular octahedron, i.e. 7.32... = 2V_8. The proof relies on Agol's argument used…

Geometric Topology · Mathematics 2013-12-04 Ken'ichi Yoshida

In the previous paper, Max/Min Puzzles in Geometry III, we searched for the smallest area triangle which contained a regular unit polygon (Square, Pentagon, Hexagon). In this paper we will work in 3-dimensions, and search for the smallest…

History and Overview · Mathematics 2025-05-08 James M Parks

Approximating convex bodies is a fundamental problem in geometry. Given a convex body $K$ in $\mathbb{R}^d$ for a fixed dimension $d$, the objective is to minimize the number of facets of an approximating polytope for a given Hausdorff…

Computational Geometry · Computer Science 2026-01-26 Sunil Arya , Guilherme D. da Fonseca , David M. Mount

We use computational experiments to find the rectangles of minimum perimeter into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. In many of the packings…

Metric Geometry · Mathematics 2009-04-03 Boris D. Lubachevsky , Ronald L. Graham

The symmetry dimension of a geometric structure is the dimension of its symmetry algebra. We investigate symmetries of almost quaternionic structures of quaternionic dimension $n$. The maximal possible symmetry is realized by the…

Differential Geometry · Mathematics 2016-07-08 Boris Kruglikov , Henrik Winther , Lenka Zalabova

We prove a theorem on the relationships between the lengths of sides of a spherical quadrilateral with three right angles. They are analogous to the relationships in the Lambert quadrilateral in the hyperbolic plane. We apply this theorem…

Metric Geometry · Mathematics 2025-06-30 Marek Lassak

Let $S$ be a set of $2n$ points on a circle such that for each point $p \in S$ also its antipodal (mirrored with respect to the circle center) point $p'$ belongs to $S$. A polygon $P$ of size $n$ is called \emph{antipodal} if it consists of…

Metric Geometry · Mathematics 2013-01-29 O. Aichholzer , L. E. Caraballo , J. M. Díaz-Báñez , R. Fabila-Monroy , C. Ochoa , P. Nigsch

Consider an arrangement of $k$ lines intersecting the unit square. There is some minimum scaling factor so that any placement of a rectangle with aspect ratio $1 \times p$ with $p\geq 1$ must non-transversely intersect some portion of the…

Computational Geometry · Computer Science 2022-01-05 Bradley McCoy , Eli Quist , Anna Schenfisch

The optimal one-sided parametric polynomial approximants of a circular arc are considered. More precisely, the approximant must be entirely in or out of the underlying circle of an arc. The natural restriction to an arc's approximants…

Numerical Analysis · Mathematics 2025-09-03 Ada Šadl Praprotnik , Aleš Vavpetič , Emil Žagar