Let be a finite group. By a sequence over , we mean a finite unordered string of terms from with repetition allowed, and we say that it is a product-one sequence if its terms can be ordered so that their product is the identity element of . Then, the Davenport constant is the maximal length of a minimal product-one sequence, that is a product-one sequence which cannot be factored into two non-trivial product-one subsequences. The Davenport constant is a combinatorial group invariant that has been studied fruitfully over several decades in additive combinatorics, invariant theory, and factorization theory, etc. Apart from a few cases of finite groups, the precise value of the Davenport constant is unknown. Even in the abelian case, little is known beyond groups of rank at most two. On the other hand, for a fixed positive integer , structural results characterizing which groups satisfy are rare. We only know that there are finitely many such groups. In this paper, we study the classification of finite groups based on the Davenport constant.

生成讲解博客的中文版本

生成AI智能校验的中文版本