Next Article in Journal
New Results of Differential Subordination for a Specific Subclass of p-Valent Meromorphic Functions Involving a New Operator
Previous Article in Journal
A Fractional Gompertz Model with Generalized Conformable Operators to Forecast the Dynamics of Mexico’s Hotel Demand and Tourist Area Life Cycle
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Commutative Chain Rings with Index of Nilpotency 5 and Residue Field Fpm

by
Alhanouf Ali Alhomaidhi
1,
Sami Alabiad
1,* and
Nawal A. Alsarori
2
1
Department of Mathematics, College of Science, King Saud University, P.O. Box 2455, Riyadh 11451, Saudi Arabia
2
Department of Mathematics, Dr. Babasaheb Ambedkar Marathwada University, Aurangabad 431004, India
*
Author to whom correspondence should be addressed.
Axioms 2024, 13(12), 877; https://doi.org/10.3390/axioms13120877
Submission received: 17 October 2024 / Revised: 5 December 2024 / Accepted: 16 December 2024 / Published: 17 December 2024

Abstract

:
This paper gives a thorough characterization of chain rings with index of nilpotency 5 and residue field F p m , where p represents a prime number, contributing valuable insights to the field of algebraic structures. It carefully identifies and categorizes the family of chain rings with these specifications, thereby enhancing the understanding of their properties and applications. In addition, the work offers a detailed enumeration of all chain rings containing p 5 m elements. The significance of finite chain rings is emphasized, particularly in their suitability for coding theory, which confirms their relevance in contemporary mathematical and engineering contexts.
MSC:
16L30; 94B05; 16P20; 94B60

1. Introduction

Finite chain rings are an important category of rings within abstract algebra, possessing distinctive characteristics that attract substantial interest from mathematicians. By definition, a finite chain ring is a finite ring in which every ideal is included in a unique maximal principal ideal, resulting in a chain-like arrangement of ideals [1,2,3]. This stands in stark contrast to more general rings, which can have multiple maximal ideals leading to a more intricate structure of ideals. Basic examples of finite chain rings arise from Galois rings, first identified by Krull [4], particularly those of the form Z p n , where p is a prime number. The exploration of finite chain rings is significantly linked to module theory, as finitely generated modules over these rings display well-defined behaviors that can help clarify the structure of the rings themselves [5,6]. Recently, it has been discovered that chain rings can serve as alphabets for linear codes, due to the applicability of two classical theorems by MacWilliams—the Extension Theorem and the MacWilliams Identities—to these rings, similar to their application in finite fields. For more on the topic, see [7,8,9,10,11,12,13].
Every finite commutative chain ring R can be represented as a quotient of a polynomial ring over its prime subring R 0 , specifically
R R 0 [ u ] I ,
where u is a generator of the maximal ideal J and I is an appropriate ideal formed by a combination of u i 1 and p i 2 , with both i 1 and i 2 greater than 1. This connection allows for the use of techniques from algebraic geometry and number theory, enhancing the study of these rings. The classification of finite chain rings primarily involves analyzing the structure of the ideal I, leading to the conclusion that such rings can typically be expressed as a direct sum of the form
R = R 0 + u R 0 + + u k R 0 ,
for some positive integer k. For some integer m, the residue field R J takes the form F p m . The order of R is given by | F p m | l = ( p m ) l , where l is the length of R when viewed as an R-module. Since R is finite, there exists a positive integer t such that J t = 0 and J t 1 0 ; this t is known as the index of nilpotency of J and satisfies t l . The additive order of 1 is p n for some n, referred to as the characteristic of R. In summary, the parameters p, n, m, k, and l associated with R are termed the invariants of R [14]. This paper aims to identify and classify all chain rings that have fixed invariants p, n, m, k, and l = 5 , specifically those of order p 5 m . When l = m = 1 , it is well-established that there is only one chain ring, up to isomorphism, with p elements: the Galois field F p . For chain rings of order p 2 , the options are F p 2 and Z p 2 . If p is odd, the local rings with l m = 3 include F p 3 , Z p 3 , Z p 2 [ u ] u 2 p , p u , and Z p 2 [ u ] u 2 p α , p u , where α is a primitive element of F p m . For p = 2 , local rings with 2 3 elements include F 8 , Z 8 and Z 2 2 [ u ] u 2 2 , 2 u , see [1]. Recently, the chain rings of order p 4 have been comprehensively detailed in several studies, see, for example, [10], where linear codes over such rings have garnered attention; while those with m = 1 and l = 5 have been studied in an earlier study by Corbas and Williams [15]. The current paper has two primary objectives: firstly, to construct chain rings with m 1 and of length 5 (with a nilpotency index of 5) and, secondly, to classify and enumerate these rings under isomorphism, ensuring that they share the same invariants. In the discussion, all chain rings with m = 1 are thoroughly listed and enumerated in Example 5.
The organization of the rest of this study is as follows: Section 2 reviews fundamental aspects of finite chain rings. Following that, Section 3 presents our findings regarding all chain rings with p 5 m elements, subdivided by the values of n . Notably, we provide detailed information on those rings containing p 5 elements, supplemented with illustrative examples of our main results.

