Table of Contents
Fetching ...

On minimal product-one sequences of maximal length over the non-abelian group of order $pq$

Danilo Vilela Avelar, Fabio Enrique Brochero Martínez, Sávio Ribas

TL;DR

The paper addresses the inverse problem for the large Davenport constant over the nonabelian group $\mathcal{G}=C_q\rtimes C_p$ with odd primes and $p\mid q-1$, providing a complete characterization of minimal product-one sequences of maximal length $|S|=2q$ and the explicit atom $S = y^{[q-1]} x y^{[q-1]} x^{p-1} y^{s^{p-1}+1}$. The approach adapts Grynkiewicz’s framework for nonabelian groups, leveraging product-set inequalities and a robust set of lemmas to constrain the structure of atoms and deduce the exact form. As applications, the authors determine the $k$-th elasticity and the unions of sets of lengths for the product-one monoid ${\mathcal B}(\mathcal{G})$, illustrating how nonabelian zero-sum phenomena govern factorization invariants. These results deepen the connection between zero-sum theory in nonabelian groups and factorization theory in Krull-type monoids, providing precise arithmetic information for the group of order $pq$.

Abstract

Let $G$ be a finite group. A sequence over $G$ is a finite multiset of elements of $G$, and it is called product-one if its terms can be ordered so that their product is the identity of $G$. The large Davenport constant $\D(G)$ is the maximal length of a minimal product-one sequence, that is, a product-one sequence that cannot be partitioned into two nontrivial product-one subsequences. Let $p,q$ be odd prime numbers with $p \mid q-1$ and let $C_q \rtimes C_p$ denote the non-abelian group of order $pq$. It is known that $\D(C_q \rtimes C_p) = 2q$. In this paper, we describe all minimal product-one sequences of length $2q$ over $C_q \rtimes C_p$. As an application, we further investigate the $k$-th elasticity (and, consequently, the union of sets containing $k$) of the monoid of product-one sequences over these groups.

On minimal product-one sequences of maximal length over the non-abelian group of order $pq$

TL;DR

The paper addresses the inverse problem for the large Davenport constant over the nonabelian group with odd primes and , providing a complete characterization of minimal product-one sequences of maximal length and the explicit atom . The approach adapts Grynkiewicz’s framework for nonabelian groups, leveraging product-set inequalities and a robust set of lemmas to constrain the structure of atoms and deduce the exact form. As applications, the authors determine the -th elasticity and the unions of sets of lengths for the product-one monoid , illustrating how nonabelian zero-sum phenomena govern factorization invariants. These results deepen the connection between zero-sum theory in nonabelian groups and factorization theory in Krull-type monoids, providing precise arithmetic information for the group of order .

Abstract

Let be a finite group. A sequence over is a finite multiset of elements of , and it is called product-one if its terms can be ordered so that their product is the identity of . The large Davenport constant is the maximal length of a minimal product-one sequence, that is, a product-one sequence that cannot be partitioned into two nontrivial product-one subsequences. Let be odd prime numbers with and let denote the non-abelian group of order . It is known that . In this paper, we describe all minimal product-one sequences of length over . As an application, we further investigate the -th elasticity (and, consequently, the union of sets containing ) of the monoid of product-one sequences over these groups.

Paper Structure

This paper contains 8 sections, 21 theorems, 78 equations.

Key Result

Theorem 1.1

Let $S$ be a minimal product-one sequence over $C_q \rtimes C_p$ of length $|S| = {\sf D}(C_q \rtimes C_p) = 2q$. Then there exist $x,y \in C_q \rtimes C_p$ for which $C_q \rtimes C_p = \langle x,y \colon x^p = y^q = 1, yx = xy^s, \mathop{\rm ord}\nolimits_q(s)=p \rangle$ and

Theorems & Definitions (22)

  • Theorem 1.1
  • Lemma 3.1: Cauchy-Davenport Theorem Gr1
  • Lemma 3.2: GeGr
  • Lemma 3.3: GeGr
  • Lemma 3.4: GeGr
  • Lemma 3.5: GeHK, see also GaGeSc
  • Lemma 3.6: Gr
  • Lemma 3.7: Gr
  • Lemma 3.8: Gr
  • Lemma 3.9: Gr
  • ...and 12 more