排序方式: 共有1条查询结果,搜索用时 0 毫秒
1
1.
Béla Bajnok 《Designs, Codes and Cryptography》2000,21(1-3):11-18
We extend the concepts of sum-freesets and Sidon-sets of combinatorial number theory with the aimto provide explicit constructions for spherical designs. We calla subset S of the (additive) abelian group G
t-free if for all non-negative integers kand l with k+l t, the sum of k(not necessarily distinct) elements of S does notequal the sum of l (not necessarily distinct) elementsof S unless k=l and the two sums containthe same terms. Here we shall give asymptotic bounds for thesize of a largest t-free set in Z
n,and for t 3 discuss how t-freesets in Z
n can be used to constructspherical t-designs. 相似文献
1