Abstract
We extend the concepts of sum-free sets and Sidon-sets of combinatorial number theory with the aim to provide explicit constructions for spherical designs. We call a subset of the (additive) abelian group {\it -free} if for all non-negative integers and with , the sum of (not necessarily distinct) elements of does not equal the sum of (not necessarily distinct) elements of unless and the two sums contain the same terms. Here we shall give asymptotic bounds for the size of a largest -free set in , and for discuss how -free sets in can be used to construct spherical -designs.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.