Let $R$ be a unitary ring with an endomorphism $σ$ and $F∪{0}$ be the free monoid generated by $U={u_1,…,u_t}$ with $0$ added, and $M$ be a factor of $F$ setting certain monomial in $U$ to $0$, enough so that, for some natural number $n$, $M^n=0$. In this paper, we give a sufficient condition for a ring $R$ such that the skew monoid ring $R*M$ is quasi-Armendariz (By Hirano a ring $R$ is called...

In this paper we revisit using skew quadrupole fields in place of traditional normal upright quadrupole fields to make beam focusing structures. We illustrate by example skew lattice decoupling, dispersion suppression and chromatic correction using the neutrino factory Study-II muon storage ring design. Ongoing BNL investigation of flat coil magnet structures that allow building a very compact ...

In this note we first show that for a right (resp. left) Ore ring R and an automorphism σ of R, if R is σ-skew McCoy then the classical right (resp. left) quotient ring Q(R) of R is σ̄-skew McCoy. This gives a positive answer to the question posed in Başer et al. [1]. We also characterize semiprime right Goldie (von Neumann regular) McCoy (σ-skew McCoy) rings.

Different approaches to construct linear codes using skew polynomials can be unified by using the nonassociative algebras built from skew-polynomial rings by Petit.

We define motion polynomials as polynomials with coefficients in the dual quaternions and study their factorizations. The motion polynomials correspond to motions in 3D space, and factoring into linear factors means to compose the motion into translations and rotations. This allows to realize the motion by a linkage with revolute or prismatic joints. This is joint work with G. Hegedüs (Univ. Ob...

Abstract. A skew edge coloring of a graph G is defined to be a set of two edge colorings such that no two edges are assigned the same unordered pair of colors. The skew chromatic index s(G) is the minimum number of colors required for a skew edge coloring of G. In this paper, an algorithm is determined for skew edge coloring of circular ladder graphs. Alsothe skew chromatic index of circular la...

A skew edge coloring of a graph G is defined to be a set of two edge colorings such that no two edges are assigned the same unordered pair of colors. The skew chromatic index s(G) is the minimum number of colors required for a skew edge coloring of G. In this paper, skew edge coloring of certain classes of graphs are determined. Furthermore, the skew chromatic index of those graphs is obtained ...