相关论文: On the Relation Between Pommaret and Janet Bases

We determine, in a polynomial ring over a field, the arithmetical rank of certain ideals generated by a set of monomials and one binomial.

This paper has two aims. The first is to study ideals of minors of matrices whose entries are among the variables of a polynomial ring. Specifically, we describe matrices whose ideals of minors of a given size are prime. The main result in…

We characterize monomial ideals which are intersections of monomial prime ideals and study classes of ideals with this property, among them polymatroidal ideals.

In this paper we introduce a working generalization of the theory of Gr\"obner bases for algebras of partial difference polynomials with constant coefficients. One obtains symbolic (formal) computation for systems of linear or non-linear…

We use the lcm-lattice of a monomial ideal to study its minimal free resolutions. A new concept called a Taylor basis of a minimal free resolution is introduced and then used throughout the paper. We give a method of constructing minimal…

This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…

A minor is principal means it is defined by the same row and column indices. Let $X$ be a square generic matrix, $K[X]$ the polynomial ring in entries of $X$, over an algebraically closed field, $K$. For fixed $t\leq n$, let $\mathfrak P_t$…

The quotient bases for zero-dimensional ideals are often of interest in the investigation of multivariate polynomial interpolation, algebraic coding theory, and computational molecular biology, etc. In this paper, we discuss the properties…

Border bases can be considered to be the natural extension of Gr\"obner bases that have several advantages. Unfortunately, to date the classical border basis algorithm relies on (degree-compatible) term orderings and implicitly on reduced…

In this article, we study two fundamental questions on polyomino ideals which are radicality and primality. In order to study the question of radicality, we initiate the study of Knutson ideals among polyominoes. Knutson ideals were…

Let $R = k[x_1, \dotsc , x_n]$ denote the standard graded polynomial ring over a field $k$. We study certain classes of equigenerated monomial ideals with the property that the so-called complementary ideal has no linear relations on the…

Let R be the quotient of a polynomial ring over a field k by an ideal generated by monomials. We derive a formula for the multigraded Poincare' series of R, i.e., the generating function for the ranks of the modules in a minimal multigraded…

In this paper, we investigate how the initial models and the final models for the polynomial functors can be uniformly specified in matching logic.

We show that any nonzero polynomial in the ideal generated by the $r \times r$ minors of an $n \times n$ matrix $X$ can be used to efficiently approximate the determinant. For any nonzero polynomial $f$ in this ideal, we construct a small…

Given a square matrix $B$ over a principal ideal domain $D$ and an ideal $J$ of $D$, the $J$-ideal of $B$ consists of the polynomials $f\in D[X]$ such that all entries of $f(B)$ are in $J$. It has been shown that in order to determine all…

We have introduced the Janet's algorithm for the Stanley decomposition of a monomial ideal I in a polynomial ring S = K[x_1,...,x_n] and prove that Janet's algorithm gives the squarefree Stanley decomposition of S/I for a squarefree…

Given n polynomials in n variables of respective degrees d_1,...,d_n, and a set of monomials of cardinality d_1...d_n, we give an explicit subresultant-based polynomial expression in the coefficients of the input polynomials whose…

Lazard and Rouillier in [9], by introducing the concept of discriminant variety, have described a new and efficient algorithm for solving parametric polynomial systems. In this paper we modify this algorithm, and we show that with our…

In this paper we consider monomial localizations of monomial ideals and conjecture that a monomial ideal is polymatroidal if and only if all its monomial localizations have a linear resolution. The conjecture is proved for squarefree…

We extend the theory and the algorithms of Border Bases to systems of Laurent polynomial equations, defining "toric" roots. Instead of introducing new variables and new relations to saturate by the variable inverses, we propose a more…