Exponential sum estimates over a subgroup in an arbitrary finite field

Let F _q be the finite field consisting of q = p ^r elements and yy an additive character of the field F _q . Take an arbitrary multiplicative subgroup H of size |H| > q ^{C/(log log q)} for some constant C > 0 not largely contained in any multiplicative shift of a subfield. We show that |Σ _h∈H yy(h)| = o(|H|). This means that H is equidistributed in F _q .     

Polynomial orbits in finite commutative rings

Let R be a finite commutative ring with unity. We determine the set of all possible cycle lengths in the ring of polynomials with rational integral coefficients.     

Involutory matrices over finite commutative rings

An n × n matrix A is called involutory iff A²=I_n, where I_n is the n × n identity matrix. This paper is concerned with involutory matrices over an arbitrary finite commutative ring R with identity and with the similarity relation among such matrices. In particular the authors seek a canonical set $\text{C}$ with respect to similarity for the n × n involutory matrices over R—i.e., a set $\text{C}$ of n × n involutory matrices over R with the property that each n × n involutory matrix over R is similar to exactly on matrix in $\text{C}$. Because of the structure of finite commutative rings and because of previous research, they are able to restrict their attention to finite local rings of characteristic a power of 2, and although their main result does not completely specify a canonical set $\text{C}$ for such a ring, it does solve the problem for a special class of rings and shows that a solution to the general case necessarily contains a solution to the classically unsolved problem of simultaneously bringing a sequence A₁,…,A_v of (not necessarily involutory) matrices over a finite field of characteristic 2 to canonical form (using the same similarity transformation on each A_i). (More generally, the authors observe that a theory of similarity fot matrices over an arbitrary local ring, such as the well-known rational canonical theory for matrices over a field, necessarily implies a solution to the simultaneous canonical form problem for matrices over a field.) In a final section they apply their results to find a canonical set for the involutory matrices over the ring of integers modulo 2^m and using this canonical set they are able to obtain a formula for the number of n × n involutory matrices over this ring.     

Diophantine properties of finite commutative rings

 Simple observations on diophantine definability over finite commutative rings lead to a characterization of those rings in terms of their diophantine behavior. Received: 28 March 2001 / Published online: 12 July 2002 Mathematics Subject Classification (2000): 13M10, 11T06, 03G99     

Constacyclic codes over finite commutative semi-simple rings

Finite commutative semi-simple rings are direct sum of finite fields. In this study, we investigate the algebraic structure of λ-constacyclic codes over such finite semi-simple rings. Among others, necessary and sufficient conditions for the existence of self-dual, LCD, and Hermitian dual-containing λ-constacyclic codes over finite semi-simple rings are provided. Using the CSS and Hermitian constructions, quantum MDS codes over finite semi-simple rings are constructed.     

Eigenvalues of zero-divisor graphs of finite commutative rings

Journal of Algebraic Combinatorics - We investigate eigenvalues of the zero-divisor graph $$\Gamma (R)$$ of finite commutative rings R and study the interplay between these eigenvalues, the...     

Matrix product codes over finite commutative Frobenius rings

Properties of matrix product codes over finite commutative Frobenius rings are investigated. The minimum distance of matrix product codes constructed with several types of matrices is bounded in different ways. The duals of matrix product codes are also explicitly described in terms of matrix product codes.     

Additive cyclic codes over finite commutative chain rings

Additive cyclic codes over Galois rings were investigated in Cao et al. (2015). In this paper, we investigate the same problem but over a more general ring family, finite commutative chain rings. When we focus on non-Galois finite commutative chain rings, we observe two different kinds of additivity. One of them is a natural generalization of the study in Cao et al. (2015), whereas the other one has some unusual properties especially while constructing dual codes. We interpret the reasons of such properties and illustrate our results giving concrete examples.     

Determinants of matrices over commutative finite principal ideal rings

In this paper, the determinants of $n\times n$ matrices over commutative finite chain rings and over commutative finite principal ideal rings are studied. The number of $n\times n$ matrices over a commutative finite chain ring R of a fixed determinant a is determined for all $a\in R$ and positive integers n. Using the fact that every commutative finite principal ideal ring is a product of commutative finite chain rings, the number of $n\times n$ matrices of a fixed determinant over a commutative finite principal ideal ring is shown to be multiplicative, and hence, it can be determined. These results generalize the case of matrices over the ring of integers modulo m.     

Notes on linear codes over finite commutative chain rings

The properties of the generator matrix are given for linear codes over finite commutative chain rings,and the so-called almost-MDS (AMDS) codes are studied.     

Polynomial functions and permutation polynomials over some finite commutative rings

We extend some classical results on polynomial functions . We prove all results in algebraic methods avoiding any combinatorial calculation. As applications of our methods, we obtain some interesting new results on permutation polynomials in several variables over some finite commutative rings.     

On 2-absorbing commutative semigroups and their applications to rings

A commutative ring R is called 2-absorbing (Badawi in Bull. Aust. Math. Soc. 75:417–429, 2007) if for arbitrary elements a,b,c∈R, abc=0 if and only if ab=0 or bc=0 or ac=0. In this paper we study this concept in a more general framework of commutative (multiplicative) semigroups with 0. The results obtained apply to many ring theoretic situations and make it possible to describe similarities and differences among some variants of the notion. We pay a particular attention to graded rings. We also show that a conjecture from (Anderson and Badawi in Commun. Algebra 39:1646–1672, 2011) concerning n-absorbing rings holds for rings with torsion-free additive groups.     

Weakly central-vertex complete graphs with applications to commutative rings

The zero-divisor graph of a commutative ring R is the graph whose vertices consist of the nonzero zero-divisors of R such that distinct vertices x and y are adjacent if and only if xy=0. In this paper, a decomposition theorem is provided to describe weakly central-vertex complete graphs of radius 1. This characterization is then applied to the class of zero-divisor graphs of commutative rings. For finite commutative rings whose zero-divisor graphs are not isomorphic to that of Z₄[X]/(X²), it is shown that weak central-vertex completeness is equivalent to the annihilator condition. Furthermore, a schema for describing zero-divisor graphs of radius 1 is provided.