2000 character limit reached
The spanning number and the independence number of a subset of an abelian group
Published 6 Jun 2024 in math.NT, math.CO, and math.GR | (2406.04011v1)
Abstract: Let be a subset of a finite abelian group . We call {\it -independent} in , if whenever for some integers with we have , and we say that is {\it -spanning} in , if every element of can be written as for some integers with In this paper we give an upper bound for the size of a -independent set and a lower bound for the size of an -spanning set in , and determine some cases when this extremal size occurs. We also discuss an interesting connection to spherical combinatorics.
Paper Prompts
Sign up for free to create and run prompts on this paper.