English
Related papers

Related papers: On Continuity Properties for Infinite Rectangle Pa…

200 papers

We prove that the only entrywise transforms of rectangular matrices which preserve total positivity or total non-negativity are either constant or linear. This follows from an extended classification of preservers of these two properties…

Functional Analysis · Mathematics 2020-06-25 Alexander Belton , Dominique Guillot , Apoorva Khare , Mihai Putinar

This work investigates dense packings of congruent hard infinitesimally--thin circular arcs in the two-dimensional Euclidean space. It focuses on those denotable as major whose subtended angle $\theta \in \left ( \pi, 2\pi \right ]$.…

Soft Condensed Matter · Physics 2020-10-28 Juan Pedro Ramírez González , Giorgio Cinacchi

This is the sequel to our first paper concerning the balanced embedding of a non-compact complex manifold into an infinite-dimensional projective space. We prove the uniqueness of such an embedding. The proof relies on fine estimates of the…

Complex Variables · Mathematics 2023-11-21 Jingzhou Sun

We report on recent developments in the dynamics and rigidity of infinite-volume homogeneous spaces, viewed through the lens of circles. By addressing four natural questions about circle packings, we highlight the interplay between…

Dynamical Systems · Mathematics 2026-04-14 Hee Oh

Physical properties of materials are seldom studied in the context of packing problems. In this work we study the behavior of semifluids: materials with particular characteristics, that share properties both with solids and with fluids. We…

Data Structures and Algorithms · Computer Science 2016-07-18 João Pedro Pedroso

We introduce the concept of bi-conformal transformation, as a generalization of conformal ones, by allowing two orthogonal parts of a manifold with metric $\G$ to be scaled by different conformal factors. In particular, we study their…

Mathematical Physics · Physics 2016-08-16 Alfonso García-Parrado , José M. M. Senovilla

We present filling as a new type of spatial subdivision problem that is related to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most…

Optimization and Control · Mathematics 2012-08-29 Carolyn L. Phillips , Joshua A. Anderson , Elizabeth R. Chen , Sharon C. Glotzer

Representing a polygon using a set of simple shapes has numerous applications in different use-case scenarios. We consider the problem of covering the interior of a rectilinear polygon with holes by a set of area-weighted, axis-aligned…

Computational Geometry · Computer Science 2023-12-15 Kathrin Hanauer , Martin P. Seybold , Julian Unterweger

This article has been written for an educational magazine whose target audience consists of students and teachers of mathematics in universities, colleges and schools. It concerns a notion of duality between rectangles. A proof is given…

Number Theory · Mathematics 2009-06-18 Graham Everest , Jonny Griffiths

Solving nesting problems or irregular strip packing problems is to position polygons in a fixed width and unlimited length strip, obeying polygon integrity containment constraints and non-overlapping constraints, in order to minimize the…

Optimization and Control · Mathematics 2017-07-25 Jeinny Peralta , Marina Andretta , José Fernando Oliveira

This paper suveys different variants of the following problem: Given a convex set $K$ and a sequence $\{C_i\}$ of convex bodies in $E^n$, is it possible to pack the sequence of bodies in $K$ or cover $K$ with the bodies? Algorithmic…

Metric Geometry · Mathematics 2022-02-24 Gábor Fejes Tóth

A rectangular layout is a partition of a rectangle into a finite set of interior-disjoint rectangles. Rectangular layouts appear in various applications: as rectangular cartograms in cartography, as floorplans in building architecture and…

Computational Geometry · Computer Science 2009-01-27 David Eppstein , Elena Mumford , Bettina Speckmann , Kevin Verbeek

Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…

Combinatorics · Mathematics 2025-06-30 Jean Cardinal , Vincent Pilaud

We first provide a classification of the pure rotational motion of 2 particles on a sphere interacting via a repelling potential. This is achieved by providing a simple geometric equivalence between repelling particles and attracting…

Mathematical Physics · Physics 2026-03-03 Luis García-Naranjo , James Montaldi

We consider the linear complementarity problem with uncertain data modeled by intervals, representing the range of possible values. Many properties of the linear complementarity problem (such as solvability, uniqueness, convexity, finite…

Optimization and Control · Mathematics 2025-10-07 Milan Hladík

Packing problems have been of great interest in many diverse contexts for many centuries. The optimal packing of identical objects has been often invoked to understand the nature of low temperature phases of matter. In celebrated work,…

Statistical Mechanics · Physics 2009-11-13 Antonio Trovato , Trinh X. Hoang , Jayanth R. Banavar , Amos Maritan

Given a collection of N rectangles such that the side ratio of each one is a quadratic irrationality, we find all rectangles which can be tiled by rectangles similar to one of the given ones. It means that each possible shape can be used…

Combinatorics · Mathematics 2016-12-06 Fyodor Sharov

Interaction of waves with point and line defects are usually described by $\delta$-function potentials supported on points or lines. In two dimensions, the scattering problem for a finite collection of point defects or parallel line defects…

Quantum Physics · Physics 2022-01-14 Hai V. Bui , Farhang Loran , Ali Mostafazadeh

We consider the irregular strip packing problem of rasterized shapes, where a given set of pieces of irregular shapes represented in pixels should be placed into a rectangular container without overlap. The rasterized shapes provide simple…

Computational Geometry · Computer Science 2022-03-23 Shunji Umetani , Shohei Murakami

In the convex covering problem, we are given a convex polygon with holes $P$ and the goal is to cover $P$ using a small number of convex polygons that lie inside $P$. In this paper, we solve the problem using the following strategy. We find…

Computational Geometry · Computer Science 2025-06-23 Guilherme D. da Fonseca
‹ Prev 1 3 4 5 6 7 10 Next ›