A Gröbner basis characterization for chordal comparability graphs

In this paper, we study toric ideals associated with multichains of posets. It is shown that the comparability graph of a poset is chordal if and only if there exists a quadratic Gröbner basis of the toric ideal of the poset. Strong perfect elimination orderings of strongly chordal graphs play an important role.     

Ideals of Graph Homomorphisms

In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by introducing the ideals of graph homomorphisms. For this new class of ideals we investigate how the topology of the graphs influences the algebraic properties. We describe explicit Gröbner bases for several classes, generalizing results by Hibi, Sturmfels, and Sullivant. One of our main tools is the toric fiber product, and we employ results by Engström, Kahle, and Sullivant. The lattice polytopes defined by our ideals include important classes in optimization theory, as the stable set polytopes.     

Gröbner Bases for Ideals of σ-PBW Extensions

In this article, we introduce the σ-PWB extensions and construct the theory of Gröbner bases for the left ideals of them. We prove the Hilbert's basis theorem and the division algorithm for this more general class of Poincaré–Birkhoff–Witt extensions. For the particular case of bijective and quasi-commutative σ-PWB extensions, we implement the Buchberger's algorithm for computing Gröbner bases of left ideals.     

Finite lattices and Gröbner bases

Gröbner bases of binomial ideals arising from finite lattices will be studied. In terms of Gröbner bases and initial ideals, a characterization of finite distributive lattices as well as planar distributive lattices will be given.     

Parity binomial edge ideals

Parity binomial edge ideals of simple undirected graphs are introduced. Unlike binomial edge ideals, they do not have square-free Gröbner bases and are radical if and only if the graph is bipartite or the characteristic of the ground field is not two. The minimal primes are determined and shown to encode combinatorics of even and odd walks in the graph. A mesoprimary decomposition is determined and shown to be a primary decomposition in characteristic two.     

Parallel algorithms for Gröbner-basis construction

The problem of the Gröbner-basis construction is important both from the theoretical and applied points of view. As examples of applications of Gröbner bases, one can mention the consistency problem for systems of nonlinear algebraic equations and the determination of the number of solutions to a system of nonlinear algebraic equations. The Gröbner bases are actively used in the constructive theory of polynomial ideals and at the preliminary stage of numerical solution of systems of nonlinear algebraic equations. Unfortunately, many real examples cannot be processed due to the high computational complexity of known algorithms for computing the Gröbner bases. However, the efficiency of the standard basis construction can be significantly increased in practice. In this paper, we analyze the known algorithms for constructing the standard bases and consider some methods for increasing their efficiency. We describe a technique for estimating the efficiency of paralleling the algorithms and present some estimates.     

Cohen–Macaulayness of monomial ideals and symbolic powers of Stanley–Reisner ideals

We present criteria for the Cohen–Macaulayness of a monomial ideal in terms of its primary decomposition. These criteria allow us to use tools of graph theory and of linear programming to study the Cohen–Macaulayness of monomial ideals which are intersections of prime ideal powers. We can characterize the Cohen–Macaulayness of the second symbolic power or of all symbolic powers of a Stanley–Reisner ideal in terms of the simplicial complex. These characterizations show that the simplicial complex must be very compact if some symbolic power is Cohen–Macaulay. In particular, all symbolic powers are Cohen–Macaulay if and only if the simplicial complex is a matroid complex. We also prove that the Cohen–Macaulayness can pass from a symbolic power to another symbolic powers in different ways.     

Gröbner bases of characteristic ideals of LRS over UFD

LetR be a unique factorization domain (UFD). A method of Gröbner bases and localization in commutative algebra is applied to compute and analyze the characteristic ideals of semi-infinite linear recurring sequences (lrs), infinite linear recurring sequences (LRS), and finite lrs over UFD. The canonical form of a minimal Gröbner basis of the homogeneous characteristic ideal is described for a finite segment of an lrs, from which a precise relation between every step in the classical Berlekamp-Massey algorithm and every member of the Gröbner basis is derived.     

Gröbner basis and free resolution of the ideal of 2-minors of a 2 × n matrix of linear forms *

