Buchberger's algorithm and staggered linear bases
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Gröbner bases and Hilbert schemes. I
Journal of Symbolic Computation
Gröbner bases computation using syzygies
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Computing Gröbner bases in monoid and group rings
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Efficient computation of zero-dimensional Gro¨bner bases by change of ordering
Journal of Symbolic Computation
A note on polynomial reduction
Journal of Symbolic Computation
Involutive bases of polynomial ideals
Mathematics and Computers in Simulation - Special issue: Simplification of systems of algebraic and differential equations with applications
A New Criterion for Normal Form Algorithms
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
The Construction of Multivariate Polynomials with Preassigned Zeros
EUROCAM '82 Proceedings of the European Computer Algebra Conference on Computer Algebra
Generalized normal forms and polynomial system solving
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Stable normal forms for polynomial system solving
Theoretical Computer Science
Upgraded methods for the effective computation of marked schemes on a strongly stable ideal
Journal of Symbolic Computation
An efficient implementation of the algorithm computing the Borel-fixed points of a Hilbert scheme
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
A Borel open cover of the Hilbert scheme
Journal of Symbolic Computation
Hi-index | 0.00 |
Let J be a strongly stable monomial ideal in S=K[x"0,...,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 Grobner basis and its constructive capabilities. Indeed, although not every J-marked basis is a Grobner basis with respect to some term order, a sort of reduced form modulo I@?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 an 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 ofJ-marked bases analogous to those of Grobner bases about syzygies.