Related papers: Shallow Packings in Geometry

We consider the problem of describing the typical (possibly) non-linear code of minimum distance bounded from below over a large alphabet. We concentrate on block codes with the Hamming metric and on subspace codes with the injection…

In this manuscript, we initiate the study of the number of rational points with bounded denominators, contained in a non-isotropic $\delta_1\times\ldots\times \delta_R$ neighborhood of a compact submanifold $\mathcal{M}$ of codimension $R$…

Multidimensional packing problems generalize the classical packing problems such as Bin Packing, Multiprocessor Scheduling by allowing the jobs to be $d$-dimensional vectors. While the approximability of the scalar problems is well…

Feature hashing, also known as {\em the hashing trick}, introduced by Weinberger et al. (2009), is one of the key techniques used in scaling-up machine learning algorithms. Loosely speaking, feature hashing uses a random sparse projection…

In this paper we prove the Hausdorff dimension of the set of (nondegenerate) singular two-dimensional vectors with uniform exponent $\mu$ $\in$ (1/2, 1) is 2(1 -- $\mu$) when $\mu$ $\ge$ $\sqrt$ 2/2, whereas for $\mu$ \textless{} $\sqrt$…

We establish Euclidean-type lower bounds for the codimension-1 Hausdorff measure of sets that separate points in doubling and linearly locally contractible metric manifolds. This gives a quantitative topological isoperimetric inequality in…

$\renewcommand{\Re}{\mathbb{R}}$ We re-examine parameters for the two main space decomposition techniques---bottom-vertex triangulation, and vertical decomposition, including their explicit dependence on the dimension $d$, and discover…

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)$…

We show that the VC-density of any partitioned formula in a pair of ordered vector spaces is bounded above by twice the number of parameter variables. We also show that this bound is optimal and, as a by-product, we prove that no dense pair…

Support Vector Data Description (SVDD) is a machine-learning technique used for single class classification and outlier detection. SVDD formulation with kernel function provides a flexible boundary around data. The value of kernel function…

By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…

Let $T$ be an expanding Markov map with a countable number of inverse branches and a repeller $\Lambda$ contained within the unit interval. Given $\alpha \in \R_+$ we consider the set of points $x \in \Lambda$ for which $T^n(x)$ hits a…

The Paulsen problem is a basic open problem in operator theory: Given vectors $u_1, \ldots, u_n \in \mathbb R^d$ that are $\epsilon$-nearly satisfying the Parseval's condition and the equal norm condition, is it close to a set of vectors…

Let $\boldsymbol{\tau}=(\tau_1,\dots,\tau_m)\in \mathbb{R}_{\ge 0}^m$ satisfy $\sum_{i=1}^m \tau_i>1$ and $\tau_1\ge \cdots \ge \tau_m$ Let $\Psi_{\boldsymbol\tau}=(\psi_1,\dots,\psi_m)$ be given by $$ \psi_i(q)=q^{-\tau_i}, \qquad…

For an integer d>=1, let tau(d) be the smallest integer with the following property: If v1,v2,...,vt is a sequence of t>=2 vectors in [-1,1]^d with v1+v2+...+vt in [-1,1]^d, then there is a subset S of {1,2,...,t} of indices,…

Questions surrounding the spatial disposition of particles in various condensed-matter systems continue to pose many theoretical challenges. This paper explores the geometric availability of amorphous many-particle configurations that…

The Sample Compression Conjecture of Littlestone & Warmuth has remained unsolved for over two decades. This paper presents a systematic geometric investigation of the compression of finite maximum concept classes. Simple arrangements of…

It is a long-standing open problem whether there always exists a compression scheme whose size is of the order of the Vapnik-Chervonienkis (VC) dimension $d$. Recently compression schemes of size exponential in $d$ have been found for any…

The concept of the \textit{relative fractional packing number} between two graphs $G$ and $H$, initially introduced in arXiv:2307.06155 [math.CO], serves as an upper bound for the ratio of the zero-error Shannon capacity of these graphs.…

In this paper, we give upper bounds on the sizes of $(d, L)$ list-decodable codes in the Hamming metric space from covering codes with the covering radius smaller than or equal to $d$. When the list size $L$ is $1$, this gives many new…