Preprint
Article

This version is not peer-reviewed.

Triply Transitive Natural Permutation Images of Idempotent Evolution Algebras

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: 
;  ;  ;  ;  

1. Introduction

An evolution algebra over a field k is a commutative, generally nonassociative algebra admitting a basis
B = { b 1 , … , b n }
such that b i b j = 0 whenever i ≠ j . Writing
b i 2 = ∑ j = 1 n μ i j b j
defines the structure matrix M B = ( μ i j ) . The algebra is called idempotent (also perfect or regular in parts of the literature) when X 2 = X ; in finite dimension this is equivalent to the invertibility of M B ([7] Proposition 4.2). We write
μ 3 ( k ) = { z ∈ k × : z 3 = 1 } .
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
φ ( b i ) = λ i b σ ( i ) , λ i ∈ k × , σ ∈ S n ,
and one obtains a natural permutation representation
ρ X : Aut ( X ) ⟶ S n ,
well defined up to conjugacy in S n . Compatibility with multiplication is equivalent to
λ j μ i j = λ i 2 μ σ ( i ) σ ( j ) ( 1 ≤ i , j ≤ n ) .
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 S n ([14] Theorem 3.2). Costoya, Mayorga, and Viruel subsequently studied the natural permutation representation ρ X [4]. Their Theorem A shows that, for n ≥ 3 , 2-transitivity of ρ X ( Aut ( X ) ) already implies that ρ X is faithful, whereas, for n ≥ 5 , 4-transitivity forces
ρ X ( Aut ( X ) ) = S n .
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 λ i ( g ) satisfying
λ i ( g h ) = λ i ( h ) λ h ( i ) ( g ) .
For any point α , the assignment
χ α ( h ) = λ α ( h ) , h ∈ G α ,
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 PSL 2 ( q ) 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.
If β = s α and k fixes both α and β , then a direct comparison of the scalar cocycle with (1) yields
χ α ( s − 1 k s ) = χ α ( k ) 2 .
We call (2) the quadratic compatibility relation. This leads to a useful obstruction. If a 2-transitive subgroup has point stabilizer with no nontrivial k × -valued character, a diagonal rescaling eliminates all scalar factors. Then 2-transitivity forces the structure matrix to be a scalar multiple of J n − I n , where J n and I n denote the n × n 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 PSL 2 ( q ) .
In the projective case, the relation becomes decisive. On P 1 ( F q ) take α = ∞ , β = 0 , and s : x ↦ − 1 / x . For a two-point stabilizer element m r : x ↦ r x we have s − 1 m r s = m r − 1 . Hence (2) gives
χ ( m r ) − 1 = χ ( m r ) 2 ,
and therefore χ ( m r ) 3 = 1 . The character cannot be trivial, so a nontrivial cubic character is forced. In particular, q ≡ 1 ( mod 3 ) and the ground field must contain a primitive cube root of unity.
After these basis normalizations, the character determines the multiplication. Let θ : F q × → μ 3 ( k ) be the resulting nontrivial cubic character. For x ∈ F q set v x = ( x , 1 ) T and v ∞ = ( 1 , 0 ) T , and define
c x x = 0 , c x y = θ ( det ( v x , v y ) ) ( x ≠ y ) .
After a diagonal change of natural basis and one global scalar normalization, every algebra in the proper 3-transitive case has structure matrix C θ = ( c x y ) . Thus the automorphism equation forces the cubic-character form.
The underlying C 3 -phase pattern is classical: it is the d = 1 generalized Paley/projective-space pattern. Its standard complex realization is the phase-three generalized weighing matrix G W ( q + 1 , q ; 3 ) , while C θ is the corresponding k -valued realization obtained from an identification C 3 ≅ μ 3 ( k ) , 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 CGW ( 5 , 4 ; 3 ) and CGW ( 17 , 16 ; 3 ) 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
C θ C θ − 1 = q I .
Hence C θ is invertible over k exactly when char k ≠ p , where q = p m . We then determine the full automorphism group. The group PGL 2 ( q ) always lifts to algebra automorphisms, and the only additional permutations are the Frobenius automorphisms preserving θ . Thus
Aut ( X θ ) ≅ PGL 2 ( q ) ⋊ Gal ( F q / F p ) θ .
Finally, using the monomial rigidity of natural bases ([7] Theorem 4.4) and the standard normalizer of PSL 2 ( q ) in the symmetric group ([5] Sec. 7.7, p. 245), we prove that, for every nontrivial cubic character η : F q × → μ 3 ( k ) ,
X θ ≅ X η ⟺ θ and η are in the same Frobenius orbit .
The main classification is as follows.
Theorem 
(Main theorem). Let X be an n-dimensional idempotent evolution algebra over a field k , with n ≥ 5 , and suppose that
G X : = ρ X ( Aut ( X ) ) ≤ S n , G X ≠ S n
is 3-transitive. Then there is a prime power q = p m such that
n = q + 1 , q ≡ 1 ( mod 3 ) ,
the field k contains a nontrivial cube root of unity, and char k ≠ p . Moreover, X is isomorphic to a cubic-character algebra X θ with structure matrix (3), for a nontrivial character
θ : F q × ⟶ μ 3 ( k ) .
Conversely, every such X θ is idempotent and has a proper 3-transitive natural permutation image. More precisely,
Aut ( X θ ) ≅ PGL 2 ( q ) ⋊ Gal ( F q / F p ) θ ,
and, for every nontrivial cubic character η : F q × → μ 3 ( k ) ,
X θ ≅ X η ⟺ η = θ ( p r ) for some 0 ≤ r < m ,
where θ ( p r ) ( a ) = θ ( a p r ) .
The case q = 4 is particularly concrete. Since PGL 2 ( 4 ) = PSL 2 ( 4 ) ≅ A 5 , the construction yields a unique five-dimensional isomorphism class with automorphism group A 5 . Moreover, dimension 5 is minimal among all idempotent evolution algebras with automorphism group A 5 .
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 A 5 case.

