Inductive Methods and Zero-Sum Free Sequences

DOI10.1515/INTEG.2009.042zbMath1263.11013arXiv0711.1262OpenAlexW2963155099MaRDI QIDQ3654444

Immanuel Halupczok, Gautami Bhowmik, Jan-Christoph Schlage-Puchta

Publication date: 6 January 2010

Published in: Integers (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0711.1262

zbMATH Keywords

decidabilityDavenport constantzero-sum sequencesinductive method

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Other combinatorial number theory (11B75) Finite abelian groups (20K01) Sequences (mod (m)) (11B50)

Related Items (3)

Structure of a sequence with prescribed zero-sum subsequences: rank two \(p\)-groups ⋮ On the Davenport constant and on the structure of extremal zero-sum free sequences ⋮ Remarks on a generalization of the Davenport constant

This page was built for publication: Inductive Methods and Zero-Sum Free Sequences