Revisiting the spreading and covering numbers
Commutative Algebra
2013-05-29 v2 Combinatorics
Abstract
We revisit the problem of computing the spreading and covering numbers. We show a connection between some of the spreading numbers and the number of non-negative integer 2x2 matrices whose entries sum to d, and we construct an algorithm to compute improved upper bounds for the covering numbers.
Keywords
Cite
@article{arxiv.1109.5847,
title = {Revisiting the spreading and covering numbers},
author = {Ben Babcock and Adam Van Tuyl},
journal= {arXiv preprint arXiv:1109.5847},
year = {2013}
}
Comments
7 pages; needs the package tkz-graph.sty; substantial rewrite of the first version; to appear in Australasian Journal of Combinatorics