相关论文: Constructing a Gr\"obner basis of Griffin's ideal

We increase the scope of previous work on change of basis between finite bases of polynomials by defining ascending and descending bases and introducing three techniques for defining them from known ones. The minimum degrees of polynomials…

Blockwise determinantal ideals are those generated by the union of all the minors of specified sizes in certain blocks of a generic matrix, and they are the natural generalization of many existing determinantal ideals like the Schubert and…

For $n\geq 3$, let $\Omega_n$ be the set of line segments between the vertices of a convex $n$-gon. For $j\geq 2$, a $j$-crossing is a set of $j$ line segments pairwise intersecting in the relative interior of the $n$-gon. We identify…

We introduce a detection algorithm for SAGBI basis in polynomial rings, analogous to a Gr\"obner basis detection algorithm previously proposed by Gritzmann and Sturmfels. We also present two accompanying software packages named…

We study the generic initial ideals (gin) of certain ideals that arise in modular invariant theory. For all cases an explicit generating set is known we calculate the generic initial ideal of the Hilbert ideal of a cyclic group of prime…

We propose a method to unify various stability results about symmetric ideals in polynomial rings by stratifying related derived categories. We execute this idea for chains of $GL_n$-equivariant modules over an infinite field $k$ of…

We present an algorithm to decide whether a given ideal in the polynomial ring contains a monomial without using Gr\"obner bases, factorization or sub-resultant computations.

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…

In this paper, we prove a finite basis theorem for radical well-mixed difference ideals generated by binomials. As a consequence, every strictly ascending chain of radical well-mixed difference ideals generated by binomials in a difference…

Let $k$ be a field. We determine the ideals $I$ in a finitely generated graded $k$-algebra $A$, whose associated graded rings are isomorphic to $A$. Also we compute the graded local cohomologies of the Rees rings $A[I t]$ and give the…

The $\Delta$-Springer varieties are a generalization of Springer fibers introduced by Levinson, Woo, and the author that have connections to the Delta Conjecture from algebraic combinatorics. We prove a positive Hall-Littlewood expansion…

There is a natural infinite graph whose vertices are the monomial ideals in a polynomial ring. The definition involves Gr\"obner bases or the action of an algebraic torus. We present algorithms for computing the (affine schemes…

For associative algebras in many different categories, it is possible to develop the machinery of Gr\"obner bases. A Gr\"obner basis of defining relations for an algebra of such a category provides a "monomial replacement" of this algebra.…

Let $A$ be the quotient of a graded polynomial ring $\mathbb{Z}[x_1,\cdots,x_m]\otimes\Lambda[y_1,\cdots,y_n]$ by an ideal generated by monomials with leading coefficients 1. Then we constructed a space~$X_A$ such that $A$ is isomorphic to…

Let $k$ be a commutative ring and $S=k[x_0, \ldots, x_n]$ be a polynomial ring over $k$ with a monomial order. For any monomial ideal $J$, there exists an affine $k$-scheme of finite type, called Gr\"obner scheme, which parameterizes all…

In this paper, basic properties of monomial difference ideals are studied. We prove the finitely generated property of well-mixed difference ideals generated by monomials. Furthermore, a finite prime decomposition of radical well-mixed…

In this paper we present the first-ever computer formalization of the theory of Gr\"obner bases in reduction rings, which is an important theory in computational commutative algebra, in Theorema. Not only the formalization, but also the…

In the context of modeling biological systems, it is of interest to generate ideals of points with a unique reduced Groebner basis, and the first main goal of this paper is to identify classes of ideals in polynomial rings which share this…

An explicit construction is given of a minimal free resolution of the ideal generated by all squarefree monomials of a given degree. The construction relies upon and exhibits the natural action of the symmetric group on the syzygy modules.…

An algorithm to generate a minimal comprehensive Gr\"obner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gr\"obner\, system is presented. A basis of a parametric polynomial ideal is a comprehensive…