English
Related papers

Related papers: Packings of Smoothed Polygons

200 papers

In 2008, Schmidt and Tuller stated a conjecture concerning optimal packing and covering of integers by translates of a given three-point set. In this note, we confirm their conjecture and relate it to several other problems in…

Combinatorics · Mathematics 2023-07-26 Nóra Frankl , Andrey Kupavskii , Arsenii Sagdeev

In a model of physics taking place on a discrete set of points that approximates Minkowski space, one might perhaps expect there to be an empirically identifiable preferred frame. However, the work of Dowker, Bombelli, Henson, and Sorkin…

General Relativity and Quantum Cosmology · Physics 2018-09-06 Adrian Kent

In this work we consider the problem of finding the minimum-weight loop cover of an undirected graph. This combinatorial optimization problem is called 2-matching and can be seen as a relaxation of the traveling salesman problem since one…

Disordered Systems and Neural Networks · Physics 2018-08-28 Sergio Caracciolo , Andrea Di Gioacchino , Enrico M. Malatesta

We consider the optimal containment of polygonal regions within convex containers with the special property of 'orientedness' - an oriented region enables us to choose a preferred direction on the plane (this direction is not necessarily an…

General Mathematics · Mathematics 2018-09-07 R Nandakumar

In this paper we develop a theory of convexity for a free Abelian group M (the lattice of integer points), which we call theory of discrete convexity. We characterize those subsets X of the group M that could be call "convex". One property…

Combinatorics · Mathematics 2007-05-23 V. I. Danilov , G. A. Koshevoy

We prove that given a fixed radius $r$, the set of isometry-invariant probability measures supported on ``periodic'' radius $r$-circle packings of the hyperbolic plane is dense in the space of all isometry-invariant probability measures on…

Metric Geometry · Mathematics 2007-05-23 Lewis Bowen

A notion of "radially monotone" cut paths is introduced as an effective choice for finding a non-overlapping edge-unfolding of a convex polyhedron. These paths have the property that the two sides of the cut avoid overlap locally as the cut…

Computational Geometry · Computer Science 2016-08-01 Joseph O'Rourke

Predicting theoretically the highest density, which a disordered packing of discs can achieve, has been a long-standing unresolved problem. Such predictions are hindered by two difficulties - the dependence of the density on the packing…

Soft Condensed Matter · Physics 2026-05-26 Raphael Blumenfeld

We study affine control systems on smooth manifolds and their complete lifts to the tangent bundle, providing an explicit geometric description of the solutions of the lifted system. We show that, although controllability of the complete…

Optimization and Control · Mathematics 2026-01-01 Simão N. Stelmastchuk

Counting Euclidean triangulations with vertices in a finite set $\C$ of the convex hull $\conv(\C)$ of $\C$ is difficult in general, both algorithmically and theoretically. The aim of this paper is to describe nearly convex polygons, a…

Combinatorics · Mathematics 2010-12-13 Roland Bacher , Frédéric Mouton

Moser asked whether the collection of rectangles of dimensions 1 x 1/2, 1/2 x 1/3, 1/3 x 1/4, ..., whose total area equals 1, can be packed into the unit square without overlap, and whether the collection of squares of side lengths 1/2,…

Metric Geometry · Mathematics 2007-05-23 Greg Martin

During the last few years several new results on packing problems were obtained using a blend of tools from semidefinite optimization, polynomial optimization, and harmonic analysis. We survey some of these results and the techniques…

Optimization and Control · Mathematics 2016-02-10 Fernando Mário de Oliveira Filho , Frank Vallentin

A hypercomplex manifold is by definition a smooth manifold equipped with two anticommuting integrable almost complex structures. For example, every hyperkaehler manifold is canonically hypercomplex (the converse is not true). For every…

alg-geom · Mathematics 2008-02-03 D. Kaledin

Apollonian circle packings arise by repeatedly filling the interstices between mutually tangent circles with further tangent circles. In Euclidean space it is possible for every circle in such a packing to have integer radius of curvature,…

Number Theory · Mathematics 2008-12-08 Nicholas Eriksson , Jeffrey C. Lagarias

The sphere packing problem asks for the greatest density of a packing of congruent balls in Euclidean space. The current best upper bound in all sufficiently high dimensions is due to Kabatiansky and Levenshtein in 1978. We revisit their…

Metric Geometry · Mathematics 2015-01-14 Henry Cohn , Yufei Zhao

In this note, we develop the first-order theory of optimal control problems with box constraints on the control. We emphasize the precise modification of Pontryagin's maximum principle when the admissible control set is compact, the…

Optimization and Control · Mathematics 2026-04-08 Louis Shuo Wang

The ideal glass, a disordered system of particles with zero configurational entropy, cannot be realized through thermal processes. Nevertheless, we present a method for constructing ideal jammed packings of soft spheres, and thus the zero…

Soft Condensed Matter · Physics 2026-02-06 Viola Bolton-Lum , R. Cameron Dennis , Peter Morse , Eric Corwin

Spatially ordered systems confined to surfaces such as spheres exhibit interesting topological structures because of curvature induced frustration in orientational as well as translational order. The study of these structures is important…

Soft Condensed Matter · Physics 2022-06-24 Dharanish Rajendra , Jaydeep Mandal , Yashodhan Hatwalne , Prabal K. Maiti

Manipulation of infinite dimensional quantum systems is important to controlling complex quantum dynamics with many practical physical and chemical backgrounds. In this paper, a general investigation is casted to the controllability problem…

Quantum Physics · Physics 2009-11-11 Re-Bing Wu , Tzyh-Jong Tarn , Chun-Wen Li

In its most general form, the optimal transport problem is an infinite-dimensional optimization problem, yet certain notable instances admit closed-form solutions. We identify the common source of this tractability as \textit{symmetry} and…

Optimization and Control · Mathematics 2026-05-22 Bahar Taskesen