A faster algorithm for testing polynomial representability of functions over finite integer rings

Given a function from Z(n) to itself one can determine its polynomial representability by using Kempner function. In this paper we present an alternative characterization of polynomial functions over Z(n) by constructing a generating set for the Z(n)-module of polynomial functions. This characterization results in an algorithm that is faster on average in deciding polynomial representability. We also extend the characterization to functions in several variables. (C) 2015 Elsevier B.V. All rights reserved.

Construction and decoding of BCH codes over finite commutative rings

BCH codes over arbitrary finite commutative rings with identity are derived in terms of their locator vector. The derivation is based on the factorization of xs -1 over the unit ring of an appropriate extension of the finite ring. We present an efficient decoding procedure, based on the modified Berlekamp-Massey algorithm, for these codes. The code construction and the decoding procedures are very similar to the BCH codes over finite integer rings. © 1999 Elsevier B.V. All rights reserved.

A note on units of finite local rings in an ascending chain

In this paper we present matrices over unitary finite commutative local rings connected through an ascending chain of containments, whose elements are units of the corresponding rings in the chain such that the McCoy ranks are the largest ones.

Linear codes over finite local rings in a chain

For a positive integer $t$, let \begin{equation*} \begin{array}{ccccccccc} (\mathcal{A}_{0},\mathcal{M}_{0}) & \subseteq & (\mathcal{A}_{1},\mathcal{M}_{1}) & \subseteq & & \subseteq & (\mathcal{A}_{t-1},\mathcal{M}_{t-1}) & \subseteq & (\mathcal{A},\mathcal{M}) \\ \cap & & \cap & & & & \cap & & \cap \\ (\mathcal{R}_{0},\mathcal{M}_{0}^{2}) & & (\mathcal{R}_{1},\mathcal{M}_{1}^{2}) & & & & (\mathcal{R}_{t-1},\mathcal{M}_{t-1}^{2}) & & (\mathcal{R},\mathcal{M}^{2}) \end{array} \end{equation*} be a chain of unitary local commutative rings $(\mathcal{A}_{i},\mathcal{M}_{i})$ with their corresponding Galois ring extensions $(\mathcal{R}_{i},\mathcal{M}_{i}^{2})$, for $i=0,1,\cdots,t$. In this paper, we have given a construction technique of the cyclic, BCH, alternant, Goppa and Srivastava codes over these rings. Though, initially in \cite{AP} it is for local ring $(\mathcal{A},\mathcal{M})$, in this paper, this new approach have given a choice in selection of most suitable code in error corrections and code rate perspectives.

On Blocking Sets in Affine Hjelmslev Planes

ACM Computing Classification System (1998): G.2.1.

Goppa and Srivastava codes over finite rings

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Hamming and Reed-Solomon codes over certain rings

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Class Notes for Math 901/902: Abstract Algebra, Instructor Tom Marley

Topics include: Free groups and presentations; Automorphism groups; Semidirect products; Classification of groups of small order; Normal series: composition, derived, and solvable series; Algebraic field extensions, splitting fields, algebraic closures; Separable algebraic extensions, the Primitive Element Theorem; Inseparability, purely inseparable extensions; Finite fields; Cyclotomic field extensions; Galois theory; Norm and trace maps of an algebraic field extension; Solvability by radicals, Galois' theorem; Transcendence degree; Rings and modules: Examples and basic properties; Exact sequences, split short exact sequences; Free modules, projective modules; Localization of (commutative) rings and modules; The prime spectrum of a ring; Nakayama's lemma; Basic category theory; The Hom functors; Tensor products, adjointness; Left/right Noetherian and Artinian modules; Composition series, the Jordan-Holder Theorem; Semisimple rings; The Artin-Wedderburn Theorem; The Density Theorem; The Jacobson radical; Artinian rings; von Neumann regular rings; Wedderburn's theorem on finite division rings; Group representations, character theory; Integral ring extensions; Burnside's paqb Theorem; Injective modules.

Sol → gel transition with rings in a finite polycondensing system in solution

