Homomorphic images of subdirectly irreducible rings

We prove that every ring is a proper homomorphic image of some subdirectly irreducible ring. We also show that a finite ring R does not need to be isomorphic to the factor of a subdirectly irreducible ring by its monolith as well as R does not need to be a homomorphic image of a finite subdirectly irreducible ring. We provide an analogous characterization also for varieties of rings with unity, for the quasiregular rings, for the rings with involution and for their subvarieties of commutative rings.     

Sums of units in function fields

Let R be the ring of S-integers of an algebraic function field (in one variable) over a perfect field, where S is finite and not empty. It is shown that for every positive integer N there exist elements of R that can not be written as a sum of at most N units. Moreover, all quadratic global function fields whose rings of integers are generated by their units are determined.     

Clones of implicit operations

There is a close connection between a variety and its clone. The clone of a variety is a multibased algebra, where the different universes are the sets of n-ary terms over this variety for every natural number n and where the operations describe the superposition of terms of different arities. All projections are added as nullary operations. Subvarieties correspond to homomorphic images of clones. Subclones can be described by reducts of varieties, isomorphic clones by equivalent varieties. Clone identities correspond to hyperidentities and varieties of clones to hypervarieties. Pseudovarieties are classes of finite algebras which are closed under taking of subalgebras, homomorphic images and finite direct products. Pseudovarieties are important in the theories of finite state automata, rational languages, finite semigroups and their connections. In a very natural way, there arises the question for the clone of a pseudovariety. In the present paper, we will describe this algebraic structure. Received April 6, 2004; accepted in final form March 28, 2005.     

Two-Channel Perfect Reconstruction FIR Filter Banks over Commutative Rings

The relation between ladder and lattice implementations of two-channel filter banks is discussed and it is shown that these two concepts differ in general. An elementary proof is given for the fact that over any integral domain which is not a field there exist causal realizable perfect reconstructing filter banks that cannot be implemented with causal lifting filters. A complete parametrization of filter banks with coefficients in local rings and semiperfect rings is given.     

Graded prime Goldie rings

Prime Goldie rings graded by a group are studied. It is proved that there exists a completely gr-reducible graded ring of fractions in the case of a grading group with a finite commutator subgroup (which enhances the results of Goodearl–Stafford obtained for Abelian groups). An example where such ring does not exist is constructed (a counterexample for a semi-prime ring was already known).     

Rings and constructions of partial difference sets

We present three constructions of partial difference sets (PDS) using different types of finite local rings. The first construction uses homomorphic images of finite Frobenius local rings and generalizes a previous result by the author. The second construction uses finite Frobenius local rings. The third construction uses finite (noncommutative) chain rings and generalizes a recent construction of partial difference sets by Leung and Ma. The three constructions provide many new PDS in nonelementary abelian groups.     

Perfect state transfer in unitary Cayley graphs and gcd-graphs

In this work, we consider the problem on the existence of perfect state transfer in unitary Cayley graphs and gcd-graphs over finite commutative rings. We characterize all finite commutative rings allowing perfect transfer to occur on their unitary Cayley graphs. Also, we use our main result to study perfect state transfer in unitary Cayley signed graphs and some gcd-graphs on quotient rings of unique factorization domains. Moreover, we can apply some calculations on the eigenvalues to determine the existence of perfect state transfer in Cayley graphs over finite chain rings.     

关于除环的伪理想

M.K.Sen于1976年推广环的理想概念,定义了伪理想,并用依理想来研究除环、域和正则环。侯国荣1983年又推广伪理想,建立n—伪理想,得到了更好的结果。本文则证明了:非交换除环和有限域无真伪理想,因而文关于除环的几乎全部结果都是平凡的。我们还证明了非交换除环无真n—伪理想,给出了有限域无真n—伪理想的充分必要条件。文中讨论了无限域的伪理想,得到了关于除环结构的几个有用结果。     

Invariants of finite Hopf algebras

This paper extends classical results in the invariant theory of finite groups and finite group schemes to the actions of finite Hopf algebras on commutative rings. Topics considered include integrality over the invariant rings, properties of the canonical map between the prime spectra, orbital and stabilizer algebras, projectivity over the invariant rings, and descent of Cohen-Macaulayness.     

Galois环和Z/(m)环上完全非线性函数的性质

本文把完全非线性函数推广到了有限Abel群上,利用特征谱讨论了Z/(m)上Bent函数与GF(pe)上bent函数以及完全非线性函数定义之间的关系;给出Galois环与Z/(m)上最佳线性逼近的特征谱表示,得到完全非线性函数在某种程度上能抵抗最佳线性逼近攻击的结论;并给出一种Galois环与Z/(m)环上完全非线性函数的构结方法.     

