The Gröbner fan of an ideal

Authors:
Teo Mora;Lorenzo Robbiano
Affiliations:
-;-
Venue:
Journal of Symbolic Computation
Year:
1988

Citing 4
Cited 27

On the theory of graded structures

Journal of Symbolic Computation
Upper and Lower Bounds for the Degree of Groebner Bases

EUROSAM '84 Proceedings of the International Symposium on Symbolic and Algebraic Computation
Gröbner-Bases, Gaussian elimination and resolution of systems of algebraic equations

EUROCAL '83 Proceedings of the European Computer Algebra Conference on Computer Algebra
Term Orderings on the Polynominal Ring

EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2

Standard bases and geometric invariant theoryI. Initial ideals and state polytopes

Journal of Symbolic Computation
An algorithm for solving parametric linear systems

Journal of Symbolic Computation
A new notion of reduction: Generating universal Gröbner bases of ideals in K[x, y]

Journal of Symbolic Computation
A dynamic algorithm for Gröbner basis computation

ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Implicitization of hypersurfaces and curves by the Primbasissatz and basis conversion

ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Algorithms for the Toric Hilbert scheme

Computations in algebraic geometry with Macaulay 2
Cited References

Computer algebra handbook
The toric Hilbert scheme of a rank two lattice is smooth and irreducible

Journal of Combinatorial Theory Series A
Efficient Groebner walk conversion for implicitization of geometric objects

Computer Aided Geometric Design
Hensel fan

ACM Communications in Computer Algebra
Computing tropical varieties

Journal of Symbolic Computation
The generic Gröbner walk

Journal of Symbolic Computation
A new class of term orders for elimination

Journal of Symbolic Computation
A Gröbner fan method for biochemical network modeling

Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Universal characteristic decomposition of radical differential ideals

Journal of Symbolic Computation
Pareto Optima of Multicriteria Integer Linear Programs

INFORMS Journal on Computing
Efficient Groebner walk conversion for implicitization of geometric objects

Computer Aided Geometric Design
Computing Gröbner Bases within Linear Algebra

CASC '09 Proceedings of the 11th International Workshop on Computer Algebra in Scientific Computing
The Gröbner fan and Gröbner walk for modules

Journal of Symbolic Computation
Comprehensive Gröbner bases and regular rings

Journal of Symbolic Computation
Computing gröbner bases within linear algebra and its implementation

ACM Communications in Computer Algebra
Parameter estimation for Boolean models of biological networks

Theoretical Computer Science
A presentation of the gfan software

ICMS'06 Proceedings of the Second international conference on Mathematical Software
Betti numbers of polynomial hierarchical models for experimental designs

Annals of Mathematics and Artificial Intelligence
Upgraded methods for the effective computation of marked schemes on a strongly stable ideal

Journal of Symbolic Computation
On The Diversity Of Orderings On Strings

Fundamenta Informaticae
Converting subalgebra bases with the Sagbi walk

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

To every ideal I in the polynomial ring A:=k[X"1,..., X"n] new invariants are attached, such as the Grobner Fan F(I), the Grobner region G(I) and the set ATO(I) of the almost term-orderings of I, i.e. orderings which ''behave like'' term-orderings with respect to I. These invariants arise by considering the reduced Grobner bases of I with respect to all the term-orderings. Moreover F(I), G(I), ATO(I) can be got in a constructive way, as we show by producing a suitable algorithm which computes them.