arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1912.02269math.QAmath.CT
收藏

低秩模范畴分类的一种计算方法

A Computational Approach to Classifying Low Rank Modular Categories

Daniel Creamer

摘要:

本文介绍了一种计算方法来分类低秩模范畴,直到它们的模数据。模范畴的模数据是一对矩阵$(S,T)$。实际上,类别的所有数值信息都包含在模数据中或从模数据中导出。模块化数据满足Bruillard,Ng,Rowell和Wang称之为可接受性标准的各种标准。值得注意的是,$S$矩阵的伽罗瓦群是忠实地作用于特征值矩阵$s = (\frac{S_{ij}}{S_{0j}})$的列的阿贝尔群。这给出了来自Gal $(\mathbb{Q}(S),\mathbb{Q}) \to $ Sym $_r$的注入,其中$r$是类别的秩。我们的方法首先列出Sym $_6$的所有可能的阿贝尔子群,并为每组建立所有可能的模块数据。我们通过一系列的Gröbner基计算运行每组模数据,直到我们找到矛盾或解决模数据。

英文摘要:

This paper introduces a computational approach to classifying low rank modular categories up to their modular data. The modular data of a modular category is a pair of matrices, $(S,T)$. Virtually all the numerical information of the category is contained within or derived from the modular data. The modular data satisfy a variety of criteria that Bruillard, Ng, Rowell, and Wang call the admissibility criteria. Of note is the Galois group of the $S$ matrix is an abelian group that acts faithfully on the columns of the eigenvalue matrix, $s = (\frac{S_{ij}}{S_{0j}})$. This gives an injection from Gal$(\mathbb{Q}(S),\mathbb{Q}) \to $ Sym$_r$, where $r$ is the rank of the category. Our approach begins by listing all the possible abelian subgroups of Sym$_6$ and building all the possible modular data for each group. We run each set of modular data through a series of Gröbner basis calculations until we either find a contradiction or solve for the modular data.

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

↑