On minimal product-one sequences of maximal length over Dihedral and Dicyclic groups

DOI10.4134/CKMS.C190013MaRDI QIDQ6312397arXivFDO

Authors Jun-Seok Oh, Qinghai Zhong

Publication date 13 January 2019

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Arithmetic theory of semigroups (20M13) Inverse problems of additive number theory, including sumsets (11P70)

Abstract: Let $G$ be a finite group. By a sequence over $G$, we mean a finite unordered sequence of terms from $G$, where repetition is allowed, and we say that it is a product-one sequence if its terms can be ordered such that their product equals the identity element of $G$. The large Davenport constant $mathsfD(G)$ 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. We provide explicit characterizations of all minimal product-one sequences of length $mathsfD(G)$ over Dihedral and Dicyclic groups. Based on these characterizations we study the unions of sets of lengths of the monoid of product-one sequences over these groups.

This page was built for publication: On minimal product-one sequences of maximal length over Dihedral and Dicyclic groups

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