🔢 mathematics

N-ary groups of panmagic permutations from the Post coset theorem

This paper utilizes the Post coset theorem to characterize N-ary groups of affine panmagic permutations as cosets of dihedral subgroups, while revealing deep connections between their cycle decompositions and classical concepts in number theory and combinatorics.

Original authors: Sergiy Koshkin, Jaeho Lee

Published 2026-06-24

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Sergiy Koshkin, Jaeho Lee

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

The Big Picture: Chess Queens and Magic Squares

Imagine a standard chessboard, but instead of being flat, it's wrapped around a donut (a torus). This means if a piece moves off the right edge, it pops back onto the left edge. On this "donut board," the authors are studying a specific puzzle: How do you place $n$ queens on an $n \times n$ board so that no two queens attack each other?

In this donut world, a queen attacks not just in straight lines, but also along "broken" diagonals (lines that wrap around the edges). A solution to this puzzle is called a panmagic permutation. If you draw this solution as a grid of 1s and 0s (where 1 is a queen and 0 is empty), you get a panmagic square. This is a special kind of "magic square" where not only do rows, columns, and main diagonals add up to the same number, but every possible diagonal (even the broken ones that wrap around) adds up to the same number too.

The Discovery: A New Kind of Math Group

The authors noticed something strange and beautiful about these solutions. Usually, in math, we combine things two at a time (binary operations), like $2 + 2 = 4$ . But here, they found that you can take three (or more) of these panmagic solutions, multiply them together in a specific way, and you get another valid panmagic solution.

This is like having a club where the rule is: "If you bring three members together, they must form a new, valid member." The authors call these N-ary groups (where N is the number of items you combine, like 3, 4, 5, etc.).

The "Magic" Formula: Affine Permutations

Not all panmagic solutions are easy to describe. Some are chaotic. However, the authors focused on a specific, orderly type called affine panmagic permutations.

Think of these as solutions generated by a simple, linear formula, like a recipe:
$\text{New Position} = (\text{Slope} \times \text{Old Position}) + \text{Shift}$
It's like a conveyor belt that moves items around the board based on a fixed rule. The authors discovered that all these "recipe-based" solutions fit perfectly into the N-ary group structure.

The Secret Ingredient: The Post Coset Theorem

How did they prove this? They used a powerful mathematical tool called the Post Coset Theorem.

Imagine a large, messy room (the group of all possible solutions). Inside this room, there is a smaller, very organized closet (a subgroup called the Dihedral Group). This closet contains solutions that are just simple rotations and flips of the board (like spinning a pentagon or flipping a card).

The theorem says that if you take a specific "slice" or "coset" of that room—essentially a group of solutions that are all related to the closet by a specific shift—you get a perfect N-ary group.

The authors identified that:

The "Closet" is the group of symmetries of a regular polygon (rotations and flips).
The "Room" is the group of all solutions generated by their linear formulas.
The "Slices" (Cosets) are the new N-ary groups they discovered.

This explains why a specific example from 1994 (involving a 5x5 board and a pentagon shape) worked so well: it was a slice of this mathematical room.

The Rules of the Game (Number Theory Connections)

The paper also acts like a detective, figuring out when these groups exist and what they look like. They found that the existence of these groups depends heavily on the number $n$ (the size of the board):

The "Square-Free" Rule: The board size $n$ cannot be divisible by 2 or 3. It also has to be "square-free" (not divisible by a perfect square like 4, 9, or 25) for the groups to have a very uniform structure.
The "4k+1" Rule: For the most interesting groups (called "ternary" or 3-ary groups), every prime factor of the board size must be of the form $4k + 1$ (like 5, 13, 17). This connects the puzzle to deep number theory facts about which numbers can be written as the sum of two squares.

The Cycle Dance

Finally, the authors looked at the "dance" of the numbers. If you follow a number on the board through the permutation (e.g., where does 1 go? Where does that result go?), it eventually loops back to 1. This is called a cycle.

Panmagic solutions always have exactly one number that stays put (a fixed point) and all other numbers dance in loops of length 3 or longer. They never swap just two numbers back and forth.
The authors proved that if the board size meets certain conditions, every solution in their group will have the exact same dance pattern (cycle type). If the board size is "messy" (has square factors like 25), the dance patterns within the group will be mixed and chaotic.

Summary

In short, this paper takes a complex puzzle about placing queens on a donut-shaped chessboard and reveals that the solutions follow a hidden, elegant algebraic structure. By using a theorem about "cosets" (slices of groups), they showed that these solutions form N-ary groups (where you combine 3, 4, or more items at once). They mapped out exactly which board sizes allow these groups to exist and described the specific patterns (cycles) the numbers make, linking the puzzle to famous concepts in number theory like prime numbers and quadratic residues.

Technical Summary: N-ary Groups of Panmagic Permutations from the Post Coset Theorem

