English
Related papers

Related papers: Bounding the density of spherical polygon packings

200 papers

Using computed x-ray tomography we determine the three dimensional (3d) structure of binary hard sphere mixtures as a function of composition and size ratio of the particles, q. Using a recently introduced four-point correlation function we…

Soft Condensed Matter · Physics 2023-02-15 Houfei Yuan , Zhen Zhang , Walter Kob , Yujie Wang

We propose a $\theta$-scheme to discretize the $d$-dimensional stochastic cubic Schr\"odinger equation in Stratono\-vich sense. A uniform bound for the Hamiltonian of the discrete problem is obtained, which is a crucial property to verify…

Numerical Analysis · Mathematics 2015-09-29 Chuchu Chen , Jialin Hong , Andreas Prohl

A sphere is a fundamental geometric object widely used in (computer aided) geometric design. It possesses rational parameterizations but no parametric polynomial parameterization exists. The present study provides an approach to the optimal…

Numerical Analysis · Mathematics 2021-04-27 Aleš Vavpetič , Emil Žagar

This work revolves around the two following questions: Given a convex body $C\subset\mathbb{R}^d$, a positive integer $k$ and a finite set $S\subset\mathbb{R}^d$ (or a finite Borel measure $\mu$ on $\mathbb{R}^d$), how many homothets of $C$…

Combinatorics · Mathematics 2022-12-06 Oriol Solé Pi

A fundamental class of matrix optimization problems that arise in many areas of science and engineering is that of quadratic optimization with orthogonality constraints. Such problems can be solved using line-search methods on the Stiefel…

Optimization and Control · Mathematics 2015-10-06 Huikang Liu , Weijie Wu , Anthony Man-Cho So

Let $S$ be a set of $n$ points in the plane, $\wp(S)$ be the set of all simple polygons crossing $S$, $\gamma_P$ be the maximum angle of polygon $P \in \wp(S)$ and $\theta =min_{P\in\wp(S)} \gamma_P$. In this paper, we prove that…

Computational Geometry · Computer Science 2021-06-15 Saeed Asaeedi , Farzad Didehvar , Ali Mohades

Let $\Delta$ be the optimal packing density of $\mathbb R^n$ by unit balls. We show the optimal packing density using two sizes of balls approaches $\Delta + (1 - \Delta) \Delta$ as the ratio of the radii tends to infinity. More generally,…

Metric Geometry · Mathematics 2016-03-04 David de Laat

We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…

Metric Geometry · Mathematics 2022-11-10 Yihan Zhang , Shashank Vatedka

In this work, we present a novel approach for solving stochastic shape optimization problems. Our method is the extension of the classical stochastic gradient method to infinite-dimensional shape manifolds. We prove convergence of the…

Optimization and Control · Mathematics 2020-11-03 Caroline Geiersbach , Estefania Loayza-Romero , Kathrin Welker

In this paper, we show that there exists a positive density subsequence of orthonormal spherical harmonics which achieves the maximal Lp norm growth for 2<p<=6, therefore giving an example of a Riemannian surface supporting such subsequence…

Classical Analysis and ODEs · Mathematics 2014-04-22 Xiaolong Han

We consider the problem of minimizing a convex function that depends on an uncertain parameter $\theta$. The uncertainty in the objective function means that the optimum, $x^*(\theta)$, is also a function of $\theta$. We propose an…

Optimization and Control · Mathematics 2022-07-06 Conor McMeel , Panos Parpas

We study random sequential adsorption (RSA) of a class of solids that can be obtained from a cube by specific cutting of its vertices, in order to find out how the transition from tetrahedral to octahedral symmetry affects the densities of…

Materials Science · Physics 2019-11-22 Piotr Kubala , Michał Cieśla , Robert M. Ziff

We study the concentration problem on compact two-point homogeneous spaces of finite expansions of eigenfunctions of the Laplace-Beltrami operator using large sieve methods. We derive upper bounds for concentration in terms of the maximum…

Classical Analysis and ODEs · Mathematics 2020-04-07 Philippe Jaming , Michael Speckbacher

A small polygon is a polygon of unit diameter. The maximal area of a small polygon with $n=2m$ vertices is not known when $m\ge 7$. Finding the largest small $n$-gon for a given number $n\ge 3$ can be formulated as a nonconvex quadratically…

Optimization and Control · Mathematics 2023-02-24 Christian Bingane

We prove a lower bound on the entropy of sphere packings of $\mathbb R^d$ of density $\Theta(d \cdot 2^{-d})$. The entropy measures how plentiful such packings are, and our result is significantly stronger than the trivial lower bound that…

Probability · Mathematics 2019-12-04 Matthew Jenssen , Felix Joos , Will Perkins

Motivated by a long-standing conjecture of Polya and Szeg\"o about the Newtonian capacity of convex bodies, we discuss the role of concavity inequalities in shape optimization, and we provide several counterexamples to the…

Optimization and Control · Mathematics 2011-02-10 Dorin Bucur , Ilaria Fragalà , Jimmy Lamboley

In this paper we study the integral properties of Apollonian-3 circle packings, which are variants of the standard Apollonian circle packings. Specifically, we study the reduction theory, formulate a local-global conjecture, and prove a…

Number Theory · Mathematics 2015-04-21 Xin Zhang

We consider polynomials that are orthogonal over an analytic Jordan curve L with respect to a positive analytic weight, and show that each such polynomial of sufficiently large degree can be expanded in a series of certain integral…

Classical Analysis and ODEs · Mathematics 2009-03-19 Erwin Miña-Díaz

We study regularity properties of solutions to operator equations on patchwise smooth manifolds $\partial\Omega$ such as, e.g., boundaries of polyhedral domains $\Omega \subset \mathbb{R}^3$. Using suitable biorthogonal wavelet bases…

Numerical Analysis · Mathematics 2014-09-09 Stephan Dahlke , Markus Weimar

We give an asymptotic approximation scheme (APTAS) for the problem of packing a set of circles into a minimum number of unit square bins. To obtain rational solutions, we use augmented bins of height $1+\gamma$, for some arbitrarily small…

Data Structures and Algorithms · Computer Science 2014-12-16 Flávio K. Miyazawa , Lehilton L. C. Pedrosa , Rafael C. S. Schouery , Maxim Sviridenko , Yoshiko Wakabayashi