2. Preliminaries

In this section, we outline some fundamental concepts and notations that will be utilized throughout the manuscript. Let J denote the maximal ideal of R, a finite local chain ring with identity. For the results presented in this section, we refer to the literature [1,14,16,17,18,19,20].
A finite ring R is classified as a chain ring if the ideal lattice of R constitutes a chain. This condition is equivalent to R being local and having a primary maximal ideal J, or to the condition that the nilpotency index t of J equals l, where t = l represents the length of the sequence
J J 2 J l 1 J l = 0 .
In this context, we observe that J = u R , and the quotient R J provides the residue field F p m , which is isomorphic to a finite field G F ( p m ) . Furthermore, there exists an integer k such that p J k , meaning that u k p , where p is a prime number. The characteristic of the ring R takes the form p n , for some positive integer n. Additionally, we can identify an integer e satisfying 1 e k + 1 such that l = ( n 1 ) ( k + 1 ) + e . Notably, such rings can generally be expressed as a direct sum of the form
R = R 0 + u R 0 + + u k R 0 ,
leading to the equation
u k + 1 = p ( r 0 + r 1 u + r 2 u 2 + + r k u k ) ,
where r 0 is a unit in R and r i R . This relationship shows that u is a root of the Eisenstein polynomial given by
g ( x ) = x k + 1 p i = 0 k r i x i .
The parameters p, n, m, l, and k are termed the invariants of R. Generally, we have
R R 0 [ x ] g ( x ) , p n 1 x e .
According to [1], this is recognized as an Eisenstein extension of R over R 0 . The unit group U ( R ) of the ring R is described in [16] and takes the form
U ( R ) = α × H ,
where α represents a primitive element from F p m , and H = 1 + J . Based on Equation (5), we can express u k + 1 , as
u k + 1 = p β h ,
with β α and h H .
An element f R [ x ] is defined as basic irreducible if f ¯ is irreducible in F p m . Suppose g R [ x ] is a basic irreducible polynomial, and let m = deg ( g ¯ ) . In this scenario, there exists a unit β in R [ x ] and a monic polynomial f in R [ x ] such that f = β g (see [18]). If J = p , we then have n = l and
R = R 0 = G R ( p n , m ) Z p n [ γ ] Z p n [ x ] g ( x ) ,
where γ is a root of a basic irreducible polynomial g ( x ) Z p n [ x ] of degree m. This extension of Z p n is a Galois extension. This category of rings is uniquely characterized by the parameters p, n, and m, and the group of automorphisms Aut ( G R ( p n , m ) ) is cyclic of order m, generated by the Frobenius map ρ [1].
The notations introduced in this section will remain applicable throughout the entirety of the manuscript.

3. Chain Rings of Length 5

In this section, let R be a local ring characterized by parameters p , n , m , l , and k. We will demonstrate all possible structures of R and their enumeration by varying the values of n and k.
For clarity, we define α as a primitive element of F p m , leading to the sets:
Γ ( m ) = α { 0 } = { 0 , 1 , α , α 2 , , α p m 2 } , A = { α 2 i + 1 : 1 i p m 1 2 1 } = { α Γ * ( m ) : α ( Γ * ( m ) ) 2 } , B = { α 2 i : 1 i p m 1 2 1 } = { α Γ * ( m ) : α ( Γ * ( m ) ) 2 } .
To establish a relationship among the parameters t, n, and k, which is essential for proving the main results of this section, the following results are pivotal.
Proposition 1.
Let R be a finite local ring. Then, t = l if and only if R is a chain ring with parameters p , n , m , l , and k = t 1 .
Proof. 
Since J l = 0 and J l 1 0 , the chain R = J 0 J J 2 J l 1 J l = 0 forms a composition series. Thus, we have dim F p m J i J i + 1 = 1 for 1 i l 1 . In particular, dim F p m J J 2 must equal 1, given that k l 1 . This implies that J is principal, indicating that R is a chain ring with k = l 1 . The converse is straightforward. □
We will show that the form and algebraic structure of R are completely determined by the parameters p , n , m , l , and k. Subsequently, we will establish a crucial relationship among the parameters n, l, and k of a chain ring, which will guide us in the construction of such rings.
Lemma 1.
Let R be a chain ring with parameters p , n , m , l , and k. Then,
l n 1 k l n .
Proof. 
Assume p t i is the annihilator of u i . Given that l = n + t 1 + t 2 + + t k and 1 t i n for each i, we have k t 1 + t 2 + + t k . This leads us to conclude that k + n l , hence k l n . Conversely, since there are k generators of R over G R ( p n , m ) , any element a from G R ( p n , m ) can be expressed as
a = a 1 + p a 1 + + p n 1 a n ,
where a i Γ ( m ) . Thus, there are n + k n such generators over F p m . Therefore, l cannot exceed n + k n = ( k + 1 ) n , which implies that l ( k + 1 ) n , yielding the result l n 1 k . □
It is pertinent to note the relationship among the invariants of R, expressed as
l = t = 5 = ( k + 1 ) ( n 1 ) + e ,
where 1 e k + 1 . We will investigate all feasible values for n. In particular, for n = 4 , the equation 5 = 3 ( k + 1 ) + e has no valid solutions for k and e, indicating that no chain ring exists in this case. Consequently, this paper will be structured into subsections that focus on the values n = 1 , 2 , 3 , and 5.

