SearcharxivSearch

arXiv · 2308.01858

Introducing $n$-Magic Groups and Characterizing $3$-Magic Finitely Generated Abelian Groups

Abstract

In this paper, we define an $n$-magic square in a group to be an $(n\times n)$ array of group elements whose rows, columns, and diagonals have the same product. This definition is akin to the idea of magic squares in the integers. Groups that have an $n$-magic square are said to be $n$-magic. We begin with some preliminary results and focus much of our attention on $3$-magic groups. Through a series of propositions, we ultimately prove a characterization theorem for $3$-magic finitely generated abelian groups. We then discuss some additional results about non-abelian groups as well as $n$-magic groups where $n>3$.

Explore related subjects

Keep this discovery

BibTeXRIS

Danielle Bowerman, Nicholas Fleece, Matt Insall. 2023-08-03. Introducing $n$-Magic Groups and Characterizing $3$-Magic Finitely Generated Abelian Groups. https://doi.org/10.32037/agta-2025-014

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

KEEP EXPLORING

Related papers

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

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

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