AbstractWe construct a new efficient algorithm for finding Gröbner–Shirshov bases for noncommutative algebras and their representations. This algorithm uses the Macaulay matrix [F.S. Macaulay, On some formula in elimination, Proc. London Math. Soc. 33 (1) (1902) 3–27], and can be viewed as a representation theoretic analogue of the F4 algorithm developed by J.C. Faugère. We work out some examples of universal enveloping algebras of Lie algebras and of their representations to illustrate the algorithm
AbstractThe main goal of this paper is to define Gröbner–Shirshov bases for some monoids. Therefore,...
AbstractWe present recent research of Eisenbud, Fløystad, Schreyer, and others, which was discovered...
AbstractThe recent development of Computer Algebra allows us to take up problems of classical Ideal ...
AbstractWe construct a new efficient algorithm for finding Gröbner–Shirshov bases for noncommutative...
We construct a new efficient algorithm for finding Gröbner–Shirshov bases for noncommutative algebra...
We construct a new efficient algorithm for finding Grobner-Shirshov bases for noncommutative algebra...
AbstractWe show that a set of monic polynomials in a free Lie superalgebra is a Gröbner–Shirshov bas...
AbstractIn 1965, Buchberger introduced the notion of Gröbner bases for a polynomial ideal and an alg...
International audienceWe propose efficient algorithms to compute the Gröbner basis of an ideal $I\su...
A basis for an ideal is such that every element in the ideal can be expressed as a linear combinatio...
Abstract. In this paper, we review Shirshov’s method for free Lie algebras invented by him in 1962 [...
AbstractIn this paper, we study the structure of Specht modules over Hecke algebras using the Gröbne...
AbstractIn this paper we present an algorithm for the computation of a diagonal form of a matrix ove...
summary:First, we provide an introduction to the theory and algorithms for noncommutative Gröbner ba...
summary:First, we provide an introduction to the theory and algorithms for noncommutative Gröbner ba...
AbstractThe main goal of this paper is to define Gröbner–Shirshov bases for some monoids. Therefore,...
AbstractWe present recent research of Eisenbud, Fløystad, Schreyer, and others, which was discovered...
AbstractThe recent development of Computer Algebra allows us to take up problems of classical Ideal ...
AbstractWe construct a new efficient algorithm for finding Gröbner–Shirshov bases for noncommutative...
We construct a new efficient algorithm for finding Gröbner–Shirshov bases for noncommutative algebra...
We construct a new efficient algorithm for finding Grobner-Shirshov bases for noncommutative algebra...
AbstractWe show that a set of monic polynomials in a free Lie superalgebra is a Gröbner–Shirshov bas...
AbstractIn 1965, Buchberger introduced the notion of Gröbner bases for a polynomial ideal and an alg...
International audienceWe propose efficient algorithms to compute the Gröbner basis of an ideal $I\su...
A basis for an ideal is such that every element in the ideal can be expressed as a linear combinatio...
Abstract. In this paper, we review Shirshov’s method for free Lie algebras invented by him in 1962 [...
AbstractIn this paper, we study the structure of Specht modules over Hecke algebras using the Gröbne...
AbstractIn this paper we present an algorithm for the computation of a diagonal form of a matrix ove...
summary:First, we provide an introduction to the theory and algorithms for noncommutative Gröbner ba...
summary:First, we provide an introduction to the theory and algorithms for noncommutative Gröbner ba...
AbstractThe main goal of this paper is to define Gröbner–Shirshov bases for some monoids. Therefore,...
AbstractWe present recent research of Eisenbud, Fløystad, Schreyer, and others, which was discovered...
AbstractThe recent development of Computer Algebra allows us to take up problems of classical Ideal ...