3.1. Chain Rings of Characteristic p

This subsection assumes n = 1 , and thus, by Lemma 1, we have k = 4 = l 1 . Moreover, the prime subring of R is a field of the form R 0 = F p m . The order of R is p 5 m , and this forces the construction of R to be
R = F p m + u F p m + u 2 F p m + u 3 F p m + u 4 F p m , J = u F p m + J 2 , J 2 = u 2 F p m + J 3 , J 3 = u 3 F p m + J 4 , J 4 = u 4 F p m , J 5 = 0 .
For general value of k , R can be expanded as
R = F p m + u F p m + + u k 1 F p m .
It was found that this class of chain rings might be utilized to create new sequences with the best Hamming correlation properties, which is why it has been widely used in coding theory. These sequences are particularly valuable in applications such as spread spectrum communication, where they help mitigate interference and ensure reliable multiple access for users sharing the same frequency bandwidth. By creating sequences with optimal correlation properties, systems can enhance performance in environments with noise and other disturbances; for more details, see [10].
Theorem 1.
Every chain ring of order p 5 m and characteristic p is uniquely isomorphic to
F p m [ u ] u 5 .
Proof. 
The order of R explains that k = 4 , and as such, if J = u , u 5 = 0 . As n = 1 , we have R 0 = F p m . Hence, R is an isomorphic image of F p m [ u ] with I = u 5 . As we have seen earlier, R F p m [ u ] I . Therefore,
R F p m [ u ] u 5 .
Example 1.
Observe that Theorem 1 states that R is uniquely determined by the invariants p , m , and k . Which means any two rings R and T have, for example, 5 , 6 , and 4 as their fixed invariants; then, they are isomorphic,
R T F 5 6 [ u ] u 5 .
R = F 5 6 + u F 5 6 + u 2 F 5 6 + u 3 F 5 6 + u 4 F 5 6 .
If we denote N ( p , n = 1 , m , k ) , the number of non-isomorphic classes of chain rings of 5-length with invariants p , n = 1 , m , k , then, by Theorem 1, we obtain
N ( p , n = 1 , m , k ) = 1 .

3.2. Chain Rings of Characteristic p 2

