相关论文: Motif Patterns and Coverings of Points with Unit D…
We study the Unique Set Cover problem on unit disks and unit squares. For a given set $P$ of $n$ points and a set $D$ of $m$ geometric objects both in the plane, the objective of the Unique Set Cover problem is to select a subset…
This article is a gentle introduction to the mathematical area known as circle packing, the study of the kinds of patterns that can be formed by configurations of non-overlapping circles. The first half of the article is an exposition of…
We study the problem of covering a given point set in the plane by unit disks so that each point is covered exactly once. We prove that 17 points can always be exactly covered. On the other hand, we construct a set of 657 points where an…
We consider moduli spaces of $d$-dimensional manifolds with embedded particles and discs. In this moduli space, the location of the particles and discs is constrained by the $d$-dimensional manifold. We will compare this moduli space with…
In the packing-constrained point covering problem, PC^2, one seeks configurations of points in the plane that cannot all be covered by a packing arrangement of unit disks. We consider in particular the problem of finding the minimum number…
Given a set of coins arranged in a line, we remove heads-up coins one at a time and flip any adjacent coins after each removal. The coin-removal problem is to determine for which arrangements of coins it is possible to remove all of the…
We consider the situation where one is given a set S of points in the plane and a collection D of unit disks embedded in the plane. We show that finding a minimum cardinality subset of D such that any path between any two points in S is…
I discuss some problems featuring scattering due to discrete edges on certain structures. These problems stem from linear difference equations and the underlying basic issue can be mapped to Wiener-Hopf factorization on an annulus in the…
We establish coupled fixed point theorems for contraction involving rational expressions in partially ordered metric spaces.
A packing of disks in the plane is a set of disks with disjoint interiors. This paper is a survey of some open questions about such packings. It is organized into five themes: compacity, conjugacy, density, uniformity and computability.
We apply an old method for constructing points-and-lines configurations in the plane to study some recent questions in incidence geometry.
Given a set of $n$ points in the plane, the Unit Disk Cover (UDC) problem asks to compute the minimum number of unit disks required to cover the points, along with a placement of the disks. The problem is NP-hard and several approximation…
The present paper formulates and solves a problem of dividing coins. The basic form of the problem seeks the set of the possible ways of dividing coins of face values 1,2,4,8,... between three people. We show that this set possesses a…
Let $S$ be a set of $n$ points in the plane. We present several different algorithms for finding a pair of points in $S$ such that any disk that contains that pair must contain at least $cn$ points of $S$, for some constant $c>0$. The first…
We investigate the problem of assembling general shapes and patterns in a model in which particles move based on uniform external forces until they encounter an obstacle. While previous work within this model of assembly has focused on…
We construct a model in which stable magnetic monopoles have magnetic charges that are identical to the electric charges on leptons and quarks and the colored monopoles are confined by strings in color singlets.
We obtain general bounds on scattering processes involving charged particles in 1+1 spacetime dimensions. After a general analysis we derive mostly numerical bounds on couplings in theories with $O(N)$ and $U(N)$ global symmetries. The…
We consider the problem of identifying n points in the plane using disks, i.e., minimizing the number of disks so that each point is contained in a disk and no two points are in exactly the same set of disks. This problem can be seen as an…
In this article, we consider colorable variations of the Unit Disk Cover ({\it UDC}) problem as follows. {\it $k$-Colorable Discrete Unit Disk Cover ({\it $k$-CDUDC})}: Given a set $P$ of $n$ points, and a set $D$ of $m$ unit disks (of…
We study the collection of points on the modular surface obtained from the logarithm embeddings of the groups of units in totally real cubic number fields. We conjecture that this set is dense and show that its closure contains countably…