Related papers: On exact covering with unit disks

Given a set of unit-disks in the plane with union area $A$, what fraction of $A$ can be covered by selecting a pairwise disjoint subset of the disks? Rado conjectured 1/4 and proved $1/4.41$. Motivated by the problem of channel-assignment…

It is well-known that the number of non-crossing perfect matchings of $2k$ points in convex position in the plane is $C_k$, the $k$th Catalan number. Garc\'ia, Noy, and Tejel proved in 2000 that for any set of $2k$ points in general…

We introduce and study certain notions which might serve as substitutes for maximum density packings and minimum density coverings. A body is a compact connected set which is the closure of its interior. A packing $\cal P$ with congruent…

We define the ``volume'' contained by pointed $k$-surfaces, first studied by the author in [9], and we show that this volume is always finite. Likewise, we show that the surface area of a pointed $k$-surface is always finite.

We use results of [6] to enlarge our knowledge of the approximate fixed point property (AFPP) for digital images in $\mathbb{Z}^2$. In particular, we study conditions under which the union of two convex digital disks has the AFPP.

An almost cover of a finite set in the affine space is a collection of hyperplanes that together cover all points of the set except one. Using the polynomial method, we determine the minimum size of an almost cover of the vertex set of the…

Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-dimensional matching problem asks whether there is a disjoint collection of the hyperedges which…

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…

In this paper we discuss various special problems on packing and covering. Among others we survey the problems and results concerning finite arrangements, Minkowskian, saturated, compact, and totally separable packings. We discuss shortest…

We revisit the following problem (along with its higher dimensional variant): Given a set $S$ of $n$ points inside an axis-parallel rectangle $U$ in the plane, find a maximum-area axis-parallel sub-rectangle that is contained in $U$ but…

For a set of n points in the plane, we consider the axis--aligned (p,k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain n-k points. In this paper, we consider the boxes to be either squares or…

We strengthen, in various directions, the theorem of Garnett that every $\sigma$-compact, completely regular space $X$ occurs as a Gleason part for some uniform algebra. In particular, we show that the uniform algebra can always be chosen…

A map is a connected topological graph cellularly embedded in a surface and a complete map is a cellularly embedded complete graph in a surface. In this paper, all automorphisms of complete maps of order n are determined by permutations on…

In a geometry, a maximal cap is a collection of points of largest size containing no lines. In AG(4,3), maximal caps contain 20 points. The 81 points of AG(4,3) can be partitioned into 4 mutually disjoint maximal caps together with a single…

In 1945, A. W. Goodman and R. E. Goodman proved the following conjecture by P. Erd\H{o}s: Given a family of (round) disks of radii $r_1$, $\ldots$, $r_n$ in the plane it is always possible to cover them by a disk of radius $R = \sum r_i$,…

A point set $M$ in $m$-dimensional Euclidean space is called an integral point set if all the distances between the elements of $M$ are integers, and $M$ is not situated on an $(m-1)$-dimensional hyperplane. We improve the linear lower…

Differential completions and compactifications of differential spaces are introduced and investigated. The existence of the maximal differential completion and the maximal differential compactification is proved. A sufficient condition for…

This paper studies problems related to visibility among points in the plane. A point $x$ \emph{blocks} two points $v$ and $w$ if $x$ is in the interior of the line segment $\bar{vw}$. A set of points $P$ is \emph{$k$-blocked} if each point…

Let U be the open unit disc in C and let B be the open unit ball in C^2. We prove that every discrete subset of B is contained in the range f(U) of a complete, proper holomorphic embedding f:U-->B. Here the completeness of f means that for…

We produce curves with a record number of points over the finite fields with $4$, $9$, $16$ and $25$ elements, as unramified abelian covers of algebraic curves.