Related papers: Small union with large set of centers

$\renewcommand{\Re}{\mathbb{R}}$Given a set $P$ of $n$ points in $\Re^d$, consider the problem of computing $k$ subsets of $P$ that form clusters that are well-separated from each other, and each of them is large (cardinality wise). We…

We consider the covering of a ball in certain normed spaces by its congruent subsets and show that if the finite number of sets is not greater than the dimensionality of the space, then the centre of the ball either belongs to the interior…

Consider a closed Riemannian $n$-manifold $M$ admitting a negatively curved Riemannian metric. We show that for every Riemannian metric on $M$ of sufficiently small volume, there is a point in the universal cover of $M$ such that the volume…

Under a map T, a point x recurs at rate given by a sequence {r_n} near a point x_0 if d(T^n(x),x_0)< r_n infinitely often. Let us fix x_0, and consider the set of those x's. In this paper, we study the size of this set for expanding maps…

In optimization or machine learning problems we are given a set of items, usually points in some metric space, and the goal is to minimize or maximize an objective function over some space of candidate solutions. For example, in clustering…

A small cover is a closed smooth manifold of dimension $n$ having a locally standard $\mathbb{Z}_2^n$-action whose orbit space is isomorphic to a simple polytope. A typical example of small covers is a real projective toric manifold (or,…

Modeling deformations of a real object is an important task in computer vision, biomedical engineering and biomechanics. In this paper, we focus on a situation where a three-dimensional object is rotationally deformed about a fixed axis,…

Reduced k-means clustering is a method for clustering objects in a low-dimensional subspace. The advantage of this method is that both clustering of objects and low-dimensional subspace reflecting the cluster structure are simultaneously…

For a space $X$ let $\mathcal{K}(X)$ be the set of compact subsets of $X$ ordered by inclusion. A map $\phi:\mathcal{K}(X) \to \mathcal{K}(Y)$ is a relative Tukey quotient if it carries compact covers to compact covers. When there is such a…

A regular graph $G = (V,E)$ is an $(\varepsilon,\gamma)$ small-set expander if for any set of vertices of fractional size at most $\varepsilon$, at least $\gamma$ of the edges that are adjacent to it go outside. In this paper, we give a…

We introduce a set of generic conditions for the slow contracting Universe and for a narrowed-down category of models called fast-roll models. We present general conditions for super horizon freeze-out of scalar and tensor perturbations and…

In this work we approach the problem of determining which (compact) semialgebraic subsets of ${\mathbb R}^n$ are images under polynomial maps $f:{\mathbb R}^m\to{\mathbb R}^n$ of the closed unit ball $\overline{{\mathcal B}}_m$ centered at…

We study subsets of the $n$-dimensional vector space over the finite field $\mathbb{F}_q$, for odd $q$, which contain either a sphere for each radius or a sphere for each first coordinate of the center. We call such sets radii spherical…

The lower dimensional Busemann-Petty problem asks, whether n-dimensional centrally symmetric convex bodies with smaller i-dimensional central sections necessarily have smaller volumes. The paper contains a complete solution to the problem…

How small can a set be while containing many configurations? Following up on earlier work of Erd\H os and Kakutani \cite{MR0089886}, M\'ath\'e \cite{MR2822418} and Molter and Yavicoli \cite{Molter}, we address the question in two…

In the standard planar $k$-center clustering problem, one is given a set $P$ of $n$ points in the plane, and the goal is to select $k$ center points, so as to minimize the maximum distance over points in $P$ to their nearest center. Here we…

We study random spherical harmonics at shrinking scales. We compare the mass assigned to a small spherical cap with its area, and find the smallest possible scale at which, with high probability, the discrepancy between them is small…

Suppose we put an $\epsilon$-disk around each lattice point in the plane, and then we rotate this object around the origin for a set $\Theta$ of angles. When do we cover the whole plane, except for a neighborhood of the origin? This is the…

We study the maximum size of a set system on $n$ elements whose trace on any $b$ elements has size at most $k$. We show that if for some $b \ge i \ge 0$ the shatter function $f_R$ of a set system $([n],R)$ satisfies $f_R(b) < 2^i(b-i+1)$…

A random matrix model with a sigma-model like constraint, the restricted trace ensemble (RTE), is solved in the large-n limit. In the macroscopic limit the smooth connected two-point resolvent G(z,w) is found to be non-universal, extending…