Related papers: Skew-Polynomial Rings and Skew-Cyclic Codes
We extend recent results by G. E. Andrews and G. Simay on the $m$th largest and $m$th smallest parts of a partition to the more general context of skew plane partitions. In order to do this, we introduce new objects called skew plane…
We introduce the sum-rank metric analogue of Reed--Muller codes, which we called linearized Reed--Muller codes, using multivariate Ore polynomials. We study the parameters of these codes, compute their dimension and give a lower bound for…
Many rings and algebras arising in quantum mechanics can be interpreted as skew PBW (Poincar\'e-Birkhoff-Witt) extensions. Indeed, Weyl algebras, enveloping algebras of finite-dimensional Lie algebras (and its quantization), Artamonov…
A skew Laurent polynomial ring R[x^{\pm 1};\alpha] is reversible if it has a reversing automorphism, that is, an automorphism of period two that transposes x and x^{-1} and restricts to an automorphism of R. We study invariants for…
In his 1981 Fundamental Theorem of Algebra paper Steve Smale initiated the complexity theory of finding a solution of polynomial equations of one complex variable by a variant of Newton's method. In this paper we reconsider his algorithm in…
We prove that if $A$ is a regular graded skew Clifford algebra and is a twist of a regular graded Clifford algebra $B$ by an automorphism, then the subalgebra of $A$ generated by a certain normalizing sequence of homogeneous degree-two…
Motivated by the study of homomorphisms and cv-polynomials presented by Rimmer \cite{Rimmer1978} in the case of Ore extensions of automorphism type, Ferrero and Kishimoto \cite{FerreroKishimoto1980} and Kikumasa \cite{Kikumasa1990} in the…
Quasi-cyclic codes form an important class of algebraic codes that includes cyclic codes as a special subclass. This chapter focuses on the algebraic structure of quasi-cyclic codes, first. Based on these structural properties, some…
We propose an algorithm that approximates a given matrix polynomial of degree $d$ by another skew-symmetric matrix polynomial of a specified rank and degree at most $d$. The algorithm is built on recent advances in the theory of generic…
We prove the following generalization of the classical Shephard-Todd-Chevalley Theorem. Let $G$ be a finite group of graded algebra automorphisms of a skew polynomial ring $A:=k_{p_{ij}}[x_1,...,x_n]$. Then the fixed subring $A^G$ has…
We apply the method of skew-orthogonal polynomials (SOP) in the complex plane to asymmetric random matrices with real elements, belonging to two different classes. Explicit integral representations valid for arbitrary weight functions are…
Subspace codes and particularly constant dimension codes have attracted much attention in recent years due to their applications in random network coding. As a particular subclass of subspace codes, cyclic subspace codes have additional…
In this paper, we study the structure of cyclic, quasi-cyclic, constacyclic codes and their skew codes over the finite ring R=Z_3+vZ_3+v^2Z_3, v^3=v. The Gray images of cyclic, quasi-cyclic, skew cyclic, skew quasi-cyclic and skew…
In this work, maximum sum-rank distance (MSRD) codes and linearized Reed-Solomon codes are extended to finite chain rings. It is proven that linearized Reed-Solomon codes are MSRD over finite chain rings, extending the known result for…
The sum-rank metric naturally extends both the Hamming and rank metrics in coding theory over fields. It measures the error-correcting capability of codes in multishot matrix-multiplicative channels (e.g. linear network coding or the…
Cyclic codes are a subclass of linear codes and have wide applications in consumer electronics, data storage systems, and communication systems due to their efficient encoding and decoding algorithms. Cyclic codes with many zeros and their…
Binary duadic codes are an interesting subclass of cyclic codes since they have large dimensions and their minimum distances may have a square-root bound. In this paper, we present several families of binary duadic codes of length $2^m-1$…
We present a classification of the so-called "additive symmetric 2-cocycles" of arbitrary degree and dimension over Z/p, along with a partial result and some conjectures for m-cocycles over Z/p, m > 2. This expands greatly on a result…
Given a directed graph, we show how to efficiently find a shortest (directed, simple) cycle on an even number of vertices. As far as we know, no polynomial-time algorithm was previously known for this problem. In fact, finding any even…
Skew monoidal categories are monoidal categories with non-invertible `coherence' morphisms. As shown in a previous paper bialgebroids over a ring R can be characterized as the closed skew monoidal structures on the category Mod R in which…