scholarly journals Recapturing the Structure of Group of Units of Any Finite Commutative Chain Ring

Symmetry ◽  
2021 ◽  
Vol 13 (2) ◽  
pp. 307
Author(s):  
Sami Alabiad ◽  
Yousef Alkhamees

A finite ring with an identity whose lattice of ideals forms a unique chain is called a finite chain ring. Let R be a commutative chain ring with invariants p,n,r,k,m. It is known that R is an Eisenstein extension of degree k of a Galois ring S=GR(pn,r). If p−1 does not divide k, the structure of the unit group U(R) is known. The case (p−1)∣k was partially considered by M. Luis (1991) by providing counterexamples demonstrated that the results of Ayoub failed to capture the direct decomposition of U(R). In this article, we manage to determine the structure of U(R) when (p−1)∣k by fixing Ayoub’s approach. We also sharpen our results by introducing a system of generators for the unit group and enumerating the generators of the same order.

Symmetry ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 681
Author(s):  
Sami Alabiad ◽  
Yousef Alkhamees

A finite ring with an identity is a chain ring if its lattice of left ideals forms a unique chain. Let R be a finite chain ring with invaraints p,n,r,k,k′,m. If n=1, the automorphism group Aut(R) of R is known. The main purpose of this article is to study the structure of Aut(R) when n>1. First, we prove that Aut(R) is determined by the automorphism group of a certain commutative chain subring. Then we use this fact to find the automorphism group of R when p∤k. In addition, Aut(R) is investigated under a more general condition; that is, R is very pure and p need not divide k. Based on the j-diagram introduced by Ayoub, we were able to give the automorphism group in terms of a particular group of matrices. The structure of the automorphism group of a finite chain ring depends essentially on its invaraints and the associated j-diagram.


2001 ◽  
Vol 64 (3) ◽  
pp. 505-528 ◽  
Author(s):  
Graham H. Norton ◽  
Ana Sǎlǎgean

Gröbner bases have been generalised to polynomials over a commutative ring A in several ways. Here we focus on strong Gröbner bases, also known as D-bases. Several authors have shown that strong Gröbner bases can be effectively constructed over a principal ideal domain. We show that this extends to any principal ideal ring. We characterise Gröbner bases and strong Gröbner bases when A is a principal ideal ring. We also give algorithms for computing Gröbner bases and strong Gröbner bases which generalise known algorithms to principal ideal rings. In particular, we give an algorithm for computing a strong Gröbner basis over a finite-chain ring, for example a Galois ring.


2007 ◽  
Vol 45 (2) ◽  
pp. 219-227 ◽  
Author(s):  
E. Martínez-Moro ◽  
I. F. Rúa

2014 ◽  
Vol 60 (10) ◽  
pp. 5899-5917 ◽  
Author(s):  
Chen Feng ◽  
Roberto W. Nobrega ◽  
Frank R. Kschischang ◽  
Danilo Silva

2016 ◽  
Vol 93 (3) ◽  
pp. 353-363 ◽  
Author(s):  
BORWORN SUNTORNPOCH ◽  
YOTSANAN MEEMARK

We extend spectral graph theory from the integral circulant graphs with prime power order to a Cayley graph over a finite chain ring and determine the spectrum and energy of such graphs. Moreover, we apply the results to obtain the energy of some gcd-graphs on a quotient ring of a unique factorisation domain.


2019 ◽  
Vol 19 (06) ◽  
pp. 2050103 ◽  
Author(s):  
Yonglin Cao ◽  
Yuan Cao ◽  
Hai Q. Dinh ◽  
Fang-Wei Fu ◽  
Jian Gao ◽  
...  

Let [Formula: see text] be a finite field of cardinality [Formula: see text], where [Formula: see text] is an odd prime, [Formula: see text] be positive integers satisfying [Formula: see text], and denote [Formula: see text], where [Formula: see text] is an irreducible polynomial in [Formula: see text]. In this note, for any fixed invertible element [Formula: see text], we present all distinct linear codes [Formula: see text] over [Formula: see text] of length [Formula: see text] satisfying the condition: [Formula: see text] for all [Formula: see text]. This conclusion can be used to determine the structure of [Formula: see text]-constacyclic codes over the finite chain ring [Formula: see text] of length [Formula: see text] for any positive integer [Formula: see text] satisfying [Formula: see text].


Sign in / Sign up

Export Citation Format

Share Document