Related papers: Small union with large set of centers

In a mass partition problem, we are interested in finding equitable partitions of smooth measures in $\mathbb{R}^d$. In this manuscript, we study the problem of finding simultaneous bisections of measures using scaled copies of a prescribed…

The $k$-center problem is to choose a subset of size $k$ from a set of $n$ points such that the maximum distance from each point to its nearest center is minimized. Let $Q=\{Q_1,\ldots,Q_n\}$ be a set of polygons or segments in the…

Let $f$ be an $R$-closed homeomorphism on a connected orientable closed surface $M$. In this paper, we show that If $M$ has genus more than one, then each minimal set is either a periodic orbit or an extension of a Cantor set. If $M =…

We study the relationship between the sizes of two sets $B, S\subset\mathbb{R}^2$ when $B$ contains either the whole boundary, or the four vertices, of a square with axes-parallel sides and center in every point of $S$, where size refers to…

The problem of constrained $k$-center clustering has attracted significant attention in the past decades. In this paper, we study balanced $k$-center cluster where the size of each cluster is constrained by the given lower and upper bounds.…

It has been shown that for a given set of points in a plane, the least-squares regression line pivots about a fixed point when any single point in the set is repeated. We consider what happens when more than one point is repeated.…

We study the relationship between the sizes of sets $B,S$ in $\mathbb{R}^n$ where $B$ contains the $k$-skeleton of an axes-parallel cube around each point in $S$, generalizing the results of Keleti, Nagy, and Shmerkin about such sets in the…

A non-unitary version of quantum scattering is studied via an exactly solvable toy model. The model is merely asymptotically local since the smooth path of the coordinate is admitted complex in the non-asymptotic domain. At any real…

We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ideals. Using efficient algorithms for constructing a…

Consider $d$ disjoint closed subintervals of the unit interval and consider an orientation preserving expanding map which maps each of these subintervals to the whole unit interval. The set of points where all iterates of this expanding map…

We study the problem of determining whether a given frame is scalable, and when it is, understanding the set of all possible scalings. We show that for most frames this is a relatively simple task in that the frame is either not scalable or…

Let us say that an element of a given family $\A$ of subsets of $\R^d$ can be reconstructed using $n$ test sets if there exist $T_1,...,T_n \subset \R^d$ such that whenever $A,B\in \A$ and the Lebesgue measures of $A \cap T_i$ and $B \cap…

In this paper, we study generalized versions of the k-center problem, which involves finding k circles of the smallest possible equal radius that cover a finite set of points in the plane. By utilizing the Minkowski gauge function, we…

Suppose we are given a finite set of points $P$ in $\R^3$ and a collection of polytopes $\mathcal{T}$ that are all translates of the same polytope $T$. We consider two problems in this paper. The first is the set cover problem where we want…

We consider discretization of the 'geometric cover problem' in the plane: Given a set $P$ of $n$ points in the plane and a compact planar object $T_0$, find a minimum cardinality collection of planar translates of $T_0$ such that the union…

In this paper, we describe on the one hand, all relative minimal models Y of a minuscule Schubert variety X using some combinatorics on quivers and we prove that the morphism from Y to X is small (in the sense of intersection cohomology).…

Our aim is to find the minimal Hausdorff dimension of the union of scaled and/or rotated copies of the $k$-skeleton of a fixed polytope centered at the points of a given set. For many of these problems, we show that a typical arrangement in…

We study the problem of covering a given set of $n$ points in a high, $d$-dimensional space by the minimum enclosing polytope of a given arbitrary shape. We present algorithms that work for a large family of shapes, provided either only…

As was known to H. Poincare, an orientation preserving circle homeomorphism without periodic points is either minimal or has no dense orbits, and every orbit accumulates on the unique minimal set. In the first case the minimal set is the…

We study the problem of rotating a simple polygon to contain the maximum number of elements from a given point set in the plane. We consider variations of this problem where the rotation center is a given point or lies on a line segment, a…