An asymptotic existence result on compressed sensing matrices

For any rational number $h$ and all sufficiently large $n$ we give a deterministic construction for an $n\times \lfloor hn\rfloor$ compressed sensing matrix with $(\ell_1,t)$-recoverability where $t=O(\sqrt{n})$. Our method uses pairwise balanced designs and complex Hadamard matrices in the construction of $\epsilon$-equiangular frames, which we introduce as a generalisation of equiangular tight frames. The method is general and produces good compressed sensing matrices from any appropriately chosen pairwise balanced design. The $(\ell_1,t)$-recoverability performance is specified as a simple function of the parameters of the design. To obtain our asymptotic existence result we prove new results on the existence of pairwise balanced designs in which the numbers of blocks of each size are specified.Comment: 15 pages, no figures. Minor improvements and updates in February 201

Mutually orthogonal latin squares with large holes

Two latin squares are orthogonal if, when they are superimposed, every ordered pair of symbols appears exactly once. This definition extends naturally to `incomplete' latin squares each having a hole on the same rows, columns, and symbols. If an incomplete latin square of order $n$ has a hole of order $m$, then it is an easy observation that $n \ge 2m$. More generally, if a set of $t$ incomplete mutually orthogonal latin squares of order $n$ have a common hole of order $m$, then $n \ge (t+1)m$. In this article, we prove such sets of incomplete squares exist for all $n,m \gg 0$ satisfying $n \ge 8(t+1)^2 m$

Completion and deficiency problems

Given a partial Steiner triple system (STS) of order $n$, what is the order of the smallest complete STS it can be embedded into? The study of this question goes back more than 40 years. In this paper we answer it for relatively sparse STSs, showing that given a partial STS of order $n$ with at most $r \le \varepsilon n^2$ triples, it can always be embedded into a complete STS of order $n+O(\sqrt{r})$, which is asymptotically optimal. We also obtain similar results for completions of Latin squares and other designs. This suggests a new, natural class of questions, called deficiency problems. Given a global spanning property $\mathcal{P}$ and a graph $G$, we define the deficiency of the graph $G$ with respect to the property $\mathcal{P}$ to be the smallest positive integer $t$ such that the join $G\ast K_t$ has property $\mathcal{P}$. To illustrate this concept we consider deficiency versions of some well-studied properties, such as having a $K_k$-decomposition, Hamiltonicity, having a triangle-factor and having a perfect matching in hypergraphs. The main goal of this paper is to propose a systematic study of these problems; thus several future research directions are also given

Existence of perfect Mendelsohn designs with k=5 and λ>1

AbstractLet υ, k, and λ be positive integers. A (υ, k, λ)-Mendelsohn design (briefly (υ, k, λ)-MD) is a pair (X, B) where X is a υ-set (of points) and B is a collection of cyclically ordered k-subsets of X (called blocks) such that every ordered pair of points of X are consecutive in exactly λ blocks of B. A set of k distinct elements {a1, a2,…, ak} is said to be cyclically ordered by a1<a2<⋯<ak<a1 and the pair ai, ai+t is said to be t-apart in cyclic k-tuple (a1, a2,…, ak) where i+t is taken modulo k. It for all t=1,2,…, k-1, every ordered pair of points of X is t-apart in exactly λ blocks of B, then the (υ, k, λ)-MD is called a perfect design and is denoted briefly by (υ, k, λ)-PMD. In this paper, we shall be concerned mainly with the case where k=5 and λ>1. It will be shown that the necessary condition for the existence of a (υ, 5, λ)-PMD, namely, λv(υ-1)≡0 (mod 5), is also sufficient for λ>1 with the possible exception of pairs (υ, λ) where λ=5 and υ=18 and 28