English
Related papers

Related papers: Simultaneous packing and covering in sequence spac…

200 papers

Rearranging densely packed tabletop objects is challenging when parallel-gripper picks are infeasible without sufficient clearance around an object. This work studies the problem characteristics for practically motivated settings with…

Robotics · Computer Science 2026-05-19 Hao Lu , Rahul Shome

In previous work a probabilistic approach to controlling difficulties of density in hyperbolic space led to a workable notion of optimal density for packings of bodies. In this paper we extend an ergodic theorem of Nevo to provide an…

Metric Geometry · Mathematics 2007-05-23 Lewis Bowen , Charles Radin

We consider the problem of packing congruent circles with the maximum radius in a unit square as a mathematical optimization problem. Due to the presence of non-overlapping constraints, this problem is a notoriously difficult nonconvex…

Optimization and Control · Mathematics 2024-04-05 Aida Khajavirad

We show that the two-dimensional minimum-volume central section of the $n$-dimensional cross-polytope is attained by the regular $2n$-gon. We establish stability-type results for hyperplane sections of $\ell_p$-balls in all the cases where…

Functional Analysis · Mathematics 2022-11-23 Giorgos Chasapis , Piotr Nayar , Tomasz Tkocz

In this paper, we study geometric properties of $\ell^{p}$-spaces associated with the unitary dual of a compact group. More precisely, we prove uniform smoothness, uniform convexity, Clarkson type inequalities, Kadec-Klee property, as well…

Functional Analysis · Mathematics 2025-12-01 Meiram Akhymbek , Michael Ruzhansky

In [BL] in relation to the unsolved Bang's plank problem (1951) we obtained a lower bound for the sum of relevant measures of cylinders covering a given d-dimensional convex body. In this paper we provide the packing counterpart of these…

Metric Geometry · Mathematics 2016-03-22 Karoly Bezdek , Alexander Litvak

Following the seminal work of Erlebach and van Leeuwen in SODA 2008, we introduce the minimum ply covering problem. Given a set $P$ of points and a set $S$ of geometric objects, both in the plane, our goal is to find a subset $S'$ of $S$…

Computational Geometry · Computer Science 2019-05-03 Therese Biedl , Ahmad Biniaz , Anna Lubiw

Supergroups of some hyperbolic space groups are classified as a continuation of our former works. Fundamental domains will be integer parts of truncated tetrahedra belonging to families F1 - F4, for a while, by the notation of E. Moln\'{a}r…

Metric Geometry · Mathematics 2020-03-31 Emil Molnár , Milica Stojanović , Jenő Szirmai

In the early nineties, R. M. Aron, B. Cole, T. Gamelin and W.B. Johnson initiated the study of the maximal ideal space (spectrum) of Banach algebras of holomorphic functions defined on the open unit ball of an infinite dimensional complex…

Functional Analysis · Mathematics 2024-09-24 Verónica Dimant , Silvia Lassalle , Manuel Maestre

In this paper we study symplectic embedding questions for the $\ell_p$-sum of two discs in ${\mathbb R}^4$, when $1 \leq p \leq \infty$. In particular, we compute the symplectic inner and outer radii in these cases, and show how different…

Symplectic Geometry · Mathematics 2019-11-15 Yaron Ostrover , Vinicius G. B. Ramos

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 problem of packing a system of particles as densely as possible is foundational in the field of discrete geometry and is a powerful model in the material and biological sciences. As packing problems retreat from the reach of solution by…

Metric Geometry · Mathematics 2012-12-18 Yoav Kallus , Veit Elser , Simon Gravel

For $0 < \alpha \leq 1$, let $E$ be a compact subset of the $d$-dimensional moment curve in $\mathbb{R}^d$ such that $N(E,\varepsilon) \lesssim \varepsilon^{-\alpha}$ for $0 <\varepsilon <1$ where $N(E,\varepsilon)$ is the smallest number…

Classical Analysis and ODEs · Mathematics 2025-09-08 Shengze Duan , Minh-Quy Pham , Donggeun Ryou

The subspace approximation problem Subspace($k$,$p$) asks for a $k$-dimensional linear subspace that fits a given set of points optimally, where the error for fitting is a generalization of the least squares fit and uses the $\ell_{p}$ norm…

Data Structures and Algorithms · Computer Science 2011-01-04 Amit Deshpande , Kasturi Varadarajan , Madhur Tulsiani , Nisheeth K. Vishnoi

We give improved algorithms for the $\ell_{p}$-regression problem, $\min_{x} \|x\|_{p}$ such that $A x=b,$ for all $p \in (1,2) \cup (2,\infty).$ Our algorithms obtain a high accuracy solution in $\tilde{O}_{p}(m^{\frac{|p-2|}{2p + |p-2|}})…

Data Structures and Algorithms · Computer Science 2024-12-20 Deeksha Adil , Rasmus Kyng , Richard Peng , Sushant Sachdeva

Consider a set P of points in the unit square U, one of them being the origin. For each point p in P you may draw a rectangle in U with its lower-left corner in p. What is the maximum area such rectangles can cover without overlapping each…

Computational Geometry · Computer Science 2021-02-17 Christoph Damerius , Dominik Kaaser , Peter Kling , Florian Schneider

Let $H_k$ be the one dimensional Hilbert transform computed in the direction $(1,2^k)$ in the plane. We show that the maximal operator $\sup_k |H_kf|$ maps $L^p$ of the plane into itself for $1<p<\infty$. The same result with the Hilbert…

Classical Analysis and ODEs · Mathematics 2007-05-23 Michael T. Lacey

In this study, we propose an enhancement to the similarity computation mechanism in multi-modal contrastive pretraining frameworks such as CLIP. Prior theoretical research has demonstrated that the optimal similarity metrics between paired…

Machine Learning · Computer Science 2025-10-20 Naoki Yoshida , Satoshi Hayakawa , Yuhta Takida , Toshimitsu Uesaka , Hiromi Wakaki , Yuki Mitsufuji

We study the rigidity and flexibility of symplectic embeddings of simple shapes. It is first proved that under the condition $r_n^2 \le 2 r_1^2$ the symplectic ellipsoid $E(r_1, ..., r_n)$ with radii $r_1 \le ... \le r_n$ does not embed in…

Symplectic Geometry · Mathematics 2007-05-23 Felix Schlenk

We present two fast constructions of weak*-copies of $\ell ^\infty$ in $H^{\infty}$ and show that such copies are necessarily weak*-complemented. Moreover, via a Paley-Wiener type of stability theorem for bases, a connection can be made in…

Complex Variables · Mathematics 2016-07-12 Eric Amar , Bernard Chevreau , Isabelle Chalendar