Throughout, let R be a chain ring that has the characteristic p 2 , implying n = 2 . The primary subring of R takes the type of R 0 = G R ( p 2 , m ) . The order of R and the implications of Lemma 1 indicate that k = 2 . Consequently, the J under discussion has two scenarios depending on the position of p in the series
J J 2 J 3 J 4 J 5 = 0 .
First, observe that if p J , then R does not form a chain since J is not principal, If p J 2 , then we reach a conclusion that p 2 J 4 , which leads to J 4 = 0 , which is not possible because t = 5 . Therefore, we encounter two cases separately: p J 3 J 4 (denoted as i p = 3 ) and p J 4 (denoted as i p = 4 ). Hence, we will analyze these cases in two theorems. The first theorem addresses the case where p J 3 , while the second theorem examines the case where p J 4 . However, in either case, we have
R = G R ( p 2 , m ) + u G R ( p 2 , m ) + u 2 G R ( p 2 , m ) .
The ring R can be constructed in the form G R ( p 2 , m ) [ u ] I . Our goal is to determine the precise structure of I in order to better understand the overall structure of R , which relies heavily on the interactions between u and p given that n = 2 . Furthermore, we aim to calculate the number N ( p , n = 2 , m , k = 2 ) of chain rings that possess invariants p , n = 2 , m , k = 2 .
Theorem 2.
Every chain ring of order p 5 m and characteristic p 2 with i p = 3 is uniquely isomorphic to
G R ( p 2 , m ) [ u ] u 3 p β h , p u 2 .
Proof. 
We note first that p J 4 . The order of R clarifies that k must be 2 . Building on that, we have J 3 = p G R ( p 2 , m ) + J 4 and J = u G R ( p 2 , m ) + J 2 , then multiplying gives J 3 × J = J 4 , and hence, J 4 = p u G R ( p 2 , m ) , so that J 3 = p G R ( p 2 , m ) + p u G R ( p 2 , m ) . Thus, we obtain
J = u G R ( p 2 , m ) + J 2 , J 2 = u 2 G R ( p 2 , m ) + J 3 , J 3 = p F p m + J 4 , J 4 = p u F p m , J 5 = 0 .
As u 3 J 3 and thus we suppose u 3 = p x + p y u , where x and y are in G R ( p 2 , m ) . It is evident that x U ( G R ( p 2 , m ) ) , because else u 4 = p y u 2 = 0 , which leads to J 4 = 0 and contradicts t = 5 . By Equation (5), x = β h 1 , where β Γ * ( m ) and h 1 H ( G R ( p 2 , m ) ) . This gives u 3 = p β h + p y u , and thus
u 3 = p β h ,
where h = h 1 + p β 1 y u U ( R ) . The other relation between p and u is that p u 2 = 0 since p u 2 J 5 . Note that here, t = 2 = 5 3 ( 2 1 ) . Therefore, R attains the construction of
G R ( p 2 , m ) [ u ] u 3 p β h , p u 2 .
Without difficulties, one can check that the ring R in Equation (17) has the right properties. To characterize such rings, we consider two cases. Case a. If p 3 , we may have H ( R ) 3 = H ( R ) because H ( R ) is p-group and the gcd of p and 3 is ( p , 3 ) = 1 . As a result, we may replace h in Equation (16) by h 0 3 as the existence of h 0 is guaranteed by the order of H ( R ) . Hence, the equation will be reduced to that of
u 3 = p β .
Let R and T be two rings with fixed invariants p , n = 2 , m , k + 1 = 3 and let u 3 = p β , v 3 = p γ be their associated relations, respectively. Moreover, assume φ is an isomorphism, R T , and σ is its restriction to G R ( p 2 , m ) . Observe, φ ( u ) = δ h v , where δ Γ * ( m ) and h H ( T ) . So, we have
p σ ( β ) = φ ( p β ) = φ ( u 3 ) = ( φ ( u ) ) 3 = ( δ h v ) 3 = δ 3 h 3 v 3 = p δ 3 h 3 γ .
Hence, p σ ( β ) = p δ 3 h 3 γ . Since p u 2 = 0 and n = 2 , we may assume that p h 3 = p . By comparing sides, we obtain the relation
σ ( β ) = δ 3 γ .
This relation classifies our considered rings. The latter equation can be interpreted as σ ( β ) γ 1 = δ 3 , which means that σ ( β ) γ 1 Γ * ( m ) Γ * ( m ) 3 . As p 3 , we obtain Γ * ( m ) 3 = Γ * ( m ) when the order of Γ * ( m ) , p m 1 is relatively prime with 3 , that is ( p m 1 , 3 ) = 1 . In such cases, the quotient group is equal to the trivial group, i.e., Γ * ( m ) Γ * ( m ) 3 = 1 , and hence, we obtain σ ( β ) = γ . This means that γ exists in the orbit of β under the action of Aut ( G R ( p 2 , m ) ) on Γ * ( m ) . However, since ( p m 1 , 3 ) = 1 and Aut ( G R ( p 2 , m ) ) is a cyclic group, the number of orbits N is
N = 1 m i = 0 m 1 ( p i 1 , 1 ) = 1 .
Then, the orbit of β is o ( β ) = Γ * ( m ) . Thus, whenever, ( p m 1 , 3 ) = 1 , there is one and only class of such rings. This class is represented by
G R ( p 2 , m ) [ u ] u 3 p , p u 2 .
If ( p m 1 , 3 ) = 3 , thus the order of the quotient group Γ * ( m ) Γ * ( m ) 3 is 3 , which means it is a cyclic group of order 3 . However, for every element of Γ * ( m ) Γ * ( m ) 3 , we obtain a new class of chain rings associated with this element. In conclusion, there are 3 classes of such rings when ( p m 1 , 3 ) = 3 . In summary, for Case a, the total number of chain rings with such properties is
N ( p , n = 2 , m , 3 ) = 3 , if p 1 ( mod 3 ) , 1 , if p 1 ( mod 3 ) .
Case b. If p = 3 . We observe that ( p m 1 , 3 ) = 1 , and thus, there is an element γ of Γ * ( m ) such that β = γ 3 . With this in mind, the relation in Equation (16) after replacing u by γ 1 u becomes
u 3 = p h ,
where h = 1 + β u H ( R ) and β Γ ( m ) . To classify these rings, let R and T be two chain rings with such properties, and assume they have u 3 = p h and v 3 = p h 1 , , respectively. Suppose R T and φ is the isomorphism. There are δ Γ * ( m ) and h 0 H ( T ) such that ϕ ( u ) = δ h 0 v . Note that
p ( 1 + σ ( β ) δ h 0 v ) = p ϕ ( 1 + β u ) = p φ ( h ) = φ ( u 3 ) = ( φ ( u ) ) 3 = ( δ h 0 v ) 3 = p δ 3 h 0 3 h 1 ,
where σ is the reduction of φ on G R ( p 2 , m ) . As above, we may take p h 0 3 = p . Let h 1 = 1 + β 1 v , where β 1 Γ ( m ) , then by comparison, we obtain
δ 3 = 1 and σ ( β ) = δ 3 β 1 .
Thus, σ ( β ) = β 1 . Let Aut ( G R ( p 2 , m ) ) act on Γ * ( m ) , and thus, we have
N = 1 m i = 0 m 1 [ ( p i 1 , p m 1 ) + 1 ] = 1 m i = 0 m 1 p ( i , m ) ,
where ( p i 1 , p m 1 ) + 1 is the number of elements of Γ * ( m ) fixed by ρ i and 0 i m 1 ; noting that ( p i 1 , p m 1 ) + 1 = p ( i , m ) . In conclusion, when p = 3 , there are 1 m i = 0 m 1 p ( i , m ) of such rings. □
Remark 1.
It is worthy noting that when ( p m 1 , 3 ) = 1 , then R = G R ( p 2 , m ) [ u ] u 3 p β , p u 2 G R ( p 2 , m ) [ u ] u 3 p , p u 2 if we take φ to be a correspondence that sends u β 1 u , where β 1 = β 1 3 . So,
φ : ( x + u y + u 2 z ) ( x + β 1 u y + ( β 1 u ) 2 z )
is indeed the desired isomorphism.
Example 2.
Let us assume that m = 1 , then, by Equation (21), there are 3 classes of chain rings with invariants p = 3 , n = 2 , m = 1 , k = 2 . These ring are listed as
Z 9 [ u ] u 3 3 , 3 u 2 , Z 9 [ u ] u 3 3 3 u , 3 u 2 , Z 9 [ u ] u 3 3 + 3 u , 3 u 2 .
Theorem 3.
Every chain ring of order p 5 m and n = 2 , i p = 4 is uniquely isomorphic to
G R ( p 2 , m ) [ u ] u 4 p β , p u .
Proof. 
By the order of R , we must then obtain p u = 0 . Furthermore, u 4 = p β , where β Γ * ( m ) . Furthermore, the order of R shows that k = 3 , which implies that
G R ( p 2 , m ) [ u ] u 4 p β , p u .
Moreover, we have
J = u G R ( p 2 , m ) + J 2 , J 2 = u 2 G R ( p 2 , m ) + J 3 , J 3 = u 3 F p m + J 4 , J 4 = p F p m , J 5 = 0 .
As for existence, one can check easily that the latter ring is, in fact, a chain ring of order p 5 m of the type under consideration. In order to enumerate these rings up to isomorphism, let R and T be chain rings with the same invariants p , n = 2 , m , k = 3 and with u 4 = p β and v 4 = p γ , respectively. If we set φ as the isomorphism between R and T with φ ( u ) = δ h v , where δ Γ * ( m ) and h H ( T ) . Thus, similar to the above discussion, we obtain
σ ( β ) = δ 4 γ .
We first fix p 2 . The latter relation can be read as σ ( β ) γ 1 Γ * ( m ) Γ * ( m ) 4 . The order of this quotient group determines the number of classes of chain rings with these properties. In fact, if ( p m 1 , 4 ) = 2 , then, by a similar approach to that of proof of Theorem 2, there are 2 N 0 , where
N 0 = 1 m i = 0 m 1 ( p i 1 , 2 ) .
Since for i 1 , we obtain ( p m 1 , 2 ) = 2 , and then
N 0 = 2 m 1 m .
While if ( p m 1 , 4 ) = 4 , thus, there are 4 N 0 of such classes, where N is
N 0 = 1 m i = 0 m 1 ( p i 1 , 4 ) .
Finally, if p = 2 , hence ( 2 m 1 , 4 ) = 1 , and thus, 1 m i = 0 m 1 ( p i 1 , 1 ) = 1 , it follows that there is a unique non-isomorphic class of these rings. To summarize, we have N of these rings in total, where
N = 2 ( 2 m 1 ) m , if p m 3 ( mod 4 ) , 4 m i = 0 m 1 ( p i 1 , 4 ) , if p m 1 ( mod 4 ) , ( p 2 ) 1 ,   if p = 2 .
Example 3.
Suppose m = 1 . Thus, if we want to enumerate all chain rings having p , n = 2 , m = 1 , k = 3 , by Equation (27), we obtain
N = 2 , if p 3 ( mod 4 ) , 4 , if p 1 ( mod 4 ) , ( p 2 ) 1 ,   if p = 2 .
In the following, we show, by a different approach, the exact number of non-isomorphic classes of rings having a structure as in Theorem 3 when p > 2 .
Definition 1.
Let p be a fixed prime and let c be any positive integer. If ( c , p ) = 1 , we define τ ( c ) to be the order of p in the group of units U ( c ) of the ring of integers modulo c . If c = 1 , we set τ ( c ) = 1 . It is known that the order of U ( c ) is ϕ ( c ) , where ϕ denotes the Euler ϕ-function. Therefore, τ ( c ) divides ϕ ( c ) .
Theorem 4.
Let p 2 and d = ( 4 , p m 1 ) . Then, there are exactly
c | d ϕ ( c ) τ ( c ) .
as many isomorphism classes of chain rings with invariants p , 2 , m , 5 , 3 .
Proof. 
Let Γ * ( m ) denote the group of nonzero elements of F p m . For Γ * ( m ) , we define β γ if there exists δ and σ A u t ( R 0 ) such that
σ ( β ) = β p i = δ 4 γ .
has a solution in Γ * ( m ) for some 0 < i < m . Thus, it is sufficient to show that the number of equivalence classes is given by Formula (28) above. As is well known, Γ * ( m ) is cyclic of order q = p m 1 . Let α be a generator for Γ * ( m ) . It is straightforward to observe that an element in Γ * ( m ) has a 4th root if and only if it is in the subgroup G generated by α d , where f = ( 4 , p m 1 ) . This leads to the conclusion that β γ if and only if β p t G = γ G for some 1 < t < m .
To simplify the notation, we can replace Γ * ( m ) with the additive group Z p m 1 of integers modulo p m 1 . Thus, based on the previous notations, the equivalence relation can be rewritten as j i if and only if j p t i mod d for some 0 < t < m . Let s [ i ] denote the equivalence class of i , and let f = f Z q . Then, we have
s [ i ] = l = 0 m 1 i p l + f .
Let ( i , d ) = e , c = f e , and τ ( c ) = t . Then,
s [ i ] = l = 0 t 1 i p l + f .
The union in the equation above can be seen to be a disjoint union. Since f has q f elements, we conclude that s [ i ] has τ ( c ) q f elements. For j s [ i ] , we have ( i , f ) = e if and only if ( j , f ) = e . Thus, if we let ( e ) denote those j Z q with ( j , f ) = e , then ( e ) forms a union of equivalence classes, each having τ ( c ) q f elements. Conversely, ( e ) contains τ ( c ) q f elements, so it is clear that ( e ) is a union of ϕ ( c ) τ ( c ) equivalence classes. As e varies over the divisors of f, so does c = f e and vice versa. Consequently, Equation (28) provides the total number of classes as required. □
Remark 2.
It is well known that
c | d ϕ ( c ) = d .
So,
c | d ϕ ( c ) τ ( c ) d .
The equality holds if and only if τ ( c ) = 1 for all c, which occurs precisely when d | ( p 1 ) .
Remark 3.
Every finite chain ring with ( k + 1 , p ) = 1 has an associated formula of the form u k + 1 = p β . To show this, let R be any finite chain ring. In the notation of 1.5, we have R = R 0 [ u ] where u k + 1 = p y , where y = a 0 + a 1 u + + a k u k with a i R 0 , and a 0 being a unit in R 0 . We can express y = a 0 ( 1 + u ) , where u u = J . Then, w = 1 + u lies in the subgroup 1 + J = H of the group of units of R . Since J is an additive p-group, H forms a multiplicative p-group. Thus, if ( k + 1 , p ) = 1 , which means that k + 1 is relatively prime to the order of H , guaranteeing that w 1 has a kth root in H; let us denote this root by v k + 1 = w 1 . Let θ = u v , then θ = p a 0 . Hence, the polynomial x k + 1 p a 0 must have a root in R , indicating that R has such a relation between u and p.
Remark 4.
We have from Theorems 3 and 4,
1 m i = 0 m 1 ( p i 1 , 4 ) = c | d ϕ ( c ) τ ( c ) .