Problem Statement
The paper investigates the algebraic structure of panmagic permutations, defined as permutations whose associated permutation matrices are panmagic squares (matrices where all rows, columns, main diagonals, and "broken" diagonals sum to the same magic constant). These permutations correspond to solutions of the modular $n$ -queens problem on a toroidal chessboard. While the existence of such permutations is well-established for "Polya dimensions" (where $n > 1$ and $2, 3 \nmid n$ ), their group-theoretic properties remain underexplored. Specifically, the authors address the closure properties of these permutations under $N$ -ary multiplication (multiplying $N$ elements at once) rather than the standard binary multiplication. The central problem is to characterize the sets of affine panmagic permutations that form $N$ -ary groups and to determine their structural relationship to classical group theory concepts.

Methodology
The authors employ a structural approach based on the Post coset theorem (1940), a foundational result in the theory of $N$ -ary (polyadic) groups. The methodology proceeds through the following steps:

Restriction to Affine Permutations: The study focuses on affine panmagic permutations, which are permutations of $\mathbb{Z}_n$ expressible by linear formulas $\pi_{a,b}(i) \equiv ai + b \pmod n$ . This restricts the scope to the general affine group $Aff(\mathbb{Z}_n)$ .
Identification of Post Associates and Covers: Using the Post coset theorem, the authors identify that $N$ -ary subgroups arise as cosets of a normal subgroup $H$ (the "Post associate") within a larger group $\tilde{H}$ (the "Post cover"), provided the quotient $\tilde{H}/H$ is cyclic of order $N-1$ .
Construction of Subgroups:
- The Post cover is identified as the group of affine permutations, $Aff(\mathbb{Z}_n)$ .
- The Post associate is identified as extensions of the dihedral group $D_n$ . Specifically, the authors define the multidihedral group $D_n$ (slopes $u$ where $u^2 \equiv 1 \pmod n$ ) and the lifted dihedral group $D^\#_n$ (slopes $u$ where $u^2 \equiv 1 \pmod{\text{rad}(n)}$ ).
Homomorphism Analysis: The authors construct "slope-squaring" homomorphisms from $Aff(\mathbb{Z}_n)$ to groups of quadratic residues. By analyzing the kernels and ranges of these maps, they determine when the quotient groups are cyclic, thereby establishing the existence and arity of the resulting $N$ -ary subgroups.
Cycle Type Analysis: The paper utilizes number-theoretic properties (multiplicative orders, Euler's totient function, and the Chinese Remainder Theorem) to analyze the cycle structures of permutations within these cosets, distinguishing between "monotypic" cosets (where all elements share the same cycle type) and non-monotypic ones.

Key Contributions and Results

Characterization of Affine Panmagic $N$ -ary Groups: The paper proves that affine panmagic $N$ -ary subgroups exist in all Polya dimensions. These groups are explicitly identified as cosets of the lifted dihedral group $D^\#_n$ (or the smaller $D_n$ ) within $Aff(\mathbb{Z}_n)$ .
Strict Arity Determination: The authors provide a method to calculate the strict arity (the smallest $N$ for which a set is closed under $N$ -ary multiplication) for these cosets. The strict arity $N$ is determined by the formula $N = \text{ord}_{\text{rad}(n)}(a^2) + 1$ , where $a$ is the slope of the coset representative.
Number-Theoretic Conditions:
- Ternary Groups ( $N=3$ ): Strictly ternary affine panmagic cosets exist if and only if $-1$ is a quadratic residue modulo $\text{rad}(n)$ . This occurs if and only if all prime factors of $n$ are of the form $4k+1$ . This generalizes Thompson's 1994 observation regarding the $5 \times 5$ case.
- Higher Arity: The paper characterizes dimensions admitting strictly $N$ -ary groups based on the prime factorization of $n$ and the multiplicative orders of squares of units.
Cycle Structure and Monotypism:
- It is shown that affine panmagic permutations always possess exactly one fixed point and no transpositions.
- The authors characterize "monotypic" cosets (where all permutations have identical cycle decompositions). They prove that for the multidihedral group $D_n$ , monotypic panmagic cosets exist if and only if all prime factors of $n$ are of the form $4k+1$ .
- A significant negative result is established for the lifted dihedral group $D^\#_n$ : if $n$ is not square-free, no monotypic panmagic cosets exist for $D^\#_n$ .
Connections to Classical Topics: The results link panmagic permutations to square-free numbers, quadratic residues, Polya counting indices, and linear congruential generators.

Significance and Claims
The paper claims to provide a more explicit description of panmagic $N$ -ary groups than previous work (such as Nordgren's 2012 generalization), particularly by utilizing linear algebra and modular arithmetic formulas rather than abstract existence proofs.

The authors emphasize that treating panmagic squares as permutations unlocks new algebraic insights. Specifically:

They clarify the role of the dihedral group $D_5$ in Thompson's example, showing it is part of a broader family of Post associates.
They demonstrate that the "Post cover" for these structures is the general affine group, and the "Post associate" is an extension of the dihedral group.
The work connects the combinatorial problem of non-attacking queens on a torus to the structural theory of polyadic groups, offering a framework to generate and classify these permutations.

The paper concludes modestly, noting that while affine panmagic permutations are a small fraction of all panmagic permutations (as non-affine ones exist for $n \ge 13$ ), the algebraic structure of the affine subset is now well-understood. The authors suggest that future work could extend these group-theoretic methods to non-affine permutations and explore the linear algebra of the spans of these permutation matrices (panmagic algebras).