Scholarlink

Computational methods have been used extensively to investigate coclass graphs. The well-known p-group generation algorithm [68] can be used to compute finite parts of the coclass graphs (p,1). Here we introduce a variation of this algorithm that allows the determination of finite parts of (p,r) for each coclass r ϵ ℕ.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Constructive methods and visualisations

  • 章节

  • 发表日期：

    2026年

查看全文
  • Heiko Dietrich,
  • Bettina Eick

摘要

Computational methods have been used extensively to investigate coclass graphs. The well-known p-group generation algorithm [68] can be used to compute finite parts of the coclass graphs (p,1). Here we introduce a variation of this algorithm that allows the determination of finite parts of (p,r) for each coclass r ϵ ℕ.