A Variant of Harborth Constant
A. Lemos, B.K. Moriya, A.O. Moura, A.T. Silva

TL;DR
This paper investigates the $k$-Harborth constant in finite abelian groups, determining exact values or bounds for specific groups, which advances understanding of zero-sum subset problems in additive combinatorics.
Contribution
The paper introduces a variant of the Harborth constant and provides exact values or bounds for this constant in certain finite abelian groups.
Findings
Exact values of $g^k(G)$ for some groups
Lower and upper bounds for $g^k(G)$ in others
Enhanced understanding of zero-sum subset problems
Abstract
Let be a finite additive abelian group. For given a positive integer, the -Harborth constant is defined to be the smallest positive integer such that given a set of elements of with size there exists a zero-sum subset of size . We find either the exact value of , or lower and upper bounds for this constant for some groups.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Analytic Number Theory Research · Graph theory and applications
