ﻻ يوجد ملخص باللغة العربية
Let J be a strongly stable monomial ideal in S=K[x_1,...,x_n] and let Mf(J) be the family of all homogeneous ideals I in S such that the set of all terms outside J is a K-vector basis of the quotient S/I. We show that an ideal I belongs to Mf(J) if and only if it is generated by a special set of polynomials, the J-marked basis of I, that in some sense generalizes the notion of reduced Groebner basis and its constructive capabilities. Indeed, although not every J-marked basis is a Groebner basis with respect to some term order, a sort of normal form modulo I (with the ideal I in Mf(J)) can be computed for every homogeneous polynomial, so that a J-marked basis can be characterized by a Buchberger-like criterion. Using J-marked bases, we prove that the family Mf(J) can be endowed, in a very natural way, with a structure of affine scheme that turns out to be homogeneous with respect to a non-standard grading and flat in the origin (the point corresponding to J), thanks to properties of J-marked bases analogous to those of Groebner bases about syzygies.
We describe the universal Groebner basis of the ideal of maximal minors and the ideal of $2$-minors of a multigraded matrix of linear forms. Our results imply that the ideals are radical and provide bounds on the regularity. In particular, the ideals
We present an algorithm for computing Groebner bases of vanishing ideals of points that is optimized for the case when the number of points in the associated variety is less than the number of indeterminates. The algorithm first identifies a set of e
A contemporary and exciting application of Groebner bases is their use in computational biology, particularly in the reverse engineering of gene regulatory networks from experimental data. In this setting, the data are typically limited to tens of po
Let $X$ be a set of points whose coordinates are known with limited accuracy; our aim is to give a characterization of the vanishing ideal $I(X)$ independent of the data uncertainty. We present a method to compute a polynomial basis $B$ of $I(X)$ whi
The texttt{StronglyStableIdeals} package for textit{Macaulay2} provides a method to compute all saturated strongly stable ideals in a given polynomial ring with a fixed Hilbert polynomial. A description of the main method and auxiliary tools is given.