Inductive Methods and zero-sum free sequences
Gautami Bhowmik (LPP), Immanuel Halupczok (DMA), Jan-Christoph, Schlage-Puchta
TL;DR
This paper presents a decidability result concerning the Davenport constant, a key concept in additive combinatorics, highlighting new theoretical insights into zero-sum free sequences.
Contribution
The paper introduces a novel decidability result for the Davenport constant, advancing understanding of zero-sum free sequences in additive number theory.
Findings
Decidability of the Davenport constant established
Theoretical framework for zero-sum free sequences developed
Implications for additive combinatorics discussed
Abstract
We obtain a decidability result for the Davenport constant.
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.