3.3. Chain Rings of Characteristic p 3

For any chain ring with n = 3 , its prime ring is of the form G R ( p 3 , m ) . As n = 3 and l = 5 , then we must have k = 1 . Hence,
R = G R ( p 3 , m ) + u G R ( p 3 , m ) .
In this case, we have no choice but p J 2 , and thus p 2 J 4 . Multiplying explains J 3 = p u G R ( p 3 , m ) . It follows that
J = u G R ( p 3 , m ) + J 2 , J 2 = p G R ( p 3 , m ) + J 3 , J 3 = p u G R ( p 3 , m ) + J 4 , J 4 = p 2 G R ( p 3 , m ) , J 5 = 0 .
As u 2 J 2 , then u 2 = p x + p u y , for some x and y in G R ( p 3 , m ) . It is clear that x U ( G R ( p 3 , m ) ) , because otherwise u 2 would be in J 3 . If p 2 , one can complete the squares and then put y = 0 . Hence, u 2 = p β h , where β Γ * ( m ) and h H . Furthermore, we have p 2 u = 0 as R = p 5 m . Note that p u 2 0 , else J 4 = 0 .
Theorem 5.
Every chain ring of order p 5 m and characteristic p 3 is uniquely isomorphic to
G R ( p 3 , m ) [ u ] u 2 p β h , p 2 u .
Proof. 
First, we assume p 2 . Using the above discussion, we conclude that
u 2 = p β h and p 2 u = 0 .
Therefore,
R G R ( p 3 , m ) [ u ] u 2 p β h , p 2 u .
One can check, as customary, that this quotient is in fact a ring of the right type. Now, we classify these rings up to isomorphism with invariants p , n = 3 , m , k = 1 . Since p 2 , then ( p , 2 ) = 1 , and therefore the relation in (35) will be
u 2 = p β and p 2 u = 0 .
By the latter equation, our rings are classified by the image of β under the reduction Γ * ( m ) Γ * ( m ) 2 . This means if β B , then replacing u by β u gives
R G R ( p 3 , m ) [ u ] u 2 p , p 2 u .
While if β A , then we obtain
R G R ( p 3 , m ) [ u ] u 2 p α , p 2 u .
These rings are different, and we only have G R ( p 3 , m ) [ u ] u 2 p α , p 2 u G R ( p 3 , m ) [ u ] u 2 p , p 2 u if p = 2 . Now, let p = 2 , then the relation between the generators is u 2 = 2 β 1 + 2 u β 2 , where β 1 Γ * ( m ) and β 2 Γ ( m ) . Since β 1 B because ( 2 m 1 , 2 ) = 1 , then we may write the relation by u 2 = p + p u γ , where γ Γ Γ ( m ) . If γ = 0 , then we have 1 ring that is
R G R ( 8 , m ) [ u ] u 2 2 , 4 u .
We assume γ = β 0 ,
u 2 = 2 + 2 u β .
A similar argument of Theorem 2 might be applied here and it gives,
N = 1 m i = 0 m 1 2 ( i , m ) .
In summary, there are 2 rings when p 2 and for p = 2 there are N + 1 of such rings. □
Example 4.
Suppose m = 1 , then if p = 2 , we obtain N = 2 by Equation (37). Thus, there are 3 rings with invariants p = 2 , n = 3 , m = 1 , k = 1 , namely
Z 8 [ u ] u 2 2 , 4 u , Z 8 [ u ] u 3 2 2 u , 4 u , Z 9 [ u ] u 3 2 + 2 u , 4 u .

