A skew Laurent polynomial ring S = R[x;α] is reversible if it has a reversing automorphism, that is, an automorphism θ of period 2 that transposes x and x and restricts to an automorphism γ of R with γ = γ. We study invariants for reversing automorphisms and apply our methods to determine the rings of invariants of reversing automorphisms of the two most familiar examples of simple skew Laurent...

The Schur polynomials s ? are essential in understanding the representation theory of general linear group. They also describe cohomology ring Grassmannians. For ?=(n,n-1,?,1) a staircase shape and ??? subpartition, Stembridge equality states that ?/? =s T . This provides information about symmetry ring. stable Grothendieck G , dual g developed by Buch, Lam, Pylyavskyy, variants K-theory Using ...

A Wedderburn polynomial over a division ring K is a minimal polynomial of an algebraic subset of K. Special cases of such polynomials include, for instance, the minimal polynomials (over the center F = Z(K)) of elements of K that are algebraic over F . In this note, we give a survey on some of our ongoing work on the structure theory of Wedderburn polynomials. Throughout the note, we work in th...

Efficient algorithms are presented for factoring polynomials in the skew-polynomial ring F[x; σ], a non-commutative generalization of the usual ring of polynomials F[x], where F is a finite field and σ: F → F is an automorphism (iterated Frobenius map). Applications include fast functional decomposition algorithms for a class of polynomials in F[x] whose decompositions are “wild” and previously...

Reed-Solomon codes and Gabidulin codes have maximum Hamming distance and maximum rank distance, respectively. A general construction using skew polynomials, called skew Reed-Solomon codes, has already been introduced in the literature. In this work, we introduce a linearized version of such codes, called linearized Reed-Solomon codes. We prove that they have maximum sum-rank distance. Such dist...

Let R be a finite commutative chain ring, D 2 n the dihedral group of size and [ ] ring. In this paper, we completely characterize left ideals (called -codes) when gcd ( c h r ) , = 1 . way, explore structure some skew-cyclic codes length over also × S where is an isomorphic copy As particular result, give cyclic case F p m Galois field, classification for N -codes any positive integer both cas...