The spanning number and the independence number of a subset of an abelian group
Abstract
Let A=\a1,a2,…, am\ be a subset of a finite abelian group G. We call A t-independent in G, if whenever λ1a1+λ2a2+·s +λm am=0 for some integers λ1, λ2, … , λm with |λ1|+|λ2|+·s +|λm| ≤ t, we have λ1=λ2= ·s = λm=0, and we say that A is s-spanning in G, if every element g of G can be written as g=λ1a1+λ2a2+·s +λm am for some integers λ1, λ2, … , λm with |λ1|+|λ2|+·s +|λm| ≤ s. In this paper we give an upper bound for the size of a t-independent set and a lower bound for the size of an s-spanning set in G, and determine some cases when this extremal size occurs. We also discuss an interesting connection to spherical combinatorics.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.