Related papers: Covering the hypercube, the uncertainty principle,…

We study the consistency of minimum-norm interpolation in reproducing kernel Hilbert spaces corresponding to bounded kernels. Our main result give lower bounds for the generalization error of the kernel interpolation measured in a…

A covering code is a subset $\mathcal{C} \subseteq \{0,1\}^n$ with the property that any $z \in \{0,1\}^n$ is close to some $c \in \mathcal{C}$ in Hamming distance. For every $\epsilon,\delta>0$, we show a construction of a family of codes…

In areas such as kernel smoothing and non-parametric regression there is emphasis on smooth interpolation and smooth statistical models. Splines are known to have optimal smoothness properties in one and higher dimensions. It is shown, with…

We present a proof of the Harbourne-Hirschowitz conjecture for linear systems with base points of multiplicity seven or less. This proof uses a well-known degeneration of the projective plane, as well as a combinatorial technique that…

In this short note we study two questions about the existence of subgraphs of the hypercube $Q_n$ with certain properties. The first question, due to Erd\H{o}s--Hamburger--Pippert--Weakley, asks whether there exists a bounded degree…

We study translation minimal hypersurfaces and separable minimal hypersurfaces in the ($n+1$)-space with $2m$-norm.

We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…

A topological hyperplane is a subspace of R^n (or a homeomorph of it) that is topologically equivalent to an ordinary straight hyperplane. An arrangement of topological hyperplanes in R^n is a finite set H such that k topological…

A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n\right)$ is such that every convex body in ${\mathbb R}^{n}$ can be covered by a union of the interiors of at most…

Since their introduction by Erd\H{o}s in 1950, covering systems (that is, finite collections of arithmetic progressions that cover the integers) have been extensively studied, and numerous questions and conjectures have been posed regarding…

We prove the convex combination theorem for hyperbolic n-manifolds. Applications are given both in high dimensions and in 3 dimensions. One consequence is that given two geometrically finite subgroups of a discrete group of isometries of…

Hadwiger's covering conjecture is that every $n$-dimensional convex body can be covered by at most $2^n$ of its smaller positive homothetic copies, with $2^n$ copies required only for affine images of $n$-cube. Convex hull of a ball and an…

In this paper, we consider the problem of covering a plane region with unit discs. We present an improved upper bound and the first nontrivial lower bound on the number of discs needed for such a covering, depending on the area and…

An new eigenvalue $\mathbb R$-linear problem arisen in the theory of metamaterials is stated and constructively investigated for circular non-overlapping inclusions. An asymptotic formula for eigenvalues is deduced when the radii of…

We study three covering problems in the plane. Our original motivation for these problems come from trajectory analysis. The first is to decide whether a given set of line segments can be covered by up to four unit-sized, axis-parallel…

Consider the $S_n$-action on $\mathbb{R}^n$ given by permuting coordinates. This paper addresses the following problem: compute $\max_{v,H} |H\cap S_nv|$ as $H\subset\mathbb{R}^n$ ranges over all hyperplanes through the origin and…

In this paper we consider the hyperplane arrangement in $\mathbb{R}^n$ whose hyperplanes are $\{x_i + x_j = 1\mid 1\leq i < j\leq n\}\cup \{x_i=0,1\mid 1\leq i\leq n\}$. We call it the \emph{boxed threshold arrangement} since we show that…

Let $\Pi_q$ be an arbitrary finite projective plane of order $q$. A subset $S$ of its points is called saturating if any point outside $S$ is collinear with a pair of points from $S$. Applying probabilistic tools we improve the upper bound…

Let $P$ be a finite set of points in the plane in general position, that is, no three points of $P$ are on a common line. We say that a set $H$ of five points from $P$ is a $5$-hole in $P$ if $H$ is the vertex set of a convex $5$-gon…

We present sufficient conditions on a smooth uniformly flat hypersurface W in the unit ball to be an interpolation hypersurface or a sampling hypersurface for generalized Bergman spaces associated to the unit ball with its Bergman metric.…