2-cancellative hypergraphs and codes

Details 2-cancellative hypergraphs and codes 2-cancellative hypergraphs and codes

2011-03-10

arxiv.org/abs/1103.1934v1

Mathematics

Combinatorics

20 pages

Scientific paper

A family of sets F (and the corresponding family of 0-1 vectors) is called t-cancellative if for all distict t+2 members A_1,... A_t and B,C from F the union of A_1,..., A_t and B differs from the union of A_1, ..., A_t and C. Let c(n,t) be the size of the largest t-cancellative family on n elements, and let c_k(n,t) denote the largest k-uniform family. We significantly improve the previous upper bounds, e.g., we show c(n,2)< 2^0.322n (for n> n_0). Using an algebraic construction we show that the order of magnitude of c_{2k}(n,2) is n^k for each k (when n goes to infinity).

Affiliated with

Also associated with

No associations

Rating

2-cancellative hypergraphs and codes 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 2-cancellative hypergraphs and codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and 2-cancellative hypergraphs and codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-630449