Periodic bifurcations in descendant trees of finite (p)-groups

TL;DR

This paper combines theoretical analysis and computational methods to uncover a new pattern of periodic bifurcations in the descendant trees of finite (p)-groups, revealing structural regularities.

Contribution

It introduces the first computational evidence of periodic bifurcations in descendant trees of finite (p)-groups, expanding understanding of their structural properties.

Findings

Identification of new periodic bifurcation patterns

Use of (p)-group generation algorithm for evidence

Structural insights into descendant trees

Abstract

Theoretical background and an implementation of the (p)-group generation algorithm by Newman and O'Brien are used to provide computational evidence of a new type of periodically repeating patterns in pruned descendant trees of finite (p)-groups.