We prove that the m-generated Grassmann algebra can be embedded into a 2 × 2 matrix algebra over a factor of a commutative polynomial algebra in m indeterminates. Cayley–Hamilton and standard identities for n× n matrices over the m-generated Grassmann algebra are derived from this embedding. Other related embedding results are also presented.

Let (H,R) be a quasitriangular weak Hopf algebra, and A a quantum commutative weak H-module algebra. We establish the relationship of homological dimensions between weak smash product algebra A#H and A under some conditions. As an application, we consider the case of twisted weak Hopf algebra. Mathematics Subject Classification (2010): 16T05

Number is one of the most fundamental concepts not only in mathematics, but in general natural science as well. It may be primary even in comparison with such global categories as time, space, substance, matter, and field. That is why editing the first issue of the journal " Hypercomlex numbers in geometry and physics " the editorial board sincerely hopes that articles not only on numbers in ge...

Let A be an algebra over a commutative unital ring C. We say that A is zero triple product determined if for every C-module X and every trilinear map {·, ·, ·}, the following holds: if {x, y, z} 0 whenever xyz 0, then there exists a C-linear operator T : A3 −→ X such that {x, y, z} T xyz for all x, y, z ∈ A. If the ordinary triple product in the aforementioned definition is replaced by Jordan t...

We introduce a coloured generalization $\mathrm{NSym}_A$ of the Hopf algebra non-commutative symmetric functions described as subalgebra rooted ordered trees algebra. Its natural basis can be identified with set sentences over alphabet $A$ (the colours). present also its graded dual $\mathrm{QSym}_A$ quasi-symmetric together realization in terms power series partially commutative variables. pro...

We describe the non–commutative extension of the computer algebra system Singular, called Plural. In the system, we provide rich functionality for symbolic computation within a wide class of non– commutative algebras. We discuss the computational objects of Plural, the implementation of main algorithms, various aspects of software engineering and numerous applications. Singular:Plural or, short...

We discuss unique decomposition in partial commutative monoids. Inspired by a result from process theory, we propose the notion of decomposition order for partial commutative monoids, and prove that a partial commutative monoid has unique decomposition iff it can be endowed with a decomposition order. We apply our result to establish that the commutative monoid of weakly normed processes modulo...

Bounded residuated lattice ordered monoids (R -monoids) are a common generalization of pseudo-BL-algebras and Heyting algebras, i.e. algebras of the non-commutative basic fuzzy logic (and consequently of the basic fuzzy logic, the Łukasiewicz logic and the non-commutative Łukasiewicz logic) and the intuitionistic logic, respectively. In the paper we introduce and study classes of filters of bou...

There are discussed implementational aspects of the special-purpose computer algebra system FELIX designed for computations in constructive algebra. In particular, data types developed for the representation of and computation with commutative and non-commutative polynomials are described. Furthermore, comparisons of time and memory requirements of di erent polynomial representations are reported.

The notion of Poisson manifold with compatible pseudo-metric was introduced by the author in [1]. In this paper, we introduce a new class of Lie algebras which we call a pseudo-Riemannian Lie algebras. The two notions are strongly related: we prove that a linear Poisson structure on the dual of a Lie algebra has a compatible pseudo-metric if and only if the Lie algebra is a pseudo-Riemannian Li...