Alec Kriebel

An explicit odd-order p-group with as many automorphisms as elements

Read the paper (PDF, 13 pages) · Source and verification (ZIP) · Zenodo record

Plain-English explanation · Read on this page · Collaboration


Abstract

We construct a finite group G for which p = 1009, |G| = |Aut(G)| = 1009^52359. The group is the Baker–Campbell–Hausdorff group of an explicitly specified rank-31 Lie ring modulo 1009^1689. Its nilpotency class is at most 846 < 1009. An asymmetric lattice forces every automorphism of the finite Lie ring into an integral logarithm–exponential neighborhood. This gives a bijection between the full automorphism set and the kernel of a linear derivation matrix. Exact independently implemented Python and C++ computations establish the Smith valuations of that matrix. The resulting computer-assisted proof answers the existence question affirmatively. The construction and all exact certificates are supplied with separately implemented verification software.

The idea in plain English

An automorphism is a way to relabel every element of a group while preserving its multiplication. The question is whether a nontrivial group whose size is a power of an odd prime can have exactly as many of these symmetries as it has elements.

This paper constructs an example with 1009^52359 elements and the same number of automorphisms. The number is enormous, but the construction has a finite description: an element is a list of 31 numbers taken modulo 1009^1689, with a specified rule for multiplying two lists.

The main difficulty is accounting for every automorphism. The proof uses a deliberately asymmetric lattice to constrain them all, then turns their count into an exact linear-algebra calculation. The paper presents this as an affirmative answer to D. MacHale’s Kourovka Notebook problem 16.63.

The precise result

For p = 1009, the paper constructs a finite nontrivial p-group G with |G| = |Aut(G)| = 1009^52359, where Aut(G) is the full automorphism group.

The group is G = BCH(L/p^1689 L), where L is the explicit rank-31 Lie lattice in Definitions 2.1 and 5.1. Its nilpotency class is at most 846, below p, so the finite Lazard correspondence preserves its order and full automorphism group.

For this fixed Lie lattice and every integer i ≥ 7, the full Lie-ring automorphism group of L/p^i L has order p^(30i + 1689), while L/p^i L has p^(31i) elements. Choosing i = 1689 makes the two counts equal.

The exact derivation matrix has 14,415 rows, 961 columns, rank 931, and nullity 30. Its nonzero p-primary Smith valuations have multiplicities 87, 55, 758, 6, and 25 at valuations 0, 1, 2, 3, and 4; their sum is 1689.

Why the result holds

Begin with the rank-31 Lie-algebra template of Omirov and Ruan. A chosen flag has no nonidentity stabilizer in its full finite-field automorphism group. Weighting the lattice along this flag forces every automorphism of a sufficiently deep finite quotient into a domain where logarithms are integral.

Within that domain, logarithm and exponential preserve the required precision and give a bijection between all automorphisms and solutions of a linear derivation equation. This is the bridge from a nonlinear symmetry problem to an exact matrix count.

The matrix’s nullity contributes 30i to the exponent of the automorphism count, while its Smith valuations contribute 1689. The ring itself has order p^(31i), so the counts meet at i = 1689. The class bound then lets the Lazard correspondence transfer the equality to a finite group.

Scope and limitations

This gives one example at p = 1009. It does not establish an example for every odd prime, and it makes no minimality claim for the prime, group order, or number of generators.

The equality is between orders. The paper does not claim that G and Aut(G) are isomorphic.

The construction is explicit through its Lie bracket and finite Baker–Campbell–Hausdorff rule. It does not enumerate the group’s multiplication table or its automorphisms. Exact computation certifies the matrix data; the full-automorphism reduction and the correspondence with groups also require the written proof.

The Lie-algebra template is due to Omirov and Ruan. This paper supplies its integral normalization, finite-characteristic arguments, asymmetric lattice, and exact count of finite automorphisms.

The Kourovka Notebook lists this manuscript as an AI-proposed solution awaiting confirmation by mathematicians. Its listing should not be read as external validation or journal peer review.

Status and AI use

This is an unrefereed preprint whose construction, proof development, and initial verification software were generated using AI tools; subsequent checks are not external human peer review or proof-assistant formalization.

Read the paper

Open PDF in a full window · Download the original from Zenodo

Collaborate on this result

I welcome substantive collaboration on an independent review of the group-theoretic proof and exact certificates, particularly the reduction to the full automorphism count, or on preparing the work for journal submission.

Authorship and responsibilities would be discussed in relation to the substantive contributions made.

Contact Alec

Cite this paper

Alec Kriebel. (2026). An explicit odd-order p-group with as many automorphisms as elements (Version 1.1.0) [Preprint]. Zenodo. https://doi.org/10.5281/zenodo.22770864

Download BibTeX

Background and prior work