首页/论文/1508.03033

arXiv 1508.030332015-08-12math.GR

亏格为2的群的快速同构判定

A fast isomorphism test for groups of genus 2

Peter A. Brooksbank, Joshua Maglione, James B. Wilson

备注：: 39 pages, 5 figures
发表信息：: J. Algebra, 2017 (473) 545--590
DOI：: 10.1016/j.jalgebra.2016.12.007

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

摘要英文摘要相关论文

摘要：

出于对有限群的有效同构检验的需要，我们提出了一种多项式时间的方法来确定一类群内的同构，该方法非常适合于研究一般有限群的局部性质。我们还报告的计算机代数系统{ \sc岩浆}中的算法的实现的性能。

英文摘要：

Motivated by the need for efficient isomorphism tests for finite groups, we present a polynomial-time method for deciding isomorphism within a class of groups that is well-suited to studying local properties of general finite groups. We also report on the performance of an implementation of the algorithm in the computer algebra system {\sc magma}.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

摘要英文摘要相关论文

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

继续探索

相关论文

The nilpotent genus of finitely generated residually nilpotent groups

If $G$ and $H$ are finitely generated residually nilpotent groups, then $G$ and $H$ are in the same nilpotent genus if they have the same lower central quotients (up to isomorphism). A stronger condition is that $H$ is para-$G$ if there exists a monomorphism of $G$ into $H$ which induces isomorphisms between the corresponding quotients of their lower central series. We first consider residually nilpotent groups and find sufficient conditions on the monomorphism so that $H$ is para-$G.$ We then prove that for certain polycyclic groups, if $H$ is para-$G$, then $G$ and $H$ have the same Hirsch l…

2022-03-04math.GR

群的强profinite亏格可以是无限的

The strong profinite genus of a finitely presented group can be infinite

我们构造了第一个例子的有限表示，剩余有限群，其中包含一个无穷序列的非同构有限表示的子群，使每个包含映射诱导同构的profinite完成。

2015-01-07math.GR

Profinite genus of fundamental groups of compact flat manifolds with holonomy group of prime order

In this article we calculate the profinite genus of the fundamental group of a $n$-dimensional compact flat manifold $X$ with holonomy group of prime order. As consequence, we prove that if $n\leq 21$, then $X$ is determined among all $n$-dimensional compact flat manifolds by the profinite completion of its fundamental group. Furthermore, we characterize the isomorphism class of profinite completion of the fundamental group of $X$ in terms of the representation genus of its holonomy group.

2020-06-21math.GR

HNN扩张的有限关联子群的概型

Profinite genus of HNN-extensions with finite associated subgroups

Federal University of Viçosa（维索萨联邦大学）；ICT, Federal University of the Jequitinhonha and Mucuri Valleys（Jequitinhonha和Mucuri山谷联邦大学ICT学院）；Department of Mathematics, University of Brasilia（巴西利亚大学数学系）

本文研究了关联子群为有限群的HNN扩张的概型，给出了其同构类数量的公式并探讨了概型确定性的条件。

2026-01-15math.GR

有限非阿贝尔群交换图的亏格

On the genus of the commuting graphs of finite non-abelian groups

非阿贝尔群的交换图是一个单图，其中顶点是群的非中心元素，两个不同的顶点相邻当且仅当它们交换。本文对交换图为无圈、平面或环面的有限非阿贝尔群进行了分类（直到同构）。我们还得到了某些著名的有限非阿贝尔群的交换图的亏格的显式公式，并证明了交换图具有相同亏格的有限非阿贝尔群的所有集合都是有限的.

2013-11-25math.GR

How many quasiplatonic curves?

We show that the number of isomorphism classes of quasiplatonic Riemann surfaces of genus $\,\le g\,$ has a growth of type $\,g^{\log g}\,$. The number of non--isomorphic regular dessins of genus $\,\le g\,$ has the same growth type.

2019-12-03math.GR

更多相关论文收起更多论文

Incorporating Weisfeiler-Leman into algorithms for group isomorphism

In this paper we combine many of the standard and more recent algebraic techniques for testing isomorphism of finite groups (GpI) with combinatorial techniques that have typically been applied to Graph Isomorphism. In particular, we show how to combine several state-of-the-art GpI algorithms for specific group classes into an algorithm for general GpI, namely: composition series isomorphism (Rosenbaum-Wagner, Theoret. Comp. Sci., 2015; Luks, 2015), recursively-refineable filters (Wilson, J. Group Theory, 2013), and low-genus GpI (Brooksbank-Maglione-Wilson, J. Algebra, 2017). Recursively-refin…

2019-05-06cs.CCmath.GR

具有有限融合的自由积的投射有限亏格

Profinite genus of free products with finite amalgamation

