Symmetric and Rees algebras of Koszul cycles and their Gröbner bases

In this paper we study the symmetric algebra S(E _i ) and Rees algebra R(E _i ) of the modules E _i of i-cycles of the Koszul complex associated with the sequence of indeterminates of a polynomial ring . For i=2 and i=n–2 we show that is a d-sequence on S(E _i ) and R(E _i ) and we determine Gröbner bases and Sagbi bases related to these algebras. Mathematics Subject Classification (2000):13A30, 13D02, 13H10, 13P10The second author is grateful to the National Natural Science Foundation of China for support.Part of this work was made while the third author was visiting the Fachbereich Mathematik und Informatik der Universität Essen, to which he would like to thank for its hospitality.     

Gröbner–Shirshov bases for brace algebras

Let A be a brace algebra. This structure implies that A is also a pre-Lie algebra. In this paper, we establish Composition-Diamond lemma for brace algebras. For each pre-Lie algebra L, we find a Gröbner–Shirshov basis for its universal brace algebra U_b(L). As applications, we determine an explicit linear basis for U_b(L) and prove that L is a pre-Lie subalgebra of U_b(L).     

Gröbner–Shirshov bases for pre-associative algebras

We develop Gröbner–Shirshov bases technique for pre-associative (dendriform) algebras and prove a version of composition-diamond lemma.     

Gröbner–Shirshov bases for some Lie algebras

Siberian Mathematical Journal - We give Gröbner–Shirshov bases for the Drinfeld–Kohno Lie algebra L n in [1] and the Kukin Lie algebra A P in [2], where P is a semigroup. By way of...     

Gröbner–Shirshov bases for Vinberg–Koszul–Gerstenhaber right-symmetric algebras

In this paper, we establish the composition-diamond lemma for right-symmetric algebras. As an application, we give a Gröbner–Shirshov basis for the universal enveloping right-symmetric algebra of a Lie algebra.     

Parametrized Gröbner–Shirshov bases

We consider the problem of describing Gröbner–Shirshov bases for free associative algebras in finite terms. To this end we consider parametrized elements of an algebra and give methods for working with them which under favorable conditions lead to a basis given by finitely many patterns. On the negative side we show that in general there can be no algorithm. We relate our study to the problem of verifying that a given set of words in certain groups yields Bokut’ normal forms (or groups with a standard basis).     

Gröbner bases and triangulations of the second hypersimplex

The algebraic technique of Gröbner bases is applied to study triangulations of the second hypersimplex (2,n). We present a quadratic Gröbner basis for the associated toric idealK(K _n ). The simplices in the resulting triangulation of (2,n) have unit volume, and they are indexed by subgraphs which are linear thrackles [28] with respect to a circular embedding ofK _n . Forn6 the number of distinct initial ideals ofI(K _n ) exceeds the number of regular triangulations of (2,n); more precisely, the secondary polytope of (2,n) equals the state polytope ofI(K _n ) forn5 but not forn6. We also construct a non-regular triangulation of (2,n) forn9. We determine an explicit universal Gröbner basis ofI(K _n ) forn8. Potential applications in combinatorial optimization and random generation of graphs are indicated.Research partially supported by a doctoral fellowship of the National University of Mexico, the National Science Foundation, the David and Lucile Packard Foundation and the U.S. Army Research Office (through ACSyAM/MSI, Cornell).     

Gröbner-Shirshov bases for Rota-Baxter algebras

We establish the composition-diamond lemma for associative nonunitary Rota-Baxter algebras of weight λ. To give an application, we construct a linear basis for a free commutative and nonunitary Rota-Baxter algebra, show that every countably generated Rota-Baxter algebra of weight 0 can be embedded into a two-generated Rota—Baxter algebra, and prove the 1-PBW theorems for dendriform dialgebras and trialgebras.     

On noncommutative Gröbner bases over rings

Let R be a commutative ring. It is proved that for verification of whether a set of elements {f _α} of the free associative algebra over R is a Gröbner basis (with respect to some admissible monomial order) of the (bilateral) ideal that the elements f _α generate it is sufficient to check the reducibility to zero of S-polynomials with respect to {f _α} iff R is an arithmetical ring. Some related open questions and examples are also discussed.     

Universal and comprehensive Gröbner bases of the classical determinantal ideal

Let A =(x _ij ), i =1,2,... ,k, j =1,2,... ,l, 1 ≤ k ≤ l, be a matrix of independent variables, G be the set of maximal minors of A, and I = (G) be the classical determinantal ideal. We show that G is a universal Gr?bner basis of I. Also, a sufficient condition for G to be a universal comprehensive Gr?bner basis is proved. Bibliography: 12 titles.     

Gröbner-Shirshov bases for free Gelfand-Dorfman-Novokov algebras and for right ideals of free right Leibniz algebras

In this paper, we first found a magmatic (i.e., absolutely non-associative) Gröbner-Shirshov basis of a free Gelfand-Dorfman-Novikov algebra GDN(X) such that the corresponding set of irreducible magmatic words is the Dzhumadildaev-Löfwall linear basis of the GDN(X). Then, we prove a Composition-Diamond lemma for right ideals of a free right Leibniz algebra Lei(X).     

Differential Gröbner bases in one variable and in the partial case

Differential Gröbner bases of differential ideals in one differential variable and in the partial are characterized, when a canonical term ordering compatible with the derivations is used.     

Gröbner bases in Asymptotic Analysis of Perturbed Polynomial Programs

We consider a perturbed mathematical programming problem where both the objective and the constraint functions are polynomial in all underlying decision variables and in the perturbation parameter $\varepsilon.We consider a perturbed mathematical programming problem where both the objective and the constraint functions are polynomial in all underlying decision variables and in the perturbation parameter We study the behaviour of the solutions of such a perturbed problem as Though the solutions of the programming problems are real, we consider the Karush–Kuhn–Tucker optimality system as a one-dimensional complex algebraic variety in a multi-dimensional complex space. We use the Buchberger’s elimination algorithm of the Gr?bner bases theory to replace the defining equations of the variety by its Gr?bner basis, that has the property that one of its elements is bivariate, that is, a polynomial in and one of the decision variables only. Changing the elimination order in the Buchberger’s algorithm, we obtain such a bivariate polynomial for each of the decision variables. Thus, the solutions of the original system reduces to a number of algebraic functions in that can be represented as a Puiseux series in a neighbourhood of . A detailed analysis of the branching order and the order of the pole is also provided. The latter is estimated via characteristics of these bivariate polynomials of Gr?bner bases.This research was supported by a grant from the Australian Research Council no. DP0343028. We are indebted to K. Avrachenkov, P. Howlett, and V. Gaitsgory for many helpful discussions.