Related papers: VC-Density in Pairs of Ordered Vector Space

We consider a variant of bin packing called multiple-choice vector bin packing. In this problem we are given a set of items, where each item can be selected in one of several $D$-dimensional incarnations. We are also given $T$ bin types,…

In this paper, we are dealing with constrained vector optimisation problems where the objective function acts between real linear-topological spaces. Our aim is to study the relationships between the sets of properly efficient solutions to…

In the polluted bootstrap percolation model, the vertices of a graph are independently declared initially occupied with probability p or closed with probability q. At subsequent steps, a vertex becomes occupied if it is not closed and it…

We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…

We force $2^\lambda$ to be large and for many pairs in the interval $(\lambda,2^\lambda)$ a stronger version of the polarized partition relations hold. We apply this toproblem in general topology

Using the finite Fourier transform, we introduce a generalization of Pauli-spin matrices for $d$-dimensional spaces, and the resulting set of unitary matrices $S(d) $ is a basis for $d\times d$ matrices. If $N=d_{1}\times…

We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…

We establish some bounds on the number of higher-dimensional partitions by volume. In particular, we give bounds via vector partitions and MacMahon's numbers.

Recently, a number of interesting relations have been discovered between generalised Pauli/Dirac groups and certain finite geometries. Here, we succeeded in finding a general unifying framework for all these relations. We introduce…

Let $M$ be an $n\times n$ random matrix with entries in $\{0, 1\}$, where each row is independently and uniformly sampled from the set of all vectors in $\{0, 1\}^n$ containing exactly $d$ ones, with $d=pn$ for some fixed constant $p\in…

We consider the rate of convergence of the expected loss of empirically optimal vector quantizers. Earlier results show that the mean-squared expected distortion for any fixed distribution supported on a bounded set and satisfying some…

We examine the dependence structure of finite block-maxima of multivariate distributions. We provide a closed form expression for the copula density of the vector of the block-maxima. Further, we show how partial derivatives of…

Take a set of balls in $\mathbb R^d$. We find a subset of pairwise disjoint balls whose combined perimeter controls the perimeter of the union of the original balls. This can be seen as a boundary version of the Vitali covering lemma. We…

Given a domain $X$ and a collection $\mathcal{H}$ of functions $h:X\to \{0,1\}$, the Vapnik-Chervonenkis (VC) dimension of $\mathcal{H}$ measures its complexity in an appropriate sense. In particular, the fundamental theorem of statistical…

Spatially coupled codes have been shown to universally achieve the capacity for a large class of channels. Many variants of such codes have been introduced to date. We discuss a further such variant that is particularly simple and is…

A $1$-avoiding set is a subset of $\mathbb{R}^n$ that does not contain pairs of points at distance $1$. Let $m_1(\mathbb{R}^n)$ denote the maximum fraction of $\mathbb{R}^n$ that can be covered by a measurable $1$-avoiding set. We prove two…

We introduce a parameter space for periodic point sets, given as unions of $m$ translates of point lattices. In it we investigate the behavior of the sphere packing density function and derive sufficient conditions for local optimality.…

In 1993 Foisy et al. proved that the optimal Euclidean planar double bubble---the least-perimeter way to enclose and separate two given areas---is three circular arcs meeting at 120 degrees. We consider the plane with density $r^p$, joining…

In this paper we give upper bounds on the number of minimal separators and potential maximal cliques of graphs w.r.t. two graph parameters, namely vertex cover ($\operatorname{vc}$) and modular width ($\operatorname{mw}$). We prove that for…

For a graph, $G$, and a vertex $v \in V(G)$, let $N[v]$ be the set of vertices adjacent to and including $v$. A set $D \subseteq V(G)$ is a vertex identifying code if for any two distinct vertices $v_1, v_2 \in V(G)$, the vertex sets…