相关论文: Groebner-Shirshov Basis for the Chinese Monoid

We construct an explicit minimal strong Groebner basis of the ideal of vanishing polynomials in the polynomial ring over Z/m for m>=2. The proof is done in a purely combinatorial way. It is a remarkable fact that the constructed Groebner…

In this paper an explicit form of generalized Chebyshev Koornwinder's type polynomial of first kind in terms of the Bernstein basis of fixed degree $n$ is provided. Moreover, we investigate generalized Chebyshev Koornwinder's type…

The interpolation step of Guruswami and Sudan's list decoding of Reed-Solomon codes poses the problem of finding the minimal polynomial of an ideal with respect to a certain monomial order. An efficient algorithm that solves the problem is…

In this paper, we introduce (almost) skew 2-nomial algebras and look for a one-sided or two-sided Gr\"obner basis theory for such algebras at a modest level. That is, we establish the existence of a skew multiplicative $K$-basis for every…

This paper is a detailed description of an algorithm based on a generalized Buchberger algorithm for constructing Groebner-type bases associated with polynomials of shift operators. The algorithm is used for calculating Feynman integrals…

We establish a universal approach to solution of the word problem in the varieties of di- and tri-algebras. This approach, for example, allows to apply Groebner---Shirshov bases method for Lie algebras to solve the ideal membership problem…

In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.

In this paper, linear bases for the partially commutative Lie algebras are found. The method of the Gr\"{o}bner--Shirshov bases is used. It easily follows from the structure that the equality problem is algorithmically solvable for the…

In this paper, we elaborate Gr\"obner-Shirshov bases method for Leibniz (super)algebras. We show that there is a unique reduced Gr\"obner-Shirshov basis for every (graded) ideal of a free Leibniz (super)algebra. As applications, we…

This paper presents an algorithm for computing Groebner bases based upon labeled polynomials and ideas from the algorithm F5. The main highlights of this algorithm compared with analogues are simplicity both of the algorithm and of the its…

We construct a finite convergent semi-quadratic presentation for the Chinese monoid by adding column generators and using combinatorial properties of insertion algorithms on Chinese staircases. We extend this presentation into a coherent…

We develop Groebner---Shirshov bases technique for pre-associative algebras also known as dendriform (di-)algebras.

In this work we develop the theory of Gr\"obner bases for modules over the ring of univariate linearized polynomials with coefficients from a finite field.

Quaternionic polynomials occur naturally in applications of quaternions in science and engineering, and normalization of quaternionic polynomials is a basic manipulation. Once a Groebner basis is certified for the defining ideal I of the…

In this paper, a polynomial-time algorithm is given to compute the generalized Hermite normal form for a matrix F over Z[x], or equivalently, the reduced Groebner basis of the Z[x]-module generated by the column vectors of F. The algorithm…

We study a question which can be roughly stated as follows: Given a (unital or nonunital) algebra $A$ together with a Gr\"obner-Shirshov basis $G$, consider the free operated algebra $B$ over $A$, such that the operator satisfies some…

Starting from the seminal example of the greedy normal norm in braid monoids, we analyse the mechanism of the normal form in a Garside monoid and explain how it extends to the more general framework of Garside families. Extending the…

Let T(x) in k[x] be a monic non-constant polynomial and write R=k[x] / (T) the quotient ring. Consider two bivariate polynomials a(x, y), b(x, y) in R[y]. In a first part, T = p^e is assumed to be the power of an irreducible polynomial p. A…

We use Groebner basis methods to extract all stationary solutions for the 9-mode shear flow model that is described in Moehlis et al, New J. Phys. 6, 54 (2004). Using rational approximations to irrational wave numbers and algebraic…

The GVW algorithm, presented by Gao et al., is a signature-based algorithm for computing Gr\"obner bases. In this paper, a variant of GVW is presented. This new algorithm is called a monomial-oriented GVW algorithm or mo-GVW algorithm for…