3.4. Chain Rings of Characteristic p 5

We investigate the case when n = 5 . So, n = l = 5 , and hence, R 0 = G R ( p 5 , m ) the prime subring. Since, R and R 0 have the same order, thus
R = R 0 = G R ( p 5 , m ) .
These rings are uniquely determined up to isomorphism with their invariants p , n , m . Moreover,
J = p G R ( p 3 , m ) + J 2 , J 2 = p 2 G R ( p 3 , m ) + J 3 , J 3 = p 3 G R ( p 3 , m ) + J 4 , J 4 = p 4 G R ( p 3 , m ) , J 5 = 0 .
Overall, every chain ring of order p 5 m and characteristic p 5 is uniquely isomorphic to G R ( p 5 , m ) . This means that there is only one class of these rings. The construction of this ring is
G R ( p n , m ) Z p n [ γ ] Z p n [ x ] g ( x ) ,
where g ( x ) is a basic irreducible polynomial over Z p n , the ring of integers modulo p n . The element γ is a root of g ( x ) . This extension is a Galois extension.
In the next example, we list all chain rings when m = 1 .
Example 5.
Let m = 1 , then we present all chain rings with invariants p , n , m = 1 , k as
F p [ u ] u 5 , Z 9 [ u ] u 3 3 , 3 u 2 , Z 9 [ u ] u 3 3 3 u , 3 u 2 , Z 9 [ u ] u 3 3 + 3 u , 3 u 2 , R * = Z p 2 [ u ] u 3 p β , p u 2 , R * = Z p 2 [ u ] u 4 p β , p u , Z p 3 [ u ] u 2 p , p 2 u , Z p 3 [ u ] u 2 p α , p 2 u , Z 8 [ u ] u 2 2 , 4 u , Z 8 [ u ] u 3 2 2 u , 4 u , Z 8 [ u ] u 3 2 + 2 u , 4 u , Z p 5 .
Note that * means that there is more than one type of such ring according to certain conditions. Furthermore, their number is
N = 1 , ( n = 1 ) 3 , if p 1 ( mod 3 ) , 1 , if p 1 ( mod 3 ) , ( p 3 ) 3 , if p = 3 ( i p = 3 ) 2 , if p 3 ( mod 4 ) , 4 , if p 1 ( mod 4 ) , ( p 2 ) 1 , if p = 2 . ( i p = 4 ) ( n = 2 ) 2 , if p 2 , 3 , if p = 2 , ( n = 3 ) 1 . ( n = 5 )
This completes the classification of all chain rings of length 5 and of order p 5 m . Hence, all chain rings of order p 5 m and length 5 are classified in Table 1.

