Revisiting the spreading and covering numbers
classification
🧮 math.AC
math.CO
keywords
numberscoveringspreadingalgorithmboundscomputecomputingconnection
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.