2. Preliminaries on Idempotent Evolution Algebras

Throughout, k is a field and all algebras are finite-dimensional over k .
Definition  
Anevolution algebrais a k -algebra X admitting a basis B = { b 1 , … , b n } such that
b i b j = 0 ( i ≠ j ) .
Such a basis is called anatural basis. Its structure matrix M B = ( μ i j ) is defined by
b i 2 = ∑ j = 1 n μ i j b j .
The algebra isidempotentif X 2 = X .
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 B = { b 1 , … , b n } and B ′ = { b 1 ′ , … , b n ′ } be natural bases. Then there are a permutation σ ∈ S n and scalars d i ∈ k × such that
b i ′ = d i b σ ( i ) .
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 B = { b 1 , … , b n } and structure matrix ( μ i j ) . If
φ ( b i ) = λ i b σ ( i )
with λ i ∈ k × and σ ∈ S n , then φ is an automorphism if and only if
λ j μ i j = λ i 2 μ σ ( i ) σ ( j ) ( 1 ≤ i , j ≤ n ) .
Proof. 
The map φ is invertible and automatically preserves all products b i b j = 0 with i ≠ j . For each i , j , comparing the coefficient of b σ ( j ) in φ ( b i 2 ) with that in φ ( b i ) 2 gives exactly (4). Thus these identities are also sufficient. In the idempotent setting this is Eq. (3) of [4]. □
The permutation σ in lem:automorphism-equation defines the natural representation
ρ X : Aut ( X ) ⟶ S n .
Changing the natural basis conjugates this representation by an element of S n .
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 n ≥ 3 , and put G X = ρ X ( Aut ( X ) ) .
label=()
If G X is 2-transitive, then either all off-diagonal structure constants vanish or all of them are nonzero.
lbbel=()
If G X is transitive, then either all diagonal structure constants vanish or all of them are nonzero.
lcbel=()
If G X is 2-transitive and some diagonal structure constant is nonzero, then G X = S n .
ldbel=()
If G X is 2-transitive, then ρ X is faithful. In the case of nonzero off-diagonal support, the scalars λ i lifting a given realized permutation are uniquely determined.
lebel=()
If n ≥ 5 and G X is 4-transitive, then G X = S n .
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 n ≥ 3 , G X is 2-transitive, and G X ≠ S n . Then, in every natural basis,
μ i i = 0 for all i , μ i j ≠ 0 for all i ≠ j .
Moreover, ρ X is faithful and every σ ∈ G X has a unique scalar lift.
Proof. 
If some diagonal coefficient were nonzero, prop:CMV(iii) would give G X = S n . 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 G ≤ G X be a 2-transitive subgroup. Because the scalar lift of each realized permutation is unique, for each g ∈ G there is a uniquely determined automorphism
g ^ ( b i ) = λ i ( g ) b g ( i ) .
Lemma 
(Scalar cocycle). For g , h ∈ G and every i,
λ i ( g h ) = λ i ( h ) λ h ( i ) ( g ) .
Fix α. Then
χ α : G α ⟶ k × , χ α ( h ) = λ α ( h ) ,
is a group homomorphism.
Proof. 
The composition g ^ h ^ is a lift of g h . By uniqueness of lifts it equals g h ^ , which gives (5). If g , h ∈ G α , then h ( α ) = α , so (5) becomes χ α ( g h ) = χ α ( h ) χ α ( g ) . Since the target is abelian, this is the homomorphism law. □
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 s ∈ G with s ( α ) = β , and let k ∈ G α , β . Then
χ α ( s − 1 k s ) = χ α ( k ) 2 .
Proof. 
Since k fixes β = s ( α ) , the element s − 1 k s fixes α . Using
k s = s ( s − 1 k s )
and applying (5) to both sides gives
λ α ( s ) λ β ( k ) = λ α ( k s ) = λ α ( s ( s − 1 k s ) ) = χ α ( s − 1 k s ) λ α ( s ) .
Thus
λ β ( k ) = χ α ( s − 1 k s ) .
On the other hand, k fixes both α and β . Applying (4) to ( i , j ) = ( α , β ) and using μ α β ≠ 0 yields
λ β ( k ) = λ α ( k ) 2 = χ α ( k ) 2 .
Together with (7) this proves (6). □
Proposition 
(Stabilizer obstruction). Let K ≤ G X be 2-transitive, and suppose G X ≠ S n . Then, for every point α, the induced stabilizer character
χ α : K α ⟶ k ×
from lem:cocycle is nontrivial. Consequently
Hom ( K α , k × ) ≠ 1 .
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 t i ∈ K with t i ( α ) = i and set
d i = λ α ( t i ) .
The value d i is independent of the choice of t i : if t i ′ = t i h with h ∈ K α , then (5) and χ α ( h ) = 1 give λ α ( t i ′ ) = λ α ( t i ) .
For g ∈ K , the elements g t i and t g ( i ) send α to the same point. Hence, again using the trivial stabilizer character,
d g ( i ) = λ α ( g t i ) = d i λ i ( g ) .
Replace the natural basis by b i ′ = d i b i . Then
g ^ ( b i ′ ) = b g ( i ) ′
for every g ∈ K , so all scalar factors are 1. Therefore the new structure constants satisfy
μ g ( i ) g ( j ) ′ = μ i j ′ .
Since K is 2-transitive and the diagonal is zero by cor:proper-support, there is a scalar c ∈ k × such that
M B ′ = c ( J n − I n ) .
Every permutation in S n preserves this matrix with scalar lift 1, so G X = S n , a contradiction. □
The zero-diagonal matrix c ( J n − I n ) 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 n ≥ 5 and that
G X ≤ S n , G X ≠ S n
is 3-transitive. By prop:CMV(v), G X 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 AGL ( d , 2 ) and the exceptional group 2 4 : A 7 ; 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 A 5 ≅ PSL 2 ( 4 ) ≅ PSL 2 ( 5 ) and A 6 ≅ PSL 2 ( 9 ) .
Theorem 
(Projective reduction). Under the preceding assumptions, there is a prime power q ≥ 4 such that
n = q + 1 ,
and, after conjugating the permutation action in S n , the group G X is almost simple with socle PSL 2 ( q ) in the standard action on P 1 ( F q ) .
Proof. 
We exclude the nonprojective cases.
In the alternating branch, the socle is A n in its natural degree-n action. If n ≥ 6 , then A n is at least 4-transitive, contrary to prop:CMV(v) and the assumption G X ≠ S n . In degree 5, the natural action of A 5 is permutation-isomorphic to the projective-line action of PSL 2 ( 4 ) , so it belongs to the projective branch. The exceptional abstract isomorphism A 6 ≅ PSL 2 ( 9 ) does not identify the natural degree-6 action with the degree-10 projective action; the former remains excluded here by 4-transitivity.
Suppose G X is affine. If G X = AGL ( d , 2 ) , then n = 2 d . Since n ≥ 5 , one has d ≥ 3 , and a point stabilizer is
GL ( d , 2 ) = PSL ( d , 2 ) ,
a nonabelian simple, hence perfect, group. This contradicts prop:stabilizer-obstruction. In the exceptional affine case 2 4 : A 7 , the point stabilizer is A 7 , 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 M 11 and the degree-22 actions of M 22 and Aut ( M 22 ) . The ATLAS records the point stabilizer in the degree-12 action of M 11 as PSL 2 ( 11 ) , and the point stabilizer in the degree-22 action of M 22 as PSL 3 ( 4 ) ([1] ATLAS representation M11G1-p12B0 and subgroup program M22G1-max1W1); both are perfect. Thus prop:stabilizer-obstruction excludes M 11 and M 22 . The group Aut ( M 22 ) contains the normal 3-transitive subgroup M 22 , so it is excluded by applying the same obstruction to that subgroup.
The only remaining case in the classification is projective type with socle PSL 2 ( q ) , acting on q + 1 points. This socle formulation also covers the exceptional projective-type overgroups occurring in the standard classification; no assertion that the whole group lies in P Γ L 2 ( q ) 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
Ω = P 1 ( F q ) = F q ∪ { ∞ }
and regard
L : = PSL 2 ( q ) ≤ G X
as acting on Ω in the standard projective way. The group L is 2-transitive for every q ≥ 4 .
Let B = L ∞ . Write U for the translation subgroup. Thus
U = { x ↦ x + b : b ∈ F q } .
The multiplier subgroup is
R q = F q × , q even , ( F q × ) 2 , q odd ,
and
B = U ⋊ R q ,
where r ∈ R q acts as m r : x ↦ r x . Let χ : B → k × be the stabilizer character from lem:cocycle.
Lemma  
One has U ≤ [ B , B ] . Consequently χ is trivial on U and is determined by its restriction to R q .
Proof. 
Choose r ∈ R q with r ≠ 1 . Such an r exists for q ≥ 4 . If u c : x ↦ x + c , then
m r u c m r − 1 u c − 1 = u ( r − 1 ) c .
Since multiplication by r − 1 is a bijection of the additive group F q , every translation is a commutator. □
Proposition 
(Cubic forcing). The character χ is nontrivial and has image of order 3. Consequently
q ≡ 1 ( mod 3 ) ,
and k 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 β = 0 . The projective transformation
s : x ⟼ − 1 / x
belongs to L and interchanges 0 and ∞. For r ∈ R q ,
s − 1 m r s = m r − 1 .
By quadratic compatibility,
χ ( m r − 1 ) = χ ( m r ) 2 .
Since χ is a character,
χ ( m r − 1 ) = χ ( m r ) − 1 .
Thus
χ ( m r ) 3 = 1
for every r ∈ R q . The character is nontrivial, so its image is the full group of third roots of unity in k .
If q is even, | R q | = q − 1 , hence 3 ∣ ( q − 1 ) . If q is odd, | R q | = ( q − 1 ) / 2 , hence 3 ∣ ( q − 1 ) / 2 . In either case q ≡ 1 ( mod 3 ) . □
Lemma 
(Extension of the cubic character). There is a unique nontrivial character
θ : F q × ⟶ μ 3 ( k )
whose restriction to R q equals χ | R q .
Proof. 
If q is even, R q = F q × and there is nothing to prove. Suppose q is odd. Then R q = ( F q × ) 2 has index 2. Since F q × is cyclic and the squaring map is an automorphism of the cyclic group μ 3 ( k ) , restriction induces a bijection
Hom ( F q × , μ 3 ( k ) ) ⟶ Hom ( R q , μ 3 ( k ) ) .
Thus the extension exists and is unique. □
Extend both θ and θ − 1 to F q by setting θ ( 0 ) = θ − 1 ( 0 ) = 0 . Since θ has odd order, θ ( − 1 ) = 1 . For x ∈ F q put
v x = x 1 , v ∞ = 1 0 ,
and define the ( q + 1 ) × ( q + 1 ) matrix
C θ = ( c x y ) x , y ∈ Ω , c x x = 0 , c x y = θ ( det ( v x , v y ) ) ( x ≠ y ) .
In particular,
c x y = θ ( x − y ) ( x , y ∈ F q , x ≠ y ) , c x ∞ = c ∞ x = 1 .
Let E θ be the evolution algebra over k with natural basis
E θ = { e x : x ∈ Ω }
and structure matrix C θ . No idempotence assumption is made at this stage.
Lemma 
(Standard projective lift). Let g ∈ L and choose A ∈ SL 2 ( q ) representing g. For every x ∈ Ω , write
A v x = a x v g ( x ) , a x ∈ F q × ,
and put
ν x ( g ) = θ ( a x ) − 1 .
Then
ν y ( g ) c x y = ν x ( g ) 2 c g ( x ) g ( y )
for all x , y . Hence
e x ⟼ ν x ( g ) e g ( x )
defines an automorphism of E θ , whether or not C θ is invertible. These automorphisms form a lift of the action of L, so the scalars ν x ( g ) satisfy the cocycle identity (5). Moreover, the stabilizer character at ∞ is precisely χ.
Proof. 
The definition of ν x ( g ) is independent of the chosen representative A: for odd q the two representatives in SL 2 ( q ) differ by − I , and θ ( − 1 ) = 1 ; for even q there is no ambiguity. Since det A = 1 ,
det ( v g ( x ) , v g ( y ) ) = a x − 1 a y − 1 det ( v x , v y ) .
Therefore
c g ( x ) g ( y ) = θ ( a x ) − 1 θ ( a y ) − 1 c x y .
Since θ ( a x ) 3 = 1 ,
ν x ( g ) 2 c g ( x ) g ( y ) = θ ( a x ) − 2 θ ( a x ) − 1 θ ( a y ) − 1 c x y = θ ( a y ) − 1 c x y = ν y ( g ) c x y .
The resulting monomial map is invertible, and the automorphism equation shows that it is an algebra automorphism; no nonsingularity assumption on C θ is needed.
If A g , A h represent g , h ∈ L , then A g A h represents g h , up to the central factor − I when q is odd. The independence just established gives
ν x ( g h ) = ν x ( h ) ν h ( x ) ( g ) ,
so these automorphisms form a group lift of L.
Now suppose g ∈ L ∞ . We may represent it by
A = a b 0 a − 1 .
Its affine multiplier is r = a 2 ∈ R q , while a ∞ = a . Hence
ν ∞ ( g ) = θ ( a ) − 1 = θ ( a ) 2 = θ ( a 2 ) = θ ( r ) = χ ( g ) ,
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 C θ . Equivalently,
X ≅ E θ .
Proof. 
Let λ x ( g ) be the scalar lift of g ∈ L in X, and let ν x ( g ) be the standard lift from lem:standard-L-lift. Define
δ x ( g ) = λ x ( g ) ν x ( g ) .
Both scalar systems satisfy the cocycle identity, so their quotient δ x ( g ) also satisfies it. By lem:standard-L-lift, the two stabilizer characters at ∞ agree; hence
δ ∞ ( h ) = 1 ( h ∈ L ∞ ) .
For each x ∈ Ω , choose t x ∈ L with t x ( ∞ ) = x and set
d x = δ ∞ ( t x ) .
As in the proof of prop:stabilizer-obstruction, this is independent of the choice of t x , and the cocycle identity gives
d g ( x ) = d x δ x ( g ) .
Replace the natural basis by b x ′ = d x b x . In this basis, the scalar lift of every g ∈ L is exactly ν x ( g ) .
Let ( μ x y ′ ) be the resulting structure matrix. For x ≠ y , divide the automorphism equation for ( μ x y ′ ) by the corresponding equation for C θ , using the same scalar lift ν . This gives
μ g ( x ) g ( y ) ′ c g ( x ) g ( y ) = μ x y ′ c x y .
The group L is 2-transitive on Ω , so this quotient is constant, say a ∈ k × , on all ordered pairs of distinct points. Both matrices have zero diagonal. Hence
M B ′ = a C θ .
Finally, a uniform rescaling of the natural basis absorbs the scalar a: if b x ′ ′ = a − 1 b x ′ , then the structure matrix becomes C θ . □

