Submitted:
11 October 2026
Posted:
13 October 2026
You are already at the latest version
Abstract
Let X be an n-dimensional idempotent evolution algebra over a field k, and let ρX: Aut(X) → Sn be the natural permutation representation determined by a natural basis. Costoya, Mayorga, and Viruel proved that, for n ≥ 3, 2-transitivity of the image of ρX implies that ρX is faithful, whereas, for n ≥ 5, 4-transitivity forces the image to be the full symmetric group. We classify the proper 3-transitive case left open by these results.If ρX(Aut(X)) ≤ Sn is 3-transitive, ρX(Aut(X)) ≠ Sn, and n ≥ 5, then n = q + 1 for a prime power q = pm ≡ 1 (mod 3), the field k contains a nontrivial cube root of unity, and char(k) ≠ p. Moreover, after a monomial change of natural basis, the structure matrix of X is a cubic-character matrix Cθ = (cxy)x,y∈P1(Fq), cxx = 0, cxy = θ(det(vx,vy)) for x ≠ y, where vx = (x,1)T for x ∈ Fq, v∞ = (1,0)T, and θ: Fq× → k× is a nontrivial character of order 3. The key rigidity comes from a compatibility relation derived from the evolution-algebra automorphism equation. Its exponent 2 reflects the squaring of a natural basis element: if χ is the character induced by the monomial lifts on a point stabilizer and s interchanges two points, then χ(s-1ks) = χ(k)2 for k in their common stabilizer. In the projective action this combines with inversion to force χ3 = 1.Conversely, every such cubic-character matrix defines an idempotent evolution algebra precisely when char k≠ p; indeed CθCθ-1 = qI. If Xθ denotes the resulting algebra, then Aut(Xθ) ≅ PGL2(q) ⋊ Gal(Fq/Fp)θ, where the subscript denotes the subgroup of field automorphisms fixing θ. Finally, for every nontrivial character η: Fq× → k× of order 3, \( X_\theta\cong X_\eta
\quad\Longleftrightarrow\quad \theta \) and η lie in the same Frobenius orbit. Thus the 4-transitivity threshold of Costoya–Mayorga–Viruel cannot be lowered to 3 in general. For q = 4, the construction yields the unique five-dimensional isomorphism class with automorphism group A5, and dimension 5 is minimal.
Keywords:
evolution algebra
; automorphism group
; triply transitive group
; projective linear group
; multiplicative character
MSC: Primary 17D92; Secondary 20B20; 05B20
1. Introduction
An evolution algebra over a field is a commutative, generally nonassociative algebra admitting a basis
such that whenever . Writing
defines the structure matrix . The algebra is called idempotent (also perfect or regular in parts of the literature) when ; in finite dimension this is equivalent to the invertibility of ([7] Proposition 4.2). We write
For an idempotent evolution algebra, natural bases are rigid up to a permutation and nonzero coordinate rescalings ([4] Theorem 2.4). Hence every automorphism has the form
and one obtains a natural permutation representation
well defined up to conjugacy in . Compatibility with multiplication is equivalent to
This identity is the source of the additional rigidity used below.
The automorphism groups of idempotent evolution algebras were studied earlier by Elduque–Labra and by Sriwongsa–Zou. In particular, Sriwongsa and Zou classified the n-dimensional idempotent evolution algebras whose full automorphism group is isomorphic to ([14] Theorem 3.2). Costoya, Mayorga, and Viruel subsequently studied the natural permutation representation [4]. Their Theorem A shows that, for , 2-transitivity of already implies that is faithful, whereas, for , 4-transitivity forces
What remains is the proper 3-transitive case. We classify it here.
The first step is to isolate the extra constraint coming from the evolution-algebra product. Once the permutation image is proper and 2-transitive, the results of [4] force zero diagonal and nonzero off-diagonal structure constants. They also imply uniqueness of the scalar lift of each realized permutation. If G is a 2-transitive subgroup of the image, this gives scalar functions satisfying
For any point , the assignment
defines a linear character of the point stabilizer. Stabilizer characters are classical in the theory of monomial covers; Goldberger and Dula develop this viewpoint systematically in cohomological language [10]. A related conjugation test appears in the theory of doubly transitive lines: for the projective action, Iverson and Mixon compare a point-stabilizer character with its transform under inversion ([11] proof of Theorem 6.4). The additional constraint in the present setting is the exponent 2 imposed by the square in (1); both the stabilizer-character formalism and the use of inversion have precedents.
We call (2) the quadratic compatibility relation. This leads to a useful obstruction. If a 2-transitive subgroup has point stabilizer with no nontrivial -valued character, a diagonal rescaling eliminates all scalar factors. Then 2-transitivity forces the structure matrix to be a scalar multiple of , where and denote the all-ones and identity matrices. Consequently the full symmetric group acts. Combining this obstruction with the classification of finite 3-transitive groups reduces the proper case to the projective family with socle .
In the projective case, the relation becomes decisive. On take , , and . For a two-point stabilizer element we have . Hence (2) gives
and therefore . The character cannot be trivial, so a nontrivial cubic character is forced. In particular, and the ground field must contain a primitive cube root of unity.
After these basis normalizations, the character determines the multiplication. Let be the resulting nontrivial cubic character. For set and , and define
After a diagonal change of natural basis and one global scalar normalization, every algebra in the proper 3-transitive case has structure matrix . Thus the automorphism equation forces the cubic-character form.
The underlying -phase pattern is classical: it is the generalized Paley/projective-space pattern. Its standard complex realization is the phase-three generalized weighing matrix , while is the corresponding -valued realization obtained from an identification , up to the usual choices of projective representatives and diagonal normalization. This finite-geometric family already appears in Berman’s 1970s work; see [2] and the references there. Later treatments include Jungnickel–Tonchev [12] and the cohomological reconstruction of Goldberger–Dula ([10] Theorem 6.1 and Remark 6.2). In their complex 2-transitive census, Egan, Ó Catháin, and Švob list one classical equivalence class for each of the parameter sets and and record the corresponding matrix-theoretic monomial automorphism data ([6] Theorem 3.1 and Table 2). In the complex conference-matrix setting, Et-Taoui proves that the matrices attached to and its Frobenius twists are permutation equivalent [9]. These matrix-theoretic notions of automorphism and equivalence differ from the evolution-algebra condition (1). Accordingly, we do not claim novelty for the underlying phase pattern, its projective monomial symmetry, or the forward Frobenius equivalence. The additional rigidity supplied by (1) forces a cubic character under proper 3-transitivity; at the level of algebra isomorphism, it also forces two such characters to lie in the same Frobenius orbit.
A direct finite-field calculation gives
Hence is invertible over exactly when , where . We then determine the full automorphism group. The group always lifts to algebra automorphisms, and the only additional permutations are the Frobenius automorphisms preserving . Thus
Finally, using the monomial rigidity of natural bases ([7] Theorem 4.4) and the standard normalizer of in the symmetric group ([5] Sec. 7.7, p. 245), we prove that, for every nontrivial cubic character ,
The main classification is as follows.
Theorem
(Main theorem). Let X be an n-dimensional idempotent evolution algebra over a field , with , and suppose that
is 3-transitive. Then there is a prime power such that
the field contains a nontrivial cube root of unity, and . Moreover, X is isomorphic to a cubic-character algebra with structure matrix (3), for a nontrivial character
Conversely, every such is idempotent and has a proper 3-transitive natural permutation image. More precisely,
and, for every nontrivial cubic character ,
where .
The case is particularly concrete. Since , the construction yields a unique five-dimensional isomorphism class with automorphism group . Moreover, dimension 5 is minimal among all idempotent evolution algebras with automorphism group .
The paper is organized as follows. sec:prelim records the precise evolution-algebra input. sec:characters develops stabilizer characters, quadratic compatibility, and the perfect-stabilizer obstruction. sec:reduction uses the classification of finite 3-transitive groups to reduce to projective type. sec:projective proves cubic forcing and reconstructs the structure matrix. sec:construction proves invertibility, constructs the projective automorphisms, and determines the full automorphism group. sec:isomorphism determines isomorphism classes and treats the minimal case.
2. Preliminaries on Idempotent Evolution Algebras
Throughout, is a field and all algebras are finite-dimensional over .
Definition
Anevolution algebrais a -algebra X admitting a basis such that
Such a basis is called anatural basis. Its structure matrix is defined by
The algebra isidempotentif .
For finite-dimensional evolution algebras, idempotence is equivalent to invertibility of the structure matrix; see ([7] Proposition 4.2). We will also use the rigidity of natural bases.
Theorem
(Elduque–Labra). Let X be an idempotent evolution algebra, and let and be natural bases. Then there are a permutation and scalars such that
This is ([7] Theorem 4.4), restated in ([4] Theorem 2.4). Consequently every automorphism is monomial in a natural basis.
Lemma
(Automorphism equation). Let X be an evolution algebra with natural basis and structure matrix . If
with and , then φ is an automorphism if and only if
Proof.
The permutation in lem:automorphism-equation defines the natural representation
Changing the natural basis conjugates this representation by an element of .
For later use, we collect the consequences of Costoya–Mayorga–Viruel that recur throughout the paper.
Proposition
(Costoya–Mayorga–Viruel). Let X be an n-dimensional idempotent evolution algebra with , and put .
- label=()
- If is 2-transitive, then either all off-diagonal structure constants vanish or all of them are nonzero.
- lbbel=()
- If is transitive, then either all diagonal structure constants vanish or all of them are nonzero.
- lcbel=()
- If is 2-transitive and some diagonal structure constant is nonzero, then .
- ldbel=()
- If is 2-transitive, then is faithful. In the case of nonzero off-diagonal support, the scalars lifting a given realized permutation are uniquely determined.
- lebel=()
- If and is 4-transitive, then .
Proof.
Items (i) and (ii) are Lemma 4.1 of [4]; item (iii) is Theorem 4.6 there. The faithfulness assertion in (iv) is Theorem A(i), while uniqueness of the scalar lift in the nonzero off-diagonal case follows from Lemma 4.3. Item (v) is Theorem A(ii). □
Corollary .
Suppose , is 2-transitive, and . Then, in every natural basis,
Moreover, is faithful and every has a unique scalar lift.
Proof.
If some diagonal coefficient were nonzero, prop:CMV(iii) would give . Hence all diagonal coefficients vanish. If all off-diagonal coefficients also vanished, the structure matrix would be zero, contradicting idempotence. Thus prop:CMV(i) gives nonzero off-diagonal support. The final two assertions follow from prop:CMV(iv). □
3. Stabilizer Characters and Quadratic Compatibility
Let X satisfy the hypotheses of cor:proper-support, and let be a 2-transitive subgroup. Because the scalar lift of each realized permutation is unique, for each there is a uniquely determined automorphism
Lemma
(Scalar cocycle). For and every i,
Fix α. Then
is a group homomorphism.
Proof.
This point-stabilizer character is part of the general monomial-cover formalism; compare ([10] Theorem 3.4). The next relation records the additional constraint imposed by the evolution-algebra square.
Proposition
(Quadratic compatibility). Let be distinct points, choose with , and let . Then
Proof.
Thus
Proposition
(Stabilizer obstruction). Let be 2-transitive, and suppose . Then, for every point α, the induced stabilizer character
from lem:cocycle is nontrivial. Consequently
In particular, a 2-transitive subgroup whose point stabilizer is perfect cannot be contained in a proper natural permutation image.
Proof.
Suppose for contradiction that is trivial.
For each point i, choose with and set
The value is independent of the choice of : if with , then (5) and give .
For , the elements and send to the same point. Hence, again using the trivial stabilizer character,
Replace the natural basis by . Then
for every , so all scalar factors are 1. Therefore the new structure constants satisfy
Since K is 2-transitive and the diagonal is zero by cor:proper-support, there is a scalar such that
Every permutation in preserves this matrix with scalar lift 1, so , a contradiction. □
The zero-diagonal matrix that appears in the proof is the symmetric-group family already present in the classification of Sriwongsa–Zou ([14] Theorem 3.2). Here it arises for a different purpose: as the obstruction produced by a trivial point-stabilizer character inside a 2-transitive subgroup.
4. Reduction to Projective Type
We now assume and that
is 3-transitive. By prop:CMV(v), is not 4-transitive.
We use the standard classification of finite 3-transitive permutation groups; see, for example, Cameron [3], Dixon–Mortimer ([5] Sec. 7.7), and the modern summary in Pantangi [13]. The affine cases are and the exceptional group ; the almost simple cases have socle of alternating, projective, or Mathieu type. Here it is important to distinguish the permutation actions from the abstract group isomorphism types, because of the familiar exceptional isomorphisms and .
Theorem
(Projective reduction). Under the preceding assumptions, there is a prime power such that
and, after conjugating the permutation action in , the group is almost simple with socle in the standard action on .
Proof.
We exclude the nonprojective cases.
In the alternating branch, the socle is in its natural degree-n action. If , then is at least 4-transitive, contrary to prop:CMV(v) and the assumption . In degree 5, the natural action of is permutation-isomorphic to the projective-line action of , so it belongs to the projective branch. The exceptional abstract isomorphism does not identify the natural degree-6 action with the degree-10 projective action; the former remains excluded here by 4-transitivity.
Suppose is affine. If , then . Since , one has , and a point stabilizer is
a nonabelian simple, hence perfect, group. This contradicts prop:stabilizer-obstruction. In the exceptional affine case , the point stabilizer is , again perfect, and the same contradiction applies.
The 4- and 5-transitive Mathieu actions are excluded by prop:CMV(v). The remaining 3-transitive Mathieu actions are the degree-12 action of and the degree-22 actions of and . The ATLAS records the point stabilizer in the degree-12 action of as , and the point stabilizer in the degree-22 action of as ([1] ATLAS representation M11G1-p12B0 and subgroup program M22G1-max1W1); both are perfect. Thus prop:stabilizer-obstruction excludes and . The group contains the normal 3-transitive subgroup , so it is excluded by applying the same obstruction to that subgroup.
The only remaining case in the classification is projective type with socle , acting on points. This socle formulation also covers the exceptional projective-type overgroups occurring in the standard classification; no assertion that the whole group lies in is needed at this stage. □
5. Cubic Characters and Reconstruction
By thm:projective-reduction, after relabeling the natural basis we may identify the index set with
and regard
as acting on in the standard projective way. The group L is 2-transitive for every .
Let . Write U for the translation subgroup. Thus
The multiplier subgroup is
and
where acts as . Let be the stabilizer character from lem:cocycle.
Lemma
One has . Consequently χ is trivial on U and is determined by its restriction to .
Proof.
Choose with . Such an r exists for . If , then
Since multiplication by is a bijection of the additive group , every translation is a commutator. □
Proposition
(Cubic forcing). The character χ is nontrivial and has image of order 3. Consequently
and contains a nontrivial cube root of unity.
Proof.
By prop:stabilizer-obstruction, applied to the 2-transitive subgroup L, the character is nontrivial.
Set and . The projective transformation
belongs to L and interchanges 0 and ∞. For ,
By quadratic compatibility,
Since is a character,
Thus
for every . The character is nontrivial, so its image is the full group of third roots of unity in .
If q is even, , hence . If q is odd, , hence . In either case . □
Lemma
(Extension of the cubic character). There is a unique nontrivial character
whose restriction to equals .
Proof.
If q is even, and there is nothing to prove. Suppose q is odd. Then has index 2. Since is cyclic and the squaring map is an automorphism of the cyclic group , restriction induces a bijection
Thus the extension exists and is unique. □
Extend both and to by setting . Since has odd order, . For put
and define the matrix
In particular,
Let be the evolution algebra over with natural basis
and structure matrix . No idempotence assumption is made at this stage.
Lemma
(Standard projective lift). Let and choose representing g. For every , write
and put
Then
for all . Hence
defines an automorphism of , whether or not is invertible. These automorphisms form a lift of the action of L, so the scalars satisfy the cocycle identity (5). Moreover, the stabilizer character at ∞ is precisely χ.
Proof.
The definition of is independent of the chosen representative A: for odd q the two representatives in differ by , and ; for even q there is no ambiguity. Since ,
Therefore
Since ,
The resulting monomial map is invertible, and the automorphism equation shows that it is an algebra automorphism; no nonsingularity assumption on is needed.
If represent , then represents , up to the central factor when q is odd. The independence just established gives
so these automorphisms form a group lift of L.
Now suppose . We may represent it by
Its affine multiplier is , while . Hence
using the definition of . □
Theorem
(Reconstruction). Let X be as in thm:projective-reduction, and let θ be the cubic character obtained above. Then a diagonal change of natural basis, followed by a uniform rescaling, brings the structure matrix to . Equivalently,
Proof.
Let be the scalar lift of in X, and let be the standard lift from lem:standard-L-lift. Define
Both scalar systems satisfy the cocycle identity, so their quotient also satisfies it. By lem:standard-L-lift, the two stabilizer characters at ∞ agree; hence
For each , choose with and set
As in the proof of prop:stabilizer-obstruction, this is independent of the choice of , and the cocycle identity gives
Replace the natural basis by . In this basis, the scalar lift of every is exactly .
Let be the resulting structure matrix. For , divide the automorphism equation for by the corresponding equation for , using the same scalar lift . This gives
The group L is 2-transitive on , so this quotient is constant, say , on all ordered pairs of distinct points. Both matrices have zero diagonal. Hence
Finally, a uniform rescaling of the natural basis absorbs the scalar a: if , then the structure matrix becomes . □
6. The Cubic-Character Algebras and Their Automorphism Groups
We now fix a prime power , a field containing a nontrivial cube root of unity, and a nontrivial cubic character
As above, extend both and to by setting . Let be the matrix in (8), and let be the evolution algebra over with natural basis and structure matrix .
Proposition
(Character-sum inverse). The calculation below uses the finite-field character-sum identity that appears in Et-Taoui’s conference-matrix construction ([9] Theorem 1). In the present algebraic setting, this gives
Consequently, is invertible over if and only if .
Proof.
Because is a nontrivial character of order 3, its three values occur equally often on ; hence
We compute the entries of the product. First let . On the diagonal,
Because , every summand in the finite sum is 1, giving . The entry is also q.
Now let with . Put and write . Then the finite part of the entry becomes
The terms at vanish. For the remaining terms,
The map bijects onto , so the sum equals
The projective point contributes 1, so the off-diagonal entry is 0.
Finally, if , then
and similarly for the transpose position. This proves (9).
Definition
When , write . By prop:inverse, this is an idempotent evolution algebra.
As noted in the Introduction, the abstract -phase pattern of is the generalized Paley/projective-space pattern. Its standard complex realization is , whereas is the corresponding -valued realization via an identification ; see [2,12] and ([10] Theorem 6.1 and Remark 6.2). The phase pattern itself is therefore classical; what the evolution-algebra square forces in the present setting is the cubic phase.
Proposition
(Projective lift). The natural action of on lifts to algebra automorphisms of . In particular,
Proof.
Let and choose representing it. Write
with , and put
Taking determinants gives
Define
Since ,
Thus (4) holds.
The lift is independent of the scalar representative of A. Indeed, replacing A by multiplies by and every by , so every is multiplied by . For the multiplier , the choice gives the scalar at as
□
Let denote the Frobenius permutation of , fixing ∞, and define
Theorem
(Full automorphism group). For every cubic-character algebra ,
Since the natural representation is faithful,
In particular,
In the second case m is even and .
Proof.
Put
By prop:PGL, H contains and is therefore 3-transitive.
First, we show directly that . Since every off-diagonal entry of is nonzero and H is 2-transitive, the scalar lift of each permutation in H is unique by prop:CMV(iv). Hence the scalar at defines a character
Restrict this character to , where . For with , the explicit lift in prop:PGL gives
The restriction is nontrivial: it is immediate when q is even, while for odd q the subgroup has index 2, which is coprime to the order 3 of . Thus has order 3 for some . If , then with , and has exponent 2. Every character therefore has image of exponent dividing 2, a contradiction.
Thus H is a proper 3-transitive group. Apply thm:projective-reduction to H. Its socle S is a copy of in the projective-line action. Since the degree is , the parameter is again q. Let
be the standard subgroup already supplied by prop:PGL. Since H is almost simple with socle S, the quotient is a subgroup of the solvable outer automorphism group of S ([5] Sec. 7.7). The image of the perfect group L in is therefore trivial. Hence , and equality follows from .
Now is normal in H. The standard normalizer formula for the projective-line action gives
([5] Sec. 7.7, p. 245). Therefore
Since , every element of can be written as with . Because , one has if and only if .
It remains to decide which Frobenius powers lift. Suppose first that is the permutation part of an automorphism . Let . Uniqueness of lifts gives
Because fixes ∞, the automorphism preserves the line and acts on it by a scalar. Conjugation by therefore leaves the stabilizer scalar unchanged, so
For in the two-point stabilizer, the restriction computed above gives
on . If q is odd, the restriction map for cubic characters is injective by lem:extension; hence the equality holds on all of . Thus .
Conversely, if fixes , then from (8)
for all , so itself is a pure-permutation automorphism. This proves the group formula.
Finally, if , then every , so all Frobenius powers fix the two cubic characters. If , the condition forces m even, and exactly when r is even. Since H is 3-transitive, the faithfulness assertion follows from prop:CMV(iv). □
Combining thm:projective-reduction,thm:reconstruction,prop:inverse,thm:full-aut proves the existence and automorphism-group assertions of thm:main.
7. Isomorphism Classes and the Minimal Case
Isomorphisms between idempotent evolution algebras are monomial by ([7] Theorem 4.4); equivalently, the isomorphism classes can be described as orbits of the symmetric group and the diagonal torus on invertible structure matrices [15]. In the complex conference-matrix setting, Et-Taoui proved that Frobenius twists of multiplicative-character matrices are permutation equivalent [9]. That is a matrix-equivalence statement, whereas algebra isomorphisms here must satisfy the monomial change-of-natural-basis law imposed by the evolution product. The theorem below proves that isomorphic algebras in this family have defining characters in the same Frobenius orbit.
Theorem
(Isomorphism classification). Let , let be a field of characteristic different from p that contains a nontrivial cube root of unity, and let
be nontrivial characters. Then
where . Consequently, the family has two -algebra isomorphism classes when , and one when .
Proof.
Suppose is an isomorphism. By ([7] Theorem 4.4), the map is monomial relative to natural bases. Its permutation part therefore conjugates the natural permutation image of to that of . By thm:full-aut, both groups are almost simple with socle the standard subgroup
The socle is characteristic, hence
The standard normalizer formula
therefore gives for some and some Frobenius power ; see ([5] Sec. 7.7, p. 245). Composing with an automorphism of having permutation part , we may assume .
Let and denote the point-stabilizer characters of and , respectively, defined as in the proof of thm:full-aut. For , conjugating the unique lift of h by shows that the stabilizer scalars satisfy
On the multiplier subgroup, the computation in prop:PGL gives
Hence the preceding equality reads
for , and hence for all by lem:extension. Equivalently,
for , so and lie in the same Frobenius orbit.
Conversely, suppose . Choose r with . Then for every , and the pure permutation satisfies
Hence it defines an algebra isomorphism .
There are exactly two nontrivial cubic characters, and . If , Frobenius fixes both, giving two orbits. If , Frobenius interchanges them, giving one orbit. □
Together with thm:projective-reduction,thm:reconstruction,prop:inverse,thm:full-aut, this completes the proof of thm:main.
Corollary
(Sharpness of the 4-transitivity threshold). There are infinitely many idempotent evolution algebras whose natural permutation image is proper and 3-transitive. Hence the 4-transitivity hypothesis in ([4] Theorem A(ii)) cannot, in general, be replaced by 3-transitivity.
Proof.
Over any field that contains a primitive cube root of unity and has characteristic different from 2, take for . Then , so the algebras exist by prop:inverse; their natural permutation images contain the sharply 3-transitive group and are proper by thm:full-aut. □
Corollary
(The five-dimensional algebra). There exists a five-dimensional idempotent evolution algebra X over with
if and only if
When these conditions hold, there is exactly one such five-dimensional algebra up to -algebra isomorphism. Moreover, dimension 5 is minimal among all idempotent evolution algebras with automorphism group .
Proof.
For existence, take . Then
The Frobenius automorphism of interchanges the two nontrivial cubic characters, so no nontrivial Frobenius power fixes a chosen . Hence thm:full-aut gives
By thm:isomorphism, the two cubic characters lie in a single Frobenius orbit, so the five-dimensional algebra is unique up to isomorphism.
Conversely, suppose X is five-dimensional and . The kernel of is abelian; this follows, for example, from the diagonal-kernel exact sequence in ([8] Theorem 3.2) (see also [4]). Since is nonabelian simple, the kernel is trivial. Thus embeds into and its image is the standard alternating subgroup, which is 3-transitive. Applying thm:main gives , , and the existence of a nontrivial cube root of unity in .
The same kernel argument works in every dimension: if for an idempotent evolution algebra Y of dimension d, then embeds in . Since , one must have . □
To make the five-dimensional case explicit, choose with . With a suitable ordering of , a representative of the unique isomorphism class in cor:A5 has the structure matrix
A direct calculation gives
consistent with prop:inverse and the condition .
Remark
The underlying -phase pattern is classical. It is the phase-three generalized Paley/projective-space pattern. Its standard complex realization is , while is the corresponding -valued realization via an identification , up to the standard projective and diagonal normalizations. The finite-geometric family already appears in Berman’s 1970s work; see [2] and the references there. Later formulations are given by Jungnickel–Tonchev and Goldberger–Dula [10,12]; Goldberger–Dula also recover projective monomial lifts. In their complex 2-transitive census, Egan, Ó Catháin, and Švob list one classical equivalence class for each of the parameter sets and , with underlying permutation groups and , respectively ([6] Theorem 3.1 and Table 2). Frobenius twists were already known to give matrix equivalences in the complex conference setting [9]. Stabilizer characters and their conjugation constraints likewise have precedents in monomial-cover and doubly transitive line theories ([10] Theorem 3.4) ([11] proof of Theorem 6.4).
The cited matrix results concern matrix-theoretic monomial automorphisms or equivalences and do not involve the evolution-algebra automorphism relation (4), in which the source scalar appears quadratically. Accordingly, we do not claim novelty for the underlying phase pattern, its character-sum orthogonality, its projective monomial symmetry, the stabilizer-character framework, the corresponding small complex matrix classes, or the forward Frobenius equivalence. The additional ingredient in the present evolution-algebra setting is the exponent-2 compatibility forced by (4). It yields (6), forces a cubic character from proper 3-transitivity, reconstructs the evolution-algebra multiplication, determines the full evolution-algebra automorphism group, and shows that the defining characters of isomorphic algebras lie in the same Frobenius orbit.
References
- Abbott, R.; Bray, J.; Linton, S.; Nickerson, S.; Norton, S.; Parker, R.; Suleiman, I.; Tripp, J.; Walsh, P.; Wilson, R. ATLAS of Finite Group Representations, Version 3 . 2024. Available online: https://brauer.maths.qmul.ac.uk/Atlas/v3/.
- Berman, G. Families of generalized weighing matrices. Canad. J. Math. 1978, 30(no. 5), 1016–1028. [Google Scholar] [CrossRef]
- Cameron, P. J. Permutation Groups . In London Mathematical Society Student Texts; Cambridge University Press: Cambridge, 1999; vol. 45. [Google Scholar]
- Costoya, C.; Mayorga, P.; Viruel, A. Permutation representations and automorphisms of evolution algebras. Mediterr. J. Math. 2025, 22, 149. [Google Scholar] [CrossRef]
- Dixon, J. D.; Mortimer, B. Permutation Groups . In Graduate Texts in Mathematics; Springer: New York, 1996; vol. 163. [Google Scholar]
- Egan, R.; Ó Catháin, P.; Švob, A. Complex generalised weighing matrices in centraliser algebras of monomial representations. arXiv. 2026. Available online: https://arxiv.org/abs/2607.16069.
- Elduque, A.; Labra, A. Evolution algebras and graphs. J. Algebra Appl. 2015, 14(no. 7), 1550103. [Google Scholar] [CrossRef]
- Elduque, A.; Labra, A. Evolution algebras, automorphisms, and graphs. Linear Multilinear Algebra 2021, 69(no. 2), 331–342. [Google Scholar] [CrossRef]
- Et-Taoui, B. A note on complex conference matrices. Finite Fields Appl. 2023, 91, 102251. [Google Scholar] [CrossRef]
- Goldberger, A.; Dula, G. Cohomology-developed matrices: constructing families of weighing matrices and automorphism actions. J. Algebr. Comb. 2024, 60, 603–665. [Google Scholar] [CrossRef]
- Iverson, J. W.; Mixon, D. G. Doubly transitive lines II: Almost simple symmetries. Algebr. Comb. 2024, 7(no. 1), 37–76. [Google Scholar] [CrossRef]
- Jungnickel, D.; Tonchev, V. D. Perfect codes and balanced generalized weighing matrices. Finite Fields Appl. 1999, 5(no. 3), 294–300. [Google Scholar] [CrossRef]
- Pantangi, V. R. T. All 3-transitive groups satisfy the strict Erdos–Ko–Rado property. Eur. J. Comb. 2025, 124, 104057. [Google Scholar] [CrossRef]
- Sriwongsa, S.; Zou, Y. M. On automorphism groups of idempotent evolution algebras. Linear Algebra Appl. 2022, 641, 143–155. [Google Scholar] [CrossRef]
- Wei, Y.; Zou, Y. M. Isomorphism classes of idempotent evolution algebras. Linear Algebra Appl. 2023, 675, 142–178. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.