On Asymmetric Coverings and Covering Numbers

Details On Asymmetric Coverings and Covering Numbers On Asymmetric Coverings and Covering Numbers

2002-05-28

arxiv.org/abs/math/0205303v1

Mathematics

Combinatorics

11 pages

Scientific paper

An asymmetric covering D(n,R) is a collection of special subsets S of an n-set such that every subset T of the n-set is contained in at least one special S with |S| - |T| <= R. In this paper we compute the smallest size of any D(n,1) for n <= 8. We also investigate ``continuous'' and ``banded'' versions of the problem. The latter involves the classical covering numbers C(n,k,k-1), and we determine the following new values: C(10,5,4) = 51, C(11,7,6,) =84, C(12,8,7) = 126, C(13,9,8)= 185 and C(14,10,9) = 259. We also find the number of nonisomorphic minimal covering designs in several cases.

Affiliated with

Also associated with

No associations

Rating

On Asymmetric Coverings and Covering Numbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Asymmetric Coverings and Covering Numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Asymmetric Coverings and Covering Numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-169354