We report a theoretical formulation for the mean cluster size distribution in a finite polycondensing system. Expressions for the mean number of n-mers with j bonds ( nj) are developed. Numerical calculations show that while the non-cyclic molecules make the dominant contribution to the small clusters, the large clusters are dominated by cyclic structures. The number of particles in ringless chains, n n,n-1, decays monotonically with n at all extents of reaction, but n n becomes bimodal near the gel point. We also find that the solvent plays an important role in the cluster size distribution.

Finite domination and Novikov rings. Iterative approach

Suppose C is a bounded chain complex of finitely generated free modules over the Laurent polynomial ring L = R[x,x -1]. Then C is R-finitely dominated, i.e. homotopy equivalent over R to a bounded chain complex of finitely generated projective R-modules if and only if the two chain complexes C ? L R((x)) and C ? L R((x -1)) are acyclic, as has been proved by Ranicki (A. Ranicki, Finite domination and Novikov rings, Topology 34(3) (1995), 619–632). Here R((x)) = R[[x]][x -1] and R((x -1)) = R[[x -1]][x] are rings of the formal Laurent series, also known as Novikov rings. In this paper, we prove a generalisation of this criterion which allows us to detect finite domination of bounded below chain complexes of projective modules over Laurent rings in several indeterminates.

Finite domination and Novikov rings: Laurent polynomial rings in two variables

Let C be a bounded cochain complex of finitely generatedfree modules over the Laurent polynomial ring L = R[x, x−1, y, y−1].The complex C is called R-finitely dominated if it is homotopy equivalentover R to a bounded complex of finitely generated projective Rmodules.Our main result characterises R-finitely dominated complexesin terms of Novikov cohomology: C is R-finitely dominated if andonly if eight complexes derived from C are acyclic; these complexes areC ⊗L R[[x, y]][(xy)−1] and C ⊗L R[x, x−1][[y]][y−1], and their variants obtainedby swapping x and y, and replacing either indeterminate by its inverse.

Finite domination and Novikov rings. Laurent polynomial rings in several variables

We present a homological characterisation of those chain complexes of modules over a Laurent polynomial ring in several indeterminates which are finitely dominated over the ground ring (that is, are a retract up to homotopy of a bounded complex of finitely generated free modules). The main tools, which we develop in the paper, are a non-standard totalisation construction for multi-complexes based on truncated products, and a high-dimensional mapping torus construction employing a theory of cubical diagrams that commute up to specified coherent homotopies.

On invariant Rings of Sylow subgroups of finite classical groups

In this thesis we study the invariant rings for the Sylow p-subgroups of the nite classical groups. We have successfully constructed presentations for the invariant rings for the Sylow p-subgroups of the unitary groups GU(3; Fq2) and GU(4; Fq2 ), the symplectic group Sp(4; Fq) and the orthogonal group O+(4; Fq) with q odd. In all cases, we obtained a minimal generating set which is also a SAGBI basis. Moreover, we computed the relations among the generators and showed that the invariant ring for these groups are a complete intersection. This shows that, even though the invariant rings of the Sylow p-subgroups of the general linear group are polynomial, the same is not true for Sylow p-subgroups of general classical groups. We also constructed the generators for the invariant elds for the Sylow p-subgroups of GU(n; Fq2 ), Sp(2n; Fq), O+(2n; Fq), O-(2n + 2; Fq) and O(2n + 1; Fq), for every n and q. This is an important step in order to obtain the generators and relations for the invariant rings of all these groups.

Algorithms for Generating Near-Rings on Finite Cyclic Groups

In the present work are described the algorithms that generate all near-rings on finite cyclic groups of order 16 to 29.

Finite domination and Novikov homology over strongly Z-graded rings

Let L be a unital Z-graded ring, and let C be a bounded chain complex of finitely generated L-modules. We give a homological characterisation of when C is homotopy equivalent to a bounded complex of finitely generated projective L0-modules, generalising known results for twisted Laurent polynomial rings. The crucial hypothesis is that L is a strongly graded ring.