We discuss a generalization of the Cohn–Umans method, a potent technique developed for studying the bilinear complexity of matrix multiplication by embedding matrices into an appropriate group algebra. We investigate how the Cohn–Umans method may be used for bilinear operations other than matrix multiplication, with algebras other than group algebras, and we relate it to Strassen’s tensor rank ...

let $rin textbf{c}^{mtimes m}$ and $sin textbf{c}^{ntimes n}$ be nontrivial involution matrices; i.e., $r=r^{-1}neq pm~i$ and $s=s^{-1}neq pm~i$. an $mtimes n$ complex matrix $a$ is said to be an $(r, s)$-symmetric ($(r, s)$-skew symmetric) matrix if $ras =a$ ($ ras =-a$). the $(r, s)$-symmetric and $(r, s)$-skew symmetric matrices have a number of special properties and widely used in engi...

In this paper, some elementary operations on triangular fuzzynumbers (TFNs) are defined. We also define some operations on triangularfuzzy matrices (TFMs) such as trace and triangular fuzzy determinant(TFD). Using elementary operations, some important properties of TFMs arepresented. The concept of adjoints on TFM is discussed and some of theirproperties are. Some special types of TFMs (e.g. pu...

let $g$ be a simple graph with an orientation $sigma$‎, ‎which ‎assigns to each edge a direction so that $g^sigma$ becomes a‎ ‎directed graph‎. ‎$g$ is said to be the underlying graph of the‎ ‎directed graph $g^sigma$‎. ‎in this paper‎, ‎we define a weighted skew‎ ‎adjacency matrix with rand'c weight‎, ‎the skew randi'c matrix ${bf‎ ‎r_s}(g^sigma)$‎, ‎of $g^sigma$ as the real skew symmetric mat...

This paper suggests a detailed algorithm for computation of the Jacobson form of the polynomial matrix associated with the transfer matrix describing the multi-input multi-output nonlinear control system, defined on homogeneous time scale. The algorithm relies on the theory of skew polynomial rings.

We mainly investigate the structures of skew cyclic and skew quasicyclic codes of arbitrary length over Galois rings. Similar to [5], our results show that the skew cyclic codes are equivalent to either cyclic and quasi-cyclic codes over Galois rings. Moreover, we give a necessary and sufficient condition for skew cyclic codes over Galois rings to be free. A sufficient condition for 1-generator...

In this paper we generalize coding theory of cyclic codes over finite fields to skew polynomial rings over finite rings. Codes that are principal ideals in quotient rings of skew polynomial rings by two sided ideals are studied. Next we consider skew codes of endomorphism type and derivation type. And we give some examples. Mathematics Subject Classification: Primary 94B60; Secondary 94B15, 16D25

In this paper we generalize coding theory of cyclic codes over finite fields to skew polynomial rings over finite rings. Codes that are principal ideals in quotient rings of skew polynomial rings by two sided ideals are studied. Next we consider skew codes of endomorphism type and derivation type. And we give some examples.

We characterize skew polynomial rings and power series that are reduced right or left Archimedean.