Papers
Topics
Authors
Recent
Search
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 A=a1,a2,…,amA={a_1,a_2,\dots, a_m} be a subset of a finite abelian group GG. We call AA {\it tt-independent} in GG, if whenever λ1a1+λ2a2+⋯+λmam=0\lambda_1a_1+\lambda_2a_2+\cdots +\lambda_m a_m=0 for some integers λ1,λ2,…,λm\lambda_1, \lambda_2, \dots , \lambda_m with ∣λ1∣+∣λ2∣+⋯+∣λm∣≤t,|\lambda_1|+|\lambda_2|+\cdots +|\lambda_m| \leq t, we have λ1=λ2=⋯=λm=0\lambda_1=\lambda_2= \cdots = \lambda_m=0, and we say that AA is {\it ss-spanning} in GG, if every element gg of GG can be written as g=λ1a1+λ2a2+⋯+λmamg=\lambda_1a_1+\lambda_2a_2+\cdots +\lambda_m a_m for some integers λ1,λ2,…,λm\lambda_1, \lambda_2, \dots , \lambda_m with ∣λ1∣+∣λ2∣+⋯+∣λm∣≤s.|\lambda_1|+|\lambda_2|+\cdots +|\lambda_m| \leq s. In this paper we give an upper bound for the size of a tt-independent set and a lower bound for the size of an ss-spanning set in GG, and determine some cases when this extremal size occurs. We also discuss an interesting connection to spherical combinatorics.

Authors (1)
Citations (17)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.