Abstract
In this paper, we prove that for positive integers k and n, the cardinality of the symmetric differences of {1,2,...,k}, {2,4,...,2k}, ... {n,2n,...kn} is at least k or n, whatever is larger. This has applications to combinatorics and to the study of linear codes.
| Original language | English |
|---|---|
| Pages (from-to) | 787-797 |
| Number of pages | 11 |
| Journal | Proceedings of the American Mathematical Society |
| Volume | 138 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - Mar 2010 |
Fields of science
- 101001 Algebra