Inductive Methods and Zero-Sum Free Sequences

DOI10.1515/INTEG.2009.042MaRDI QIDQ3654444zbMATH OpenOpenAlexFDO

Authors Gautami Bhowmik, Immanuel Halupczok, 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, http://www.emis.de/journals/INTEGERS/papers/j40/j40.pdf

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Davenport constantdecidabilityinductive methodzero-sum sequences

Mathematics Subject Classification ID

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

Abstract: We obtain a decidability result for the Davenport constant.

Recommendations

• The structure of maximal zero-sum free sequences
• On the structure of zerofree sequences
• On subsequence sums of a zero-sum free sequence
• On sum-free sequences
• Counting zero-free sequences
• Subsequence sums of zero-sum-free sequences
• On the reciprocal sum of sum-free sequences
• Følner sequences and sum-free sets
• Subsequence sums of zero-sum free sequences. II.
• Independent sequences and freeness criteria

Cited in

(4)

• On product-one sequences with congruence conditions over non-abelian groups
• On the Davenport constant and on the structure of extremal zero-sum free sequences
• Structure of a sequence with prescribed zero-sum subsequences: rank two p-groups
• Remarks on a generalization of the Davenport constant

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3654444)