English
Related papers

Related papers: The longest perimeter small triacontadigon

200 papers

We derive formulas for the number of polycubes of size $n$ and perimeter $t$ that are proper in $n-1$ and $n-2$ dimensions. These formulas complement computer based enumerations of perimeter polynomials in percolation problems. We…

Combinatorics · Mathematics 2017-05-11 Sebastian Luther , Stephan Mertens

Weiss and, independently, Mazzeo and Montcouquiol recently proved that a 3--dimensional hyperbolic cone-manifold (possibly with vertices) with all cone angles less than $2\pi$ is infinitesimally rigid. On the other hand, Casson provided…

Geometric Topology · Mathematics 2009-11-02 Ivan Izmestiev

We bound the number of minimal hypergraph transversals that arise in tri-partite 3-uniform hypergraphs, a class commonly found in applications dealing with data. Let H be such a hypergraph on a set of vertices V. We give a lower bound of…

Combinatorics · Mathematics 2021-01-08 Alexandre Bazin , Laurent Beaudou , Giacomo Kahn , Kaveh Khoshkhah

Let $C_{\theta}$ be a circular cone in Euclidean space $\mathbb{R}^{3}$,which apex is the origin and apex angle of the cone is $\theta\in \left(\pi/3, \pi\right)$. Let $M_\theta$ be the class of compact convex domains in Euclidean space…

Dynamical Systems · Mathematics 2024-10-29 Yi Yang

We suggest a geometric visualization of the process of constructing a triangle with prescribed bisectors that makes the existence of such a triangle geometrically evident.

History and Overview · Mathematics 2016-04-14 S. F. Osinkin

The aim of this paper is to present some properties of reduced spherical convex bodies on the two-dimensional sphere $S^2$. The intersection of two different non-opposite hemispheres is called a lune. By its thickness we mean the distance…

Metric Geometry · Mathematics 2016-07-04 Marek Lassak , Michał Musielak

A covering problem posed by Henri Lebesgue in 1914 seeks to find the convex shape of smallest area that contains a subset congruent to any point set of unit diameter in the Euclidean plane. Methods used previously to construct such a…

Metric Geometry · Mathematics 2018-10-25 Philip Gibbs

A convex cone is said to be projectionally exposed (p-exposed) if every face arises as a projection of the original cone. It is known that, in dimension at most four, the intersection of two p-exposed cones is again p-exposed. In this paper…

Optimization and Control · Mathematics 2025-01-23 Bruno F. Lourenço , Vera Roshchina , James Saunderson

The aim of this note is twofold: to give a short proof of the results in [S. Larson, A bound for the perimeter of inner parallel bodies, J. Funct. Anal. 271 (2016), 610-619] and [G. Domokos and Z. L\'angi, The isoperimetric quotient of a…

Metric Geometry · Mathematics 2021-01-12 Graziano Crasta

This paper contains a new concept to measure the width and thickness of a convex body in the hyperbolic plane. We compare the known concepts with the new one and prove some results on bodies of constant width, constant diameter and given…

Metric Geometry · Mathematics 2020-12-01 Ákos G. Horváth

Let $H_n$ be the minimal number such that any $n$-dimensional convex body can be covered by $H_n$ translates of interior of that body. Similarly $H_n^s$ is the corresponding quantity for symmetric bodies. It is possible to define $H_n$ and…

Metric Geometry · Mathematics 2024-04-02 Andrii Arman , Andriy Bondarenko , Andriy Prymak

We show that the minimum distance projection in the L1-norm from an interior point onto the boundary of a convex set is achieved by a single, unidimensional projection. Application of this characterization when the convex set is a…

Optimization and Control · Mathematics 2007-05-23 Hans J. H. Tuenter

We study the problem of partitioning a polygon into the minimum number of subpolygons using cuts in predetermined directions such that each resulting subpolygon satisfies a given width constraint. A polygon satisfies the unit-width…

Computational Geometry · Computer Science 2025-09-15 Jaehoon Chung , Kazuo Iwama , Chung-Shou Liao , Hee-Kap Ahn

The complete sets of irreducible triangulations are known for the orientable surfaces with genus of 0, 1, or 2 and for the nonorientable surfaces with genus of 1, 2, 3, or 4. By examining these sets we determine some of the properties of…

Combinatorics · Mathematics 2007-05-23 Thom Sulanke

We consider the smallest-area universal covering of planar objects of perimeter 2 (or equivalently closed curves of length 2) allowing translation and discrete rotations. In particular, we show that the solution is an equilateral triangle…

Computational Geometry · Computer Science 2022-11-29 Mook Kwon Jung , Sang Duk Yoon , Hee-Kap Ahn , Takeshi Tokuyama

In this survey on combinatorial properties of triangulated manifolds we discuss various lower bounds on the number of vertices of simplicial and combinatorial manifolds. Moreover, we give a list of all known examples of vertex-minimal…

Combinatorics · Mathematics 2007-05-23 Frank H. Lutz

Let $K$ be a convex body (a non-empty compact convex set) in $n$-dimensional Euclidean space. A set $B$ is called a barrier (or an `opaque set') for $K$ if every line that intersects $K$, also intersects $B$. Although this concept was…

Metric Geometry · Mathematics 2026-05-14 Markus Kiderlen

This paper gives a partial confirmation of a conjecture of P. Agarwal, S. Har-Peled, M. Sharir, and K. Varadarajan that the total curvature of a shortest path on the boundary of a convex polyhedron in the 3-dimensional Euclidean space…

Metric Geometry · Mathematics 2007-05-23 Imre Barany , Krystyna Kuperberg , Tudor Zamfirescu

A circle C holds a convex body K if C does not meet the interior of K and if there does not exist any euclidean displacement which moves C as far as desired from K, avoiding the interior of K. The purpose of this note is to explore how…

Metric Geometry · Mathematics 2011-05-13 Augustin Fruchard

A polygon C is an intersecting polygon for a set O of objects in the plane if C intersects each object in O, where the polygon includes its interior. We study the problem of computing the minimum-perimeter intersecting polygon and the…

Computational Geometry · Computer Science 2022-08-17 Antonios Antoniadis , Mark de Berg , Sándor Kisfaludi-Bak , Antonis Skarlatos