Papers
Topics
Authors
Recent
2000 character limit reached

The spanning number and the independence number of a subset of an abelian group (2406.04011v1)

Published 6 Jun 2024 in math.NT, math.CO, and math.GR

Abstract: Let $A={a_1,a_2,\dots, a_m}$ be a subset of a finite abelian group $G$. We call $A$ {\it $t$-independent} in $G$, if whenever $$\lambda_1a_1+\lambda_2a_2+\cdots +\lambda_m a_m=0$$ for some integers $\lambda_1, \lambda_2, \dots , \lambda_m$ with $$|\lambda_1|+|\lambda_2|+\cdots +|\lambda_m| \leq t,$$ we have $\lambda_1=\lambda_2= \cdots = \lambda_m=0$, and we say that $A$ is {\it $s$-spanning} in $G$, if every element $g$ of $G$ can be written as $$g=\lambda_1a_1+\lambda_2a_2+\cdots +\lambda_m a_m$$ for some integers $\lambda_1, \lambda_2, \dots , \lambda_m$ with $$|\lambda_1|+|\lambda_2|+\cdots +|\lambda_m| \leq 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.

Citations (17)

Summary

We haven't generated a summary for this paper yet.

Slide Deck Streamline Icon: https://streamlinehq.com

Whiteboard

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets

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