{"title":"On the Inverse Problem of the k-th Davenport Constants for Groups of Rank 2","authors":"Qinghai Zhong","doi":"10.1007/s00493-025-00153-3","DOIUrl":null,"url":null,"abstract":"<p>For a finite abelian group <i>G</i> and a positive integer <i>k</i>, let <span>\\(\\textsf{D}_k(G)\\)</span> denote the smallest integer <span>\\(\\ell \\)</span> such that each sequence over <i>G</i> of length at least <span>\\(\\ell \\)</span> has <i>k</i> disjoint nontrivial zero-sum subsequences. It is known that <span>\\(\\mathsf D_k(G)=n_1+kn_2-1\\)</span> if <span>\\(G\\cong C_{n_1}\\oplus C_{n_2}\\)</span> is a rank 2 group, where <span>\\(1<n_1\\, | \\,n_2\\)</span>. We investigate the associated inverse problem for rank 2 groups, that is, characterizing the structure of zero-sum sequences of length <span>\\(\\mathsf D_k(G)\\)</span> that can not be partitioned into <span>\\(k+1\\)</span> nontrivial zero-sum subsequences.</p>","PeriodicalId":50666,"journal":{"name":"Combinatorica","volume":"45 1","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2025-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Combinatorica","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00493-025-00153-3","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
For a finite abelian group G and a positive integer k, let \(\textsf{D}_k(G)\) denote the smallest integer \(\ell \) such that each sequence over G of length at least \(\ell \) has k disjoint nontrivial zero-sum subsequences. It is known that \(\mathsf D_k(G)=n_1+kn_2-1\) if \(G\cong C_{n_1}\oplus C_{n_2}\) is a rank 2 group, where \(1<n_1\, | \,n_2\). We investigate the associated inverse problem for rank 2 groups, that is, characterizing the structure of zero-sum sequences of length \(\mathsf D_k(G)\) that can not be partitioned into \(k+1\) nontrivial zero-sum subsequences.
期刊介绍:
COMBINATORICA publishes research papers in English in a variety of areas of combinatorics and the theory of computing, with particular emphasis on general techniques and unifying principles. Typical but not exclusive topics covered by COMBINATORICA are
- Combinatorial structures (graphs, hypergraphs, matroids, designs, permutation groups).
- Combinatorial optimization.
- Combinatorial aspects of geometry and number theory.
- Algorithms in combinatorics and related fields.
- Computational complexity theory.
- Randomization and explicit construction in combinatorics and algorithms.