4. Conclusions

In conclusion, the study of local rings characterized by the parameters p , n , m , l , and k is vital to advancing coding theory. This article focused specifically on local rings of length 5, wherein, we systematically identified and classified these structures up to isomorphism, emphasizing their invariants. Notably, we organized the chain rings into a comprehensive table (Table 1) based on their parameters, thereby enhancing our understanding of their properties. Furthermore, we compiled a detailed list of all chain rings for the case where m = 1 , contributing valuable insights to this intriguing area of research. It is important to emphasize that as the number k increases, the classification and structural difficulty of the associated rings also increase significantly. When the index of nilpotency exceeds 5 , we believe that our existing tools may not suffice for classifying such rings, which indicates a need for the development of new techniques.

Author Contributions

Conceptualization, A.A.A. and S.A.; methodology, A.A.A. and S.A.; formal analysis, A.A.A., S.A. and N.A.A.; investigation, A.A.A. and S.A.; writing—original draft, S.A. and N.A.A.; writing-review and editing, S.A., A.A.A. and N.A.A. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported by the Researchers Supporting Project number (RSPD2024R871), King Saud University, Riyadh, Saudi Arabia.

Data Availability Statement

No new data were created or analyzed in this study.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Alabiad, S.; Alkhamees, Y. On classification of finite commutative chain rings. AIMS Math. 2021, 7, 1742–1757. [Google Scholar] [CrossRef]
  2. Whelan, E.A. A note of finite local rings. Rocky Mt. J. Math. 1992, 22, 757–759. [Google Scholar] [CrossRef]
  3. Kuzmina, A.S.; Maltsev, Y.N. Finite rings with regular nilpotent graphs. Sib. Èlektron. Mat. Izv. 2015, 12, 810–817. [Google Scholar]
  4. Krull, W. Algebraische Theorie der Ringe II. Math. Ann. 1924, 91, 1–46. [Google Scholar] [CrossRef]
  5. Norton, G.; Salagean, A. On the structure of linear cyclic codes over finite chain rings. Appl. Algebra Eng. Commun. Comput. 2000, 10, 489–506. [Google Scholar] [CrossRef]
  6. Alabiad, S.; Alhomaidhi, A.A.; Alsarori, N.A. On linear codes over finite singleton local rings. Mathematics 2024, 12, 1099. [Google Scholar] [CrossRef]
  7. Alabiad, S.; Alhomaidhi, A.A.; Alsarori, N.A. MacWilliams identities and generator matrices for linear codes over Z p 4 [ u ] u 2 p 3 β , p u . Axioms 2024, 13, 552. [Google Scholar] [CrossRef]
  8. Dougherty, S.T.; Saltürk, E.; Szabo, S. On codes over Frobenius rings: Generating characters, MacWilliams identities and generator matrices. Appl. Algebra Eng. Commun. Comput. 2019, 30, 193–206. [Google Scholar] [CrossRef]
  9. Honold, T. Characterization of finite Frobenius rings. Arch. Math. 2001, 76, 406–415. [Google Scholar] [CrossRef]
  10. Alabiad, S.; Alhomaidhi, A.A.; Alsarori, N.A. On linear codes over local rings of order p4. Mathematics 2024, 12, 3069. [Google Scholar] [CrossRef]
  11. Gassner, N.; Greferath, M.; Rosenthal, J.; Weger, V. Bounds for Coding Theory over Rings. Entropy 2022, 24, 1473. [Google Scholar] [CrossRef] [PubMed]
  12. Alfarano, G.N.; Gruica, A.; Lieb, J.; Rosenthal, J. Convolutional codes over finite chain rings, MDP codes and their characterization. Adv. Math. Commun. 2023, 17, 1–22. [Google Scholar]
  13. Wood, J.A. Duality for modules over finite rings and applications to coding theory. Am. J. Math. 1999, 121, 555–575. [Google Scholar] [CrossRef]
  14. Raghavendran, R. Finite associative rings. Compos. Math. 1969, 21, 195–229. [Google Scholar]
  15. Corbas, B.; Williams, G. Rings of order p5 Part II. Local Rings J. Algebra 2000, 231, 691–704. [Google Scholar] [CrossRef]
  16. Ayoub, C. On the group of units of certain rings. J. Number Theory 1972, 4, 383–403. [Google Scholar] [CrossRef]
  17. Wilson, R. Representations of finite rings. Pacific J. Math. 1974, 53, 643–649. [Google Scholar] [CrossRef]
  18. McDonald, B.R. Finite Rings with Identity; Marcel Dekker: New York, NY, USA, 1974. [Google Scholar]
  19. Zariski, O.; Samuel, P. Commutative Algebra; Springer: New York, NY, USA, 1960; Volume II. [Google Scholar]
  20. Matsumura, H. Commutative Ring Theory; Cambridge University Press: Cambridge, UK, 1986. [Google Scholar]