6. The Cubic-Character Algebras and Their Automorphism Groups

We now fix a prime power q = p m ≡ 1 ( mod 3 ) , a field k containing a nontrivial cube root of unity, and a nontrivial cubic character
θ : F q × → μ 3 ( k ) .
As above, extend both θ and θ − 1 to F q by setting θ ( 0 ) = θ − 1 ( 0 ) = 0 . Let C θ be the matrix in (8), and let E θ be the evolution algebra over k with natural basis E θ = { e x : x ∈ Ω } and structure matrix C θ .
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
C θ C θ − 1 = q I q + 1 .
Consequently, C θ is invertible over k if and only if char k ≠ p .
Proof. 
Because θ is a nontrivial character of order 3, its three values occur equally often on F q × ; hence
∑ t ∈ F q × θ ( t ) = 0 , ∑ t ∈ F q × θ − 1 ( t ) = 0 .
We compute the entries of the product. First let x ∈ F q . On the diagonal,
( C θ C θ − 1 ) x x = ∑ z ∈ F q ∖ { x } θ ( x − z ) θ − 1 ( z − x ) + 1 .
Because θ ( − 1 ) = 1 , every summand in the finite sum is 1, giving ( q − 1 ) + 1 = q . The ∞ , ∞ entry is also q.
Now let x , y ∈ F q with x ≠ y . Put d = x − y and write z = y + d u . Then the finite part of the ( x , y ) entry becomes
∑ u ∈ F q θ ( 1 − u ) θ − 1 ( u ) .
The terms at u = 0 , 1 vanish. For the remaining terms,
θ ( 1 − u ) θ − 1 ( u ) = θ ( u − 1 − 1 ) .
The map u ↦ u − 1 − 1 bijects F q ∖ { 0 , 1 } onto F q ∖ { 0 , − 1 } , so the sum equals
∑ t ∈ F q ∖ { 0 , − 1 } θ ( t ) = − θ ( − 1 ) = − 1 .
The projective point z = ∞ contributes 1, so the off-diagonal entry is 0.
Finally, if x ∈ F q , then
( C θ C θ − 1 ) x ∞ = ∑ z ∈ F q ∖ { x } θ ( x − z ) = 0 ,
and similarly for the transpose position. This proves (9).
If char k ≠ p , then q ≠ 0 in k and (9) gives an inverse. If char k = p , then the product in (9) is zero while C θ − 1 ≠ 0 ; hence C θ cannot be invertible. □
Definition  
When char k ≠ p , write X θ : = E θ . By prop:inverse, this is an idempotent evolution algebra.
As noted in the Introduction, the abstract C 3 -phase pattern of C θ is the d = 1 generalized Paley/projective-space pattern. Its standard complex realization is G W ( q + 1 , q ; 3 ) , whereas C θ is the corresponding k -valued realization via an identification C 3 ≅ μ 3 ( k ) ; 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 PGL 2 ( q ) on P 1 ( F q ) lifts to algebra automorphisms of X θ . In particular,
PGL 2 ( q ) ≤ ρ X θ ( Aut ( X θ ) ) .
Proof. 
Let g ∈ PGL 2 ( q ) and choose A ∈ GL 2 ( q ) representing it. Write
A v x = a x v g ( x )
with a x ∈ F q × , and put
u x = θ ( a x ) , δ = θ ( det A ) .
Taking determinants gives
c g ( x ) g ( y ) = δ u x − 1 u y − 1 c x y .
Define
λ x = δ − 1 u x − 1 .
Since u x 3 = 1 ,
λ x 2 c g ( x ) g ( y ) = δ − 1 u y − 1 c x y = λ y c x y .
Thus (4) holds.
The lift is independent of the scalar representative of A. Indeed, replacing A by c A multiplies δ by θ ( c ) 2 and every u x by θ ( c ) , so every λ x is multiplied by θ ( c ) − 3 = 1 . For the multiplier m r : x ↦ r x , the choice A = diag ( r , 1 ) gives the scalar at e ∞ as
λ ∞ = θ ( r ) .
□
Let F : x ↦ x p denote the Frobenius permutation of P 1 ( F q ) , fixing ∞, and define
Gal ( F q / F p ) θ = { F r : θ ( a p r ) = θ ( a ) for all a ∈ F q × } .
Theorem 
(Full automorphism group). For every cubic-character algebra X θ ,
ρ X θ ( Aut ( X θ ) ) = PGL 2 ( q ) ⋊ Gal ( F q / F p ) θ .
Since the natural representation is faithful,
Aut ( X θ ) ≅ PGL 2 ( q ) ⋊ Gal ( F q / F p ) θ .
In particular,
Aut ( X θ ) ≅ P Γ L 2 ( q ) , p ≡ 1 ( mod 3 ) , PGL 2 ( q ) ⋊ 〈 F 2 〉 , p ≡ 2 ( mod 3 ) .
In the second case m is even and | 〈 F 2 〉 | = m / 2 .
Proof. 
Put
H = ρ X θ ( Aut ( X θ ) ) .
By prop:PGL, H contains PGL 2 ( q ) and is therefore 3-transitive.
First, we show directly that H ≠ S q + 1 . Since every off-diagonal entry of C θ 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 e ∞ defines a character
ψ ∞ : H ∞ ⟶ k × .
Restrict this character to L ∞ , where L = PSL 2 ( q ) . For m r ∈ L ∞ , 0 with r ∈ R q , the explicit lift in prop:PGL gives
ψ ∞ ( m r ) = θ ( r ) .
The restriction θ | R q is nontrivial: it is immediate when q is even, while for odd q the subgroup R q has index 2, which is coprime to the order 3 of θ . Thus ψ ∞ ( m r ) has order 3 for some r ∈ R q . If H = S q + 1 , then H ∞ ≅ S q with q ≥ 4 , and S q ab has exponent 2. Every character S q → k × 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 PSL 2 ( q ) in the projective-line action. Since the degree is q + 1 , the parameter is again q. Let
L = PSL 2 ( q ) ≤ PGL 2 ( q ) ≤ H
be the standard subgroup already supplied by prop:PGL. Since H is almost simple with socle S, the quotient H / S is a subgroup of the solvable outer automorphism group of S ([5] Sec. 7.7). The image of the perfect group L in H / S is therefore trivial. Hence L ≤ S , and equality follows from | L | = | S | .
Now S = L is normal in H. The standard normalizer formula for the projective-line action gives
N S q + 1 ( L ) = P Γ L 2 ( q )
([5] Sec. 7.7, p. 245). Therefore
PGL 2 ( q ) ≤ H ≤ P Γ L 2 ( q ) .
Since P Γ L 2 ( q ) = PGL 2 ( q ) ⋊ Gal ( F q / F p ) , every element of P Γ L 2 ( q ) can be written as g F r with g ∈ PGL 2 ( q ) . Because PGL 2 ( q ) ≤ H , one has g F r ∈ H if and only if F r ∈ H .
It remains to decide which Frobenius powers lift. Suppose first that F r is the permutation part of an automorphism Φ . Let h ∈ L ∞ . Uniqueness of lifts gives
Φ h ^ Φ − 1 = F r h F − r ^ .
Because F r fixes ∞, the automorphism Φ preserves the line k e ∞ and acts on it by a scalar. Conjugation by Φ therefore leaves the stabilizer scalar unchanged, so
ψ ∞ ( F r h F − r ) = ψ ∞ ( h ) .
For h = m a in the two-point stabilizer, the restriction computed above gives
θ ( a p r ) = θ ( a )
on R q . If q is odd, the restriction map for cubic characters is injective by lem:extension; hence the equality holds on all of F q × . Thus F r ∈ Gal ( F q / F p ) θ .
Conversely, if F r fixes θ , then from (8)
c F r ( x ) , F r ( y ) = c x y
for all x , y , so F r itself is a pure-permutation automorphism. This proves the group formula.
Finally, if p ≡ 1 ( mod 3 ) , then every p r ≡ 1 ( mod 3 ) , so all Frobenius powers fix the two cubic characters. If p ≡ 2 ( mod 3 ) , the condition q = p m ≡ 1 ( mod 3 ) forces m even, and p r ≡ 1 ( mod 3 ) 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 A 5 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 q = p m ≡ 1 ( mod 3 ) , let k be a field of characteristic different from p that contains a nontrivial cube root of unity, and let
θ , η : F q × ⟶ μ 3 ( k )
be nontrivial characters. Then
X θ ≅ X η ⟺ η = θ ( p r ) for some 0 ≤ r < m ,
where θ ( p r ) ( a ) = θ ( a p r ) . Consequently, the family has two k -algebra isomorphism classes when p ≡ 1 ( mod 3 ) , and one when p ≡ 2 ( mod 3 ) .
Proof. 
Suppose Φ : X θ → X η is an isomorphism. By ([7] Theorem 4.4), the map Φ is monomial relative to natural bases. Its permutation part σ ∈ S q + 1 therefore conjugates the natural permutation image of X θ to that of X η . By thm:full-aut, both groups are almost simple with socle the standard subgroup
L = PSL 2 ( q ) .
The socle is characteristic, hence
σ L σ − 1 = L .
The standard normalizer formula
N S q + 1 ( L ) = P Γ L 2 ( q )
therefore gives σ = g F r for some g ∈ PGL 2 ( q ) and some Frobenius power F r ; see ([5] Sec. 7.7, p. 245). Composing Φ with an automorphism of X η having permutation part g − 1 , we may assume σ = F r .
Let ψ ∞ , θ and ψ ∞ , η denote the point-stabilizer characters of X θ and X η , respectively, defined as in the proof of thm:full-aut. For h ∈ L ∞ , conjugating the unique lift of h by Φ shows that the stabilizer scalars satisfy
ψ ∞ , η ( F r h F − r ) = ψ ∞ , θ ( h ) .
On the multiplier subgroup, the computation in prop:PGL gives
ψ ∞ , θ ( m a ) = θ ( a ) , ψ ∞ , η ( m a ) = η ( a ) .
Hence the preceding equality reads
η ( a p r ) = θ ( a )
for a ∈ R q , and hence for all a ∈ F q × by lem:extension. Equivalently,
η = θ ( p s )
for s ≡ m − r ( mod m ) , so θ and η lie in the same Frobenius orbit.
Conversely, suppose η = θ ( p s ) . Choose r with r + s ≡ 0 ( mod m ) . Then η ( a p r ) = θ ( a ) for every a ∈ F q × , and the pure permutation x ↦ x p r satisfies
c F r ( x ) , F r ( y ) η = c x y θ .
Hence it defines an algebra isomorphism X θ → X η .
There are exactly two nontrivial cubic characters, θ and θ − 1 . If p ≡ 1 ( mod 3 ) , Frobenius fixes both, giving two orbits. If p ≡ 2 ( mod 3 ) , 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 q = 4 r for r ≥ 1 . Then q ≡ 1 ( mod 3 ) , so the algebras X θ exist by prop:inverse; their natural permutation images contain the sharply 3-transitive group PGL 2 ( q ) and are proper by thm:full-aut. □
Corollary 
(The five-dimensional A 5 algebra). There exists a five-dimensional idempotent evolution algebra X over k with
Aut ( X ) ≅ A 5
if and only if
char k ≠ 2 and k contains a primitive cube root of unity .
When these conditions hold, there is exactly one such five-dimensional algebra up to k -algebra isomorphism. Moreover, dimension 5 is minimal among all idempotent evolution algebras with automorphism group A 5 .
Proof. 
For existence, take q = 4 . Then
PGL 2 ( 4 ) = PSL 2 ( 4 ) ≅ A 5 .
The Frobenius automorphism of F 4 / F 2 interchanges the two nontrivial cubic characters, so no nontrivial Frobenius power fixes a chosen θ . Hence thm:full-aut gives
Aut ( X θ ) ≅ A 5 .
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 Aut ( X ) ≅ A 5 . The kernel of ρ X is abelian; this follows, for example, from the diagonal-kernel exact sequence in ([8] Theorem 3.2) (see also [4]). Since A 5 is nonabelian simple, the kernel is trivial. Thus A 5 embeds into S 5 and its image is the standard alternating subgroup, which is 3-transitive. Applying thm:main gives q = 4 , char k ≠ 2 , and the existence of a nontrivial cube root of unity in k .
The same kernel argument works in every dimension: if Aut ( Y ) ≅ A 5 for an idempotent evolution algebra Y of dimension d, then A 5 embeds in S d . Since | A 5 | = 60 > | S 4 | , one must have d ≥ 5 . □
To make the five-dimensional case explicit, choose ω ∈ k with ω 2 + ω + 1 = 0 . With a suitable ordering of P 1 ( F 4 ) , a representative of the unique isomorphism class in cor:A5 has the structure matrix
M A 5 = 0 1 1 ω 2 ω 1 0 1 ω ω 2 1 1 0 1 1 ω 2 ω 1 0 1 ω ω 2 1 1 0 .
A direct calculation gives
det M A 5 = − 32 ,
consistent with prop:inverse and the condition char k ≠ 2 .
Remark  
The underlying C 3 -phase pattern is classical. It is the phase-three generalized Paley/projective-space pattern. Its standard complex realization is G W ( q + 1 , q ; 3 ) , while C θ is the corresponding k -valued realization via an identification C 3 ≅ μ 3 ( k ) , 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 CGW ( 5 , 4 ; 3 ) and CGW ( 17 , 16 ; 3 ) , with underlying permutation groups A 5 and PSL 2 ( 16 ) : C 2 , 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

  1. 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/.
  2. Berman, G. Families of generalized weighing matrices. Canad. J. Math. 1978, 30(no. 5), 1016–1028. [Google Scholar] [CrossRef]
  3. Cameron, P. J. Permutation Groups  . In London Mathematical Society Student Texts; Cambridge University Press: Cambridge, 1999; vol. 45. [Google Scholar]
  4. Costoya, C.; Mayorga, P.; Viruel, A. Permutation representations and automorphisms of evolution algebras. Mediterr. J. Math. 2025, 22, 149. [Google Scholar] [CrossRef]
  5. Dixon, J. D.; Mortimer, B. Permutation Groups  . In Graduate Texts in Mathematics; Springer: New York, 1996; vol. 163. [Google Scholar]
  6. 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.
  7. Elduque, A.; Labra, A. Evolution algebras and graphs. J. Algebra Appl. 2015, 14(no. 7), 1550103. [Google Scholar] [CrossRef]
  8. Elduque, A.; Labra, A. Evolution algebras, automorphisms, and graphs. Linear Multilinear Algebra 2021, 69(no. 2), 331–342. [Google Scholar] [CrossRef]
  9. Et-Taoui, B. A note on complex conference matrices. Finite Fields Appl. 2023, 91, 102251. [Google Scholar] [CrossRef]
  10. 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]
  11. Iverson, J. W.; Mixon, D. G. Doubly transitive lines II: Almost simple symmetries. Algebr. Comb. 2024, 7(no. 1), 37–76. [Google Scholar] [CrossRef]
  12. Jungnickel, D.; Tonchev, V. D. Perfect codes and balanced generalized weighing matrices. Finite Fields Appl. 1999, 5(no. 3), 294–300. [Google Scholar] [CrossRef]
  13. Pantangi, V. R. T. All 3-transitive groups satisfy the strict Erdos–Ko–Rado property. Eur. J. Comb. 2025, 124, 104057. [Google Scholar] [CrossRef]
  14. Sriwongsa, S.; Zou, Y. M. On automorphism groups of idempotent evolution algebras. Linear Algebra Appl. 2022, 641, 143–155. [Google Scholar] [CrossRef]
  15. 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.
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.