Python Implementation and Construction of Finite Abelian Groups

Paul Bradley; John Smethurst

Home/Archive/arXiv

arXiv · 1711.05814

Python Implementation and Construction of Finite Abelian Groups

Paul Bradley·John Smethurst

View original source ↗Read source document ↗Export metadata ↓

Abstract

Here we present a working framework to establish finite abelian groups in python. The primary aim is to allow new A-level students to work with examples of finite abelian groups using open source software. We include the code used in the implementation of the framework. We also prove some useful results regarding finite abelian groups which are used to establish the functions and help show how number theoretic results can blend with computational power when studying algebra. The groups established are based modular multiplication and addition. We include direct products of cyclic groups meaning the user has access to all finite abelian groups.

Explore related subjects

math.GR cs.MS

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Paul Bradley, John Smethurst. 2017-11-15. Python Implementation and Construction of Finite Abelian Groups. https://arxiv.org/abs/1711.05814

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR↗

arXiv2026

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR↗

arXiv2026

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR↗