Table 1. Numbers of chain rings of length 5 and of order p 5 m .
Table 1. Numbers of chain rings of length 5 and of order p 5 m .
Char (R) = p n Number of Non-Isomorphic Classes
n = 1 1
n = 2 and i p = 3
3 , if p 1 ( mod 3 ) , 1 , if p 1 ( mod 3 ) , ( p 3 ) , 1 m i = 0 m 1 3 ( i , m ) , if p = 3
n = 2 and i p = 4
2 ( 2 m 1 ) m , if p m 3 ( mod 4 ) , 4 m i = 0 m 1 ( p i 1 , 4 ) , if p m 1 ( mod 4 ) , ( p 2 ) , 1 , if p = 2
n = 3
2 , if p 2 , 1 m i = 0 m 1 2 ( i , m ) , if p = 2
 
n = 4 0
n = 5 1
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.

Share and Cite

MDPI and ACS Style

Alhomaidhi, A.A.; Alabiad, S.; Alsarori, N.A. Commutative Chain Rings with Index of Nilpotency 5 and Residue Field Fpm. Axioms 2024, 13, 877. https://doi.org/10.3390/axioms13120877

AMA Style

Alhomaidhi AA, Alabiad S, Alsarori NA. Commutative Chain Rings with Index of Nilpotency 5 and Residue Field Fpm. Axioms. 2024; 13(12):877. https://doi.org/10.3390/axioms13120877

Chicago/Turabian Style

Alhomaidhi, Alhanouf Ali, Sami Alabiad, and Nawal A. Alsarori. 2024. "Commutative Chain Rings with Index of Nilpotency 5 and Residue Field Fpm" Axioms 13, no. 12: 877. https://doi.org/10.3390/axioms13120877

APA Style

Alhomaidhi, A. A., Alabiad, S., & Alsarori, N. A. (2024). Commutative Chain Rings with Index of Nilpotency 5 and Residue Field Fpm. Axioms, 13(12), 877. https://doi.org/10.3390/axioms13120877

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop