Related papers: An Algorithm for Finding Symmetric Gr\"obner Bases…

Let $P_N(R)$ be the space of all real polynomials in $N$ variables with the usual inner product $<, >$ on it, given by integrating over the unit sphere. We start by deriving an explicit combinatorial formula for the bilinear form…

For a polynomial ring S in n variables, we consider the natural action of the symmetric group S_n on S by permuting the variables. For an S_n-invariant monomial ideal I in S and j >= 0, we give an explicit recipe for computing the modules…

In this paper, we discuss the normality of the toric rings of stable set polytopes, and the set of generators and Gr\"obner bases of toric ideals of stable set polytopes by using the results on that of edge polytopes of finite nonsimple…

A classical result of Artin states that the ideal generated by symmetric polynomials in $n$ variables is of codimension $n!$. The author, F. Bergeron and N. Bergeron have recently obtained a surprising analogous in the case of…

The main ingredient to construct an O-border basis of an ideal I $\subseteq$ K[x1,. .., xn] is the order ideal O, which is a basis of the K-vector space K[x1,. .., xn]/I. In this paper we give a procedure to find all the possible order…

For a given ideal I in K[x_1,...,x_n,y_1,...,y_m] in a polynomial ring with n+m variables, we want to find all elements that can be written as f-g for some f in K[x_1,...,x_n] and some g in K[y_1,...,y_m], i.e., all elements of I that…

Monomial ideals and toric rings are closely related. By consider a Grobner basis we can always associated to any ideal $I$ in a polynomial ring a monomial ideal ${\rm in}_\prec I$, in some special situations the monomial ideal ${\rm…

The aim of this work is to extend the study of super-coinvariant polynomials, to the case of the generalized symmetric group $G_{n,m}$, defined as the wreath product $C_m\wr\S_n$ of the symmetric group by the cyclic group. We define a…

Motivated by better understanding the bideterminant (=product of minors) basis on the polynomial ring in $n \times m$ variables, we develop theory \& algorithms for Gr\"obner bases in not only algebras with straightening law (ASLs or Hodge…

A zero-dimensional polynomial ideal may have a lot of complex zeros. But sometimes, only some of them are needed. In this paper, for a zero-dimensional ideal $I$, we study its complex zeros that locate in another variety $\textbf{V}(J)$…

Matrix Schubert varieties are the closures of the orbits of $B\times B$ acting on all $n\times n$ matrices, where $B$ is the group of invertible lower triangular matrices. Extending work of Fulton, Knutson and Miller identified a Gr\"obner…

This note aims at finding explicit and efficient generation of ideals in subalgebras $R$ of the polynomial ring $S=k[t]$ ($k$ a field) such that $t^{c_0}S \subseteq R$ for some integer $c_0 > 0$. The class of these subalgebras which we call…

We show how multiplier ideals can be used to obtain uniform multiplicative bounds for certain families of ideals on a smooth complex algebraic variety. In particular we prove a quick but rather surprising result about symbolic powers of…

We show that under some conditions, if the initial ideal in$_<(I)$ of an ideal $I$ in a polynomial ring has the property that its symbolic and ordinary powers coincide, then the ideal $I$ shares the same property. We apply this result to…

Experiences with the implementation of strong Gr\"obner bases respectively standard bases for polynomial rings over principal ideal rings are explained: different strategies for creating the pair set, methods to avoid coefficient growth and…

We study the set of monomial ideals in a polynomial ring as an ordered set, with the ordering given by reverse inclusion. We give a short proof of the fact that every antichain of monomial ideals is finite. Then we investigate ordinal…

The theory of standard bases in polynomial rings with coefficients in a ring R with respect to local orderings is developed. R is a commutative Noetherian ring with 1 and we assume that linear equations are solvable in R.

In this paper homotopical methods for the description of subgroups determined by ideals in group rings are introduced. It is shown that in certain cases the subgroups determined by symmetric product of ideals in group rings can be described…

In 1965 Buchberger defined Gr\"obner bases and an algorithm to compute them. Despite a slow start, already in the eighties Gr\"obner bases had become the main device for symbolic computations involving polynomials as well as a theoretical…

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…