Self-dual codes over commutative Frobenius rings

We prove that self-dual codes exist over all finite commutative Frobenius rings, via their decomposition by the Chinese Remainder Theorem into local rings. We construct non-free self-dual codes under some conditions, using self-dual codes over finite fields, and we also construct free self-dual codes by lifting elements from the base finite field. We generalize the building-up construction for finite commutative Frobenius rings, showing that all self-dual codes with minimum weight greater than 2 can be obtained in this manner in cases where the construction applies.     

Identities of PI-Algebras Graded by a Finite Abelian Group

We consider associative PI-algebras over an algebraically closed field of zero characteristic graded by a finite abelian group G. It is proved that in this case the ideal of graded identities of a G-graded finitely generated PI-algebra coincides with the ideal of graded identities of some finite dimensional G-graded algebra. This implies that the ideal of G-graded identities of any (not necessary finitely generated) G-graded PI-algebra coincides with the ideal of G-graded identities of the Grassmann envelope of a finite dimensional (G × ?₂)-graded algebra, and is finitely generated as GT-ideal. Similar results take place for ideals of identities with automorphisms.     

Almost perfect commutative rings

Almost perfect commutative rings R are introduced (as an analogue of Bazzoni and Salce's almost perfect domains) for rings with divisors of zero: they are defined as orders in commutative perfect rings such that the factor rings $R/Rr$ are perfect rings (in the sense of Bass) for all non-zero-divisors$r\in R$. It is shown that an almost perfect ring is an extension of a T-nilpotent ideal by a subdirect product of a finite number of almost perfect domains. Noetherian almost perfect rings are exactly the one-dimensional Cohen–Macaulay rings. Several characterizations of almost perfect domains carry over practically without change to almost perfect rings. Examples of almost perfect rings with zero-divisors are abundant.     

An explication of secret sharing schemes

This paper is an explication of secret sharing schemes, emphasizing combinatorial construction methods. The main problem we consider is the construction of perfect secret sharing schemes, for specified access structures, with the maximum possible information rate.In this paper, we present numerous direct constructions for secret sharing schemes, such as the Shamir threshold scheme, the Boolean circuit construction of Benaloh and Leichter (for general access structures), the vector space construction of Brickell, and the Simmons geometric construction. We discuss the connections between ideal schemes (i.e., those with information rate equal to one) and matroids. We also mention the entropy bounds of Capocelli et al. Then we give a very general construciton, called the decomposition construction, and numerous applications of it. In particular, we study schemes for access structures based on graphs and the many interesting bounds that can be proved; and we determine the exact value of the optimal information rate for all access structures on at most four participants.Research supported by NSERC (Canada) grant A9287.     

On Hopfian Rings

The main results proved in this paper are:(i) If R is a boolean hopfian ring then the polynomial ring R[T] is hopfian.(ii) Let R and S be hopfian rings. Suppose the only central idempotents in S are 0 and 1 and that S is not a homomorphic image of R. Then R × S is a hopfian ring.     

On finite completely simple semigroups having no finite basis of identities

The purpose of this note is to provide a correct proof of the fact that there exist finite completely simple semigroups having no finite basis of identities.     

On self-dual cyclic codes over finite chain rings

In this paper, we give necessary and sufficient conditions for the existence of non-trivial cyclic self-dual codes over finite chain rings. We prove that there are no free cyclic self-dual codes over finite chain rings with odd characteristic. It is also proven that a self-dual code over a finite chain ring cannot be the lift of a binary cyclic self-dual code. The number of cyclic self-dual codes over chain rings is also investigated as an extension of the number of cyclic self-dual codes over finite fields given recently by Jia et al.     

Groups Whose Finite Homomorphic Images are Metahamiltonian

A group G is metahamiltonian if all its non-abelian subgroups are normal. It is proved here that a finitely generated soluble group is metahamiltonian if and only if all its finite homomorphic images are metahamiltonian; the behaviour of soluble minimax groups with metahamiltonian finite homomorphic images is also investigated. Moreover, groups satisfying the minimal condition on non-metahamiltonian subgroups are described.     

Algebraic complexities and algebraic curves over finite fields

Algebraic schemes of computation of bilinear forms over various rings of scalars are examined. The problem of minimal complexity of these schemes is considered for computation of polynomial multiplication and multiplication in commutative algebras, and finite extensions of fields. While for infinite fields minimal complexities are known (Winograd, Fiduccia, Strassen), for finite fields precise minimal complexities are not yet determined. We prove lower and upper bounds on minimal complexities. Both are linear in the number of inputs. These results are obtained using the relationship with linear coding theory and the theory of algebraic curves over finite fields.