Add to ORKGComputers in Nonassociative Rings and Algebras provides information pertinent to the computational aspects of nonassociative rings and algebras. This book describes the algorithmic approaches for solving problems using a computer.Organized into 10 chapters, this book begins with an overview of the concept of a symmetrized power of a group representation. This text then presents data structures and other computational methods that may be useful in the field of computational algebra. Other chapters consider several mathematical ideas, including identity processing in nonassociative algebras, st
The set of all abelian subalgebras is computationally obtained for any given finite-dimensional Lie ...
International audienceAlgebra and number theory have always been counted among the most beautiful ma...
This book is about the computational aspects of invariant theory. Of central interest is the questio...
Nonassociative algebras can be applied, either directly or using their particular methods, to many o...
Abstract. The paper considers computer algebra in a non-commutative set-ting. The theory of Gröbner...
AbstractThis paper describes a two-semester graduate-level course designed during 1995 at Universida...
The paper considers computer algebra in a non-commutative setting. So far, suchinvestigations have b...
Although scientific computing is very often associated with numeric computations, the use of compute...
There are discussed implementational aspects of the special-purpose computer algebra system FELIX de...
AbstractIn the course of studying some idempotents of the group algebra of the symmetric group, we o...
Today, certain computer software systems exist which surpass the computational ability of researcher...
AbstractWe take an algorithmic and computational approach to a basic problem in abstract algebra: de...
An associative ring is just realized or built using reals or complex; finite or infinite by defining...
This thesis deals with computational methods in algebra, mainly focusing on the concept of Gröbner a...
This book is a blend of recent developments in theoretical and computational aspects of group theory...
The set of all abelian subalgebras is computationally obtained for any given finite-dimensional Lie ...
International audienceAlgebra and number theory have always been counted among the most beautiful ma...
This book is about the computational aspects of invariant theory. Of central interest is the questio...
Nonassociative algebras can be applied, either directly or using their particular methods, to many o...
Abstract. The paper considers computer algebra in a non-commutative set-ting. The theory of Gröbner...
AbstractThis paper describes a two-semester graduate-level course designed during 1995 at Universida...
The paper considers computer algebra in a non-commutative setting. So far, suchinvestigations have b...
Although scientific computing is very often associated with numeric computations, the use of compute...
There are discussed implementational aspects of the special-purpose computer algebra system FELIX de...
AbstractIn the course of studying some idempotents of the group algebra of the symmetric group, we o...
Today, certain computer software systems exist which surpass the computational ability of researcher...
AbstractWe take an algorithmic and computational approach to a basic problem in abstract algebra: de...
An associative ring is just realized or built using reals or complex; finite or infinite by defining...
This thesis deals with computational methods in algebra, mainly focusing on the concept of Gröbner a...
This book is a blend of recent developments in theoretical and computational aspects of group theory...
The set of all abelian subalgebras is computationally obtained for any given finite-dimensional Lie ...
International audienceAlgebra and number theory have always been counted among the most beautiful ma...
This book is about the computational aspects of invariant theory. Of central interest is the questio...