具有小达文波特常数的有限群分类

Jun Seok Oh
{"title":"具有小达文波特常数的有限群分类","authors":"Jun Seok Oh","doi":"arxiv-2409.00363","DOIUrl":null,"url":null,"abstract":"Let $G$ be a finite group. By a sequence over $G$, we mean a finite unordered\nstring of terms from $G$ with repetition allowed, and we say that it is a\nproduct-one sequence if its terms can be ordered so that their product is the\nidentity element of $G$. Then, the Davenport constant $\\mathsf D (G)$ is the\nmaximal length of a minimal product-one sequence, that is a product-one\nsequence which cannot be partitioned into two non-trivial product-one\nsubsequences. The Davenport constant is a combinatorial group invariant that\nhas been studied fruitfully over several decades in additive combinatorics,\ninvariant theory, and factorization theory, etc. Apart from a few cases of\nfinite groups, the precise value of the Davenport constant is unknown. Even in\nthe abelian case, little is known beyond groups of rank at most two. On the\nother hand, for a fixed positive integer $r$, structural results characterizing\nwhich groups $G$ satisfy $\\mathsf D (G) = r$ are rare. We only know that there\nare finitely many such groups. In this paper, we study the classification of\nfinite groups based on the Davenport constant.","PeriodicalId":501037,"journal":{"name":"arXiv - MATH - Group Theory","volume":"15 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A classification of finite groups with small Davenport constant\",\"authors\":\"Jun Seok Oh\",\"doi\":\"arxiv-2409.00363\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let $G$ be a finite group. By a sequence over $G$, we mean a finite unordered\\nstring of terms from $G$ with repetition allowed, and we say that it is a\\nproduct-one sequence if its terms can be ordered so that their product is the\\nidentity element of $G$. Then, the Davenport constant $\\\\mathsf D (G)$ is the\\nmaximal length of a minimal product-one sequence, that is a product-one\\nsequence which cannot be partitioned into two non-trivial product-one\\nsubsequences. The Davenport constant is a combinatorial group invariant that\\nhas been studied fruitfully over several decades in additive combinatorics,\\ninvariant theory, and factorization theory, etc. Apart from a few cases of\\nfinite groups, the precise value of the Davenport constant is unknown. Even in\\nthe abelian case, little is known beyond groups of rank at most two. On the\\nother hand, for a fixed positive integer $r$, structural results characterizing\\nwhich groups $G$ satisfy $\\\\mathsf D (G) = r$ are rare. We only know that there\\nare finitely many such groups. In this paper, we study the classification of\\nfinite groups based on the Davenport constant.\",\"PeriodicalId\":501037,\"journal\":{\"name\":\"arXiv - MATH - Group Theory\",\"volume\":\"15 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - MATH - Group Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.00363\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Group Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.00363","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

让 $G$ 是一个有限群。我们所说的$G$上的序列是指$G$中允许重复的有限无序项串,如果它的项可以有序排列,使得它们的乘积是$G$的同元素,我们就说它是乘积一序列。那么,达文波特常数 $\mathsf D (G)$ 是最小积一序列的最大长度,即一个积一序列不能被分割成两个非三积一子序列。达文波特常数是一个组合群不变式,几十年来在加法组合学、不变式理论和因式分解理论等方面进行了卓有成效的研究。除了无穷群的少数情况外,达文波特常数的精确值尚属未知。即使是无边群,除了秩最多为 2 的群之外,其他群也鲜为人知。另一方面,对于固定的正整数 $r$,描述哪些群 $G$ 满足 $\mathsf D (G) = r$ 的结构性结果也很罕见。我们只知道有有限多个这样的群。本文研究了基于达文波特常数的无限群分类。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A classification of finite groups with small Davenport constant
Let $G$ be a finite group. By a sequence over $G$, we mean a finite unordered string of terms from $G$ 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 $G$. Then, the Davenport constant $\mathsf D (G)$ is the maximal length of a minimal product-one sequence, that is a product-one sequence which cannot be partitioned 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 $r$, structural results characterizing which groups $G$ satisfy $\mathsf D (G) = r$ 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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信