Related papers: Colorful Vector Balancing

R. B. Kusner [R. Guy, Amer. Math. Monthly 90 (1983), 196--199] asked whether a set of vectors in a d-dimensional real vector space such that the l-p distance between any pair is 1, has cardinality at most d+1. We show that this is true for…

Stein's method is used to obtain two theorems on multivariate normal approximation. Our main theorem, Theorem 1.2, provides a bound on the distance to normality for any nonnegative random vector. Theorem 1.2 requires multivariate size bias…

We present examples of $p$-sub-exponential random variables for any positive $p$. We prove two types of concentration of standard $p$-norms ($2$-norm is the Euclidean norm) of random vectors with independent $p$-sub-exponential coordinates…

In this paper we study two directions of extending the classical Erd\H os-Ko-Rado theorem which states that any family of $k$-element subsets of the set $[n] = \{1,\ldots,n\}$ in which any two sets intersect, has cardinality at most…

Motivated by problems in controlled experiments, we study the discrepancy of random matrices with continuous entries where the number of columns $n$ is much larger than the number of rows $m$. Our first result shows that if $\omega(1) = m =…

Let $X_1,\dots, X_n$ be independent and identically distributed random vectors in $\mathbb{R}^d$. Suppose $\mathbb{E} X_1=0$, $\mathrm{Cov}(X_1)=I_d$, where $I_d$ is the $d\times d$ identity matrix. Suppose further that there exist positive…

We introduce $\varepsilon$-approximate versions of the notion of Euclidean vector bundle for $\varepsilon \geq 0$, which recover the classical notion of Euclidean vector bundle when $\varepsilon = 0$. In particular, we study \v{C}ech…

We show that the choice of the norm has a great impact on the construction of ensembles of bred vectors. The geometric norm maximizes (in comparison with other norms like the Euclidean one) the statistical diversity of the ensemble while,…

We prove that a random graph $G(n,p)$, with $p$ above the Hamiltonicity threshold, is typically such that for any $r$-colouring of its edges there exists a Hamilton cycle with at least $(2/(r+ 1)-o(1))n$ edges of the same colour. This…

Let $(X_i)_{1 \le i \le n}$ be independent and identically distributed (i.i.d.) standard Gaussian random variables, and denote by $X_{(n)} = \max_{1 \le i \le n} X_i$ the maximum order statistic. It is well-known in extreme value theory…

Minimization of the (regularized) entropy of classification probabilities is a versatile class of discriminative clustering methods. The classification probabilities are usually defined through the use of some classical losses from…

We determine the order of magnitude of the $n$th $\ell_p$-polarization constant of the unit sphere $S^{d-1}$ for every $n,d \geq 1$ and $p>0$. For $p=2$, we prove that extremizers are isotropic vector sets, whereas for $p=1$, we show that…

Motivated both by recently introduced forms of list colouring and by earlier work on independent transversals subject to a local sparsity condition, we use the semi-random method to prove the following result. For any function $\mu$…

We consider the task of certifying that a random $d$-dimensional subspace $X$ in $\mathbb{R}^n$ is well-spread - every vector $x \in X$ satisfies $c\sqrt{n} \|x\|_2 \leq \|x\|_1 \leq \sqrt{n}\|x\|_2$. In a seminal work, Barak et. al. showed…

We use the probabilistic method to obtain versions of the colorful Carath\'eodory theorem and Tverberg's theorem with tolerance. In particular, we give bounds for the smallest integer $N=N(t,d,r)$ such that for any $N$ points in $R^d$,…

It is shown that the following holds for each $\varepsilon>0$. For $G$ an $n$-vertex graph of maximum degree $D$ and "lists" $L_v$ ($v \in V(G)$) chosen independently and uniformly from the ($(1+\varepsilon)\ln n$)-subsets of $\{1, ...,…

We present several refinements on the fluctuations of sequences of random vectors (with values in the Euclidean space $\mathbb{R}^d$) which converge after normalization to a multidimensional Gaussian distribution. More precisely we refine…

For every list of integers x_1, ..., x_m there is some j such that x_1 + ... + x_j - x_{j+1} - ... - x_m \approx 0. So the list can be nearly balanced and for this we only need one alternation between addition and subtraction. But what if…

Let $\eta_i, i=1,..., n$ be iid Bernoulli random variables, taking values $\pm 1$ with probability 1/2. Given a multiset $V$ of $n$ elements $v_1, ..., v_n$ of an additive group $G$, we define the \emph{concentration probability} of $V$ as…

Let $K$ denote a field and let $V$ denote a vector space over $K$ with finite positive dimension. By a Leonard pair on $V$ we mean an ordered pair of linear transformations $A:V \to V$ and $A^*:V \to V$ that satisfy the following two…