Daniel Horsley

collaborators

3 papers

math.CO2016

Decomposing $K_{u + w} - K_{u}$ into cycles of various lengths

Daniel Horsley, Rosalind A. Hoyte

We prove that the complete graph with a hole $K_{u + w} - K_{u}$ can be decomposed into cycles of arbitrary specified lengths provided that the obvious necessary conditions are satisfied…

math.CO2015

More nonexistence results for symmetric pair coverings

Nevena Francetić, Sarada Herke, Daniel Horsley

A $(v, k, λ)$ -covering is a pair $(V, B)$ , where $V$ is a $v$ -set of points and $B$ is a collection of $k$ -subsets of $V$ (called blocks), such that every unorder…

cs.IT2015

Compressed sensing with combinatorial designs: theory and simulations

Darryn Bryant, Charles Colbourn, Daniel Horsley +1

In 'An asymptotic result on compressed sensing matrices', a new construction for compressed sensing matrices using combinatorial design theory was introduced. In this paper, we use…

Decomposing Ku+w​−Ku​ into cycles of various lengths

More nonexistence results for symmetric pair coverings

Compressed sensing with combinatorial designs: theory and simulations

Decomposing $K_{u + w} - K_{u}$ into cycles of various lengths