arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2303.01957cs.DScs.DMmath.COmath.GR
收藏

有限群上具有常数查询时间的线性空间数据结构

Linear Space Data Structures for Finite Groups with Constant Query-time

Bireswar Das, Anant Kumar, Shivdutt Sharma, Dhara Thakkar

摘要:

一个$n$阶的有限群可以用它的凯莱表来表示。在字RAM模型中,一组$n$阶的Cayley表可以使用$O(n^2)$字存储,并且可以用于在恒定时间内回答乘法查询。有趣的是,我们是否可以设计一种数据结构来存储一组使用$o(n^2)$空间但仍然可以在常数时间内回答乘法查询的阶$n$。我们设计了一个常数查询时的数据结构,可以存储任何有限组使用$O(n)$字,其中$n$是组的顺序。Farzan和Munro(ISSAC 2006)给出了$Ω(n)$的信息论下限,该下限是关于存储一组顺序为$n$的单词的数量。由于我们的数据结构达到了这个下限,并在恒定的时间内回答查询,它是最佳的空间使用和查询时间。在这个过程中的一个关键步骤是设计线性空间和常数查询时间数据结构的非阿贝尔简单的群体。非布尔单群的数据结构是利用有限单群分类定理(CFSG)证明的引理设计的。

英文摘要:

A finite group of order $n$ can be represented by its Cayley table. In the word-RAM model the Cayley table of a group of order $n$ can be stored using $O(n^2)$ words and can be used to answer a multiplication query in constant time. It is interesting to ask if we can design a data structure to store a group of order $n$ that uses $o(n^2)$ space but can still answer a multiplication query in constant time. We design a constant query-time data structure that can store any finite group using $O(n)$ words where $n$ is the order of the group. Farzan and Munro (ISSAC 2006) gave an information theoretic lower bound of $Ω(n)$ on the number of words to store a group of order $n$. Since our data structure achieves this lower bound and answers queries in constant time, it is optimal in both space usage and query-time. A crucial step in the process is essentially to design linear space and constant query-time data structures for nonabelian simple groups. The data structures for nonableian simple groups are designed using a lemma that we prove using the Classification Theorem for Finite Simple Groups (CFSG).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