Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2510.00070

Help | Advanced Search

Mathematics > Group Theory

arXiv:2510.00070 (math)
[Submitted on 29 Sep 2025 ]

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

Title: 关于非交换阶数为$pq$的群上最大长度的最小乘积一序列

Authors:Danilo Vilela Avelar, Fabio Enrique Brochero Martínez, Sávio Ribas
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.
Abstract: 设 $G$ 是一个有限群。 在 $G$ 上的一个序列是 $G$ 元素的有限多重集合,如果其项可以排列使得它们的乘积是 $G$ 的单位元,则称为乘积为一的序列。 大戴维斯常数 $\D(G)$ 是一个极小乘积为一序列的最大长度,即不能被分割成两个非平凡乘积为一子序列的乘积为一序列。 设$p,q$为奇素数,且$p \mid q-1$,并让$C_q \rtimes C_p$表示阶为$pq$的非交换群。 已知 $\D(C_q \rtimes C_p) = 2q$。 在本文中,我们描述了在$C_q \rtimes C_p$上长度为$2q$的所有最小乘积为一的序列。 作为应用,我们进一步研究这些群上乘积为一序列的独异点的$k$-阶弹性(以及,从而,包含$k$的集合的并集)的弹性。
Subjects: Group Theory (math.GR) ; Combinatorics (math.CO)
Cite as: arXiv:2510.00070 [math.GR]
  (or arXiv:2510.00070v1 [math.GR] for this version)
  https://doi.org/10.48550/arXiv.2510.00070
arXiv-issued DOI via DataCite

Submission history

From: Sávio Ribas [view email]
[v1] Mon, 29 Sep 2025 19:17:16 UTC (21 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
math
< prev   |   next >
new | recent | 2025-10
Change to browse by:
math.CO
math.GR

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号