We give a Gröbner basis for the ideal of 2-minors of a 2 × n utiatrix of linear forms. The minimal free resolution of such an ideal is obtained in [4] when the corresponding Kronecker-Weierstrass normal form has no iiilpotent blocks. For the general case, using this result, the Grobner basis and the Eliahou-Kervaire resolution for stable monomial ideals, we obtain a free resolution with the expected regularity. For a specialization of the defining ideal of ordinary pinch points, as a special case of these ideals, we provide a minimal free resolution explicitly in terms of certain Koszul complex.     

Associated radical ideals of monomial ideals

Algebraic and combinatorial properties of a monomial ideal are studied in terms of its associated radical ideals. In particular, we present some applications to the symbolic powers of square-free monomial ideals.     

Gröbner Bases for the Polynomial Ring with Infinite Variables and Their Applications

We develop the theory of Gröbner bases for ideals in a polynomial ring with countably infinite variables over a field. As an application we reconstruct some of the one-to-one correspondences among various sets of partitions by using the division algorithm.     

Gröbner–Shirshov Basis for HNN Extensions of Groups and for the Alternating Group

In this article, we generalize the Shirshov's Composition Lemma by replacing the monomial order for others. By using Gröbner–Shirshov bases, the normal forms of HNN extension of a group and the alternating group are obtained.     

Toric rings generated by special stable sets of monomials

In this paper we consider some subalgebras of the d-th Veronese subring of a polynomial ring, generated by stable subsets of monomials. We prove that these algebras are Koszul, showing that the presentation ideals have Gröbner bases of quadrics with respect to suitable term orders. Since the initial monomials of the elements of these Gröbner bases are square- free, it follows by a result of STURMFELS [S, 13.15], that the algebras under consideration are normal, and thus Cohen-Macaulay.     

Generic tropical varieties

We show that in the constant coefficient case the generic tropical variety of a graded ideal exists. This can be seen as an analogue to the existence of the generic initial ideal in Gröbner basis theory. We determine the generic tropical variety as a set in general and as a fan for principal ideals and linear ideals.     

The Behaviors of Expansion Functor on Monomial Ideals and Toric Rings

In this article, we study some algebraic and combinatorial behaviors of expansion functor. We show that on monomial ideals some properties like polymatroidalness, weakly polymatroidalness, and having linear quotients are preserved under taking the expansion functor.

The main part of the article is devoted to study of toric ideals associated to the expansion of subsets of monomials which are minimal with respect to divisibility. It is shown that, for a given discrete polymatroid P, if toric ideal of P is generated by double swaps, then toric ideal of any expansion of P has such a property. This result, in a special case, says that White's conjecture is preserved under taking the expansion functor. Finally, the construction of Gröbner bases and some homological properties of toric ideals associated to expansions of subsets of monomials is investigated.     

Linearity defect of edge ideals and Fröberg’s theorem

Fröberg’s classical theorem about edge ideals with 2-linear resolution can be regarded as a classification of graphs whose edge ideals have linearity defect zero. Extending his theorem, we classify all graphs whose edge ideals have linearity defect at most 1. Our characterization is independent of the characteristic of the base field: The graphs in question are exactly weakly chordal graphs with induced matching number at most 2. The proof uses the theory of Betti splittings of monomial ideals due to Francisco, Hà, and Van Tuyl and the structure of weakly chordal graphs. Along the way, we compute the linearity defect of edge ideals of cycles and weakly chordal graphs. We are also able to recover and generalize previous results due to Dochtermann–Engström, Kimura and Woodroofe on the projective dimension and Castelnuovo–Mumford regularity of edge ideals.     

Parallelization of matrix algorithms for Gröbner basis computation

Sequential and parallel implementations of the F4 algorithm for computing Gröbner bases of polynomial ideals are discussed.     

Convex bodies and asymptotic invariants for powers of monomial ideals

Continuing a well established tradition of associating convex bodies to monomial ideals, we initiate a program to construct asymptotic Newton polyhedra from decompositions of monomial ideals. This is achieved by forming a graded family of ideals based on a given decomposition. We term these graded families powers since they generalize the notions of ordinary and symbolic powers. Asymptotic invariants for these graded families are expressed as solutions to linear optimization problems on the respective convex bodies. This allows to establish a lower bound on the Waldschmidt constant of a monomial ideal by means of a more easily computable invariant, which we introduce under the name of naive Waldschmidt constant.     

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.