本文研究有限融合自由积的投射有限亏格，针对两个投射有限OE群与有限融合的情形，给出了自由积及其投射有限完备化的同构类数目的精确公式，并计算亏格及简化条件。

2023-05-25math.GR

Finite Symmetries of surfaces of $p$-groups of co-class 1

The genus spectrum of a finite group $G$ is a set of integers $g \geq 2$ such that $G$ acts on a closed orientable compact surface $Σ_g$ of genus $g$ preserving the orientation. In this paper we complete the study of spectrum sets of finite $p$-groups of co-class $1$, where $p$ is an odd prime. As a consequence we prove that given an order $p^n$ and exponent $p^e$, there are at the most eight genus spectrum despite the infinite growth of their isomorphism types along $(n,e)$. Based on these results we also classify these groups which has unique stable upper genus $σ_e(p^e) - p^e$, where $σ_e(p…

2020-02-22math.GR

单洞亏格曲面的Torelli复形的自同构

Automorphisms of the Torelli complex for the one-holed genus two surface

设S是亏格为2的连通紧致可定向曲面，且仅有一个边界分支.研究了S的Torelli复形的自同构，并描述了S的Torelli群的有限指数子群之间的同构。更一般地，我们研究了从S的Torelli复形到自身的超内射映射，并证明了S的Torelli群的任何有限指数子群是co-Hopfian的。

2013-04-14math.GRmath.GT

关于群与色同构问题

On the Group and Color Isomorphism Problems

本文证明了群的复杂性与色同构问题之间的关系。色同构问题的难度与所涉及的置换群的组成因子密切相关。以前的工作主要关注的是将颜色同构应用于有界度图同构，因此集中在交替的连通因子，因为这些是图同构的情况下的瓶颈。我们考虑的颜色同构问题的组成因素限制到那些以外的交替组，表明组同构减少在n^（O（log log n））时间到这个问题，相反，这种颜色同构问题的一个特殊情况减少到轻微的推广组同构。然后，我们锐化我们的结果，通过确定的投影特殊线性群的主要障碍，快速算法组同构，并证明上述reduction从组同构到颜色同构实际上只产生循环和投影特殊线性因子。我们的研究结果表明，就像交替群是30年来图同构快速算法的障碍一样，特殊线性群也是群同构快速算法的障碍。

2016-09-27cs.CCcs.DSmath.GR

直角Artin群与映射类群的直角生成子群的广义同构问题

Right-angled Artin groups and a generalized isomorphism problem for finitely generated subgroups of mapping class groups

考虑具有$p$穿孔的属$g$的表面$Σ_{g,p}$的映射类群$\Mod_{g,p}$，以及映射类的有限集合$\{f_1,...,f_k\}$，每个映射类是关于简单闭合曲线的Dehn扭曲或在连通次表面上支持的伪Anosov同胚。本文证明了对所有充分大的$N$，映射类$\{f_1^N,...,f_k^N\}$生成直角Artin群.它们生成的直角Artin群可以从映射类本身的组合拓扑中确定。当$\{f_1,...,f_k\}$是任意的映射类，我们表明，足够大的权力，这些映射类生成一个组嵌入在直角Artin组中的控制方式。我们建立了实和复双曲流形的一些类似结果。我们还讨论了$\Mod_{g,p}$的生成子群的同构问题的不可解性，证明了直角Artin群的同构问题是可解的.因此，我们刻画了$\Mod_{g,p}$的许多自然发生的子群的同构类型。

2012-03-21math.GRmath.GT

映射类群之间的同态

Homomorphisms between mapping class groups

设$X$和$Y$是有限拓扑型曲面，其中$X$有亏格$g\geq 6$，$Y$最多有亏格$2g-1$ ;另外，如果$Y$有亏格$2g-1$，则它不是闭的。我们的主要结果是，每个非平凡同态$\Map(X) \to \Map(Y)$都是由{ \em嵌入}诱导的，即遗忘穿刺、删除边界分量和次表面嵌入的组合.特别地，如果$X$没有边界，则每个非平凡自同态$\Map(X)\to\Map(X)$实际上是同构。作为主要定理的应用，我们得到了在相同的亏格假设下，若$X$和$Y$具有有限解析型，则相应模空间之间的每个非常数全纯映射$\CM(X)\to\CM(Y)$都是遗忘映射.特别地，没有这样的全纯映射，除非$X$和$Y$具有相同的亏格，并且$Y$最多具有与$X$一样多的标记点。

2010-11-08math.AGmath.GRmath.GT

一种针对小度数图的更快同构测试

A Faster Isomorphism Test for Graphs of Small Degree

针对小度数图的同构测试问题，本文提出一种改进算法，其运行时间为$n^{O((\text{log }d)^{c})}$，相比Babai等1983年提出的$n^{O(d/ \text{log }d)}$时间算法效率更高。

2019-11-30cs.DMcs.DSmath.CO