• Login
    View Item 
    •   DSpace@RPI Home
    • Rensselaer Libraries
    • RPI Theses Online (Complete)
    • View Item
    •   DSpace@RPI Home
    • Rensselaer Libraries
    • RPI Theses Online (Complete)
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    On the complexity of computing Gröbner bases for zero dimensional polynomial ideals

    Author
    Lakshman, Yagati N.
    View/Open
    174945_thesis.pdf (3.027Mb)
    Other Contributors
    Kaltofen, Erich; Caviness, Bobby F.; Goldberg, Mark; Krishnamoorthy, M. S.; McLaughlin, H. W.; usser, David R.;
    Date Issued
    1990-12
    Subject
    Computer science
    Degree
    PhD;
    Terms of Use
    This electronic version is a licensed copy owned by Rensselaer Polytechnic Institute, Troy, NY. Copyright of original work retained by author.;
    Metadata
    Show full item record
    URI
    https://hdl.handle.net/20.500.13015/1352
    Abstract
    We also generalize the change of basis algorithm of Faugère et al. to derive efficient new algorithms for computing Gröbner bases for intersections, quotients and images under linear transformation for zero-dimensional ideals.; In this thesis, we investigate the complexity of computing Gröbner bases for zero-dimensional ideals in the ring of polynomials in n variables with rational number coefficients. Given a zero-dimensional ideal presented by a finite basis {f1,f2,...,fr} with the degrees of fi bounded by d, we show an O(dcn) (for a small constant c) upper bound on the number of operations (+,-,×,/) involving rational numbers needed to compute reduced Gröbner bases for the ideal, its radical and all of its primary components. This bound improves the previously known bound of O(r3dO(n3)). The main tools of our investigation are generalized Macaulay resultants and the change of basis algorithm of Faugere, Gianni, Lazard and Mora. Our strategy is to compute a Gröbner basis for the radical of the given ideal first, using a generalization of Macaulay's resultant. We then compute Gröbner bases for all the associated prime ideals from which we construct Gröbner bases for each of the primary ideals that contains the given ideal. The Gröbner bases for the primary ideals are then stitched together to obtain a Gröbner basis for the original ideal.; Gröbner bases have come to occupy a central place in Computational Algebra due to the wide range of problems that they help to solve. The problems that can be tackled include testing for ideal membership, testing for radical membership, deciding invertibility of polynomial maps and equation solving to name a few. Because of its applicability, there is a great interest in designing efficient algorithms for computing Gröbner bases and a need to understand the complexity of any such algorithm. It is also known that the computation of Gröbner bases is very hard in general (due to the exponential space lower bound on the complexity of testing for ideal membership, shown by Mayr and Meyer). However, it is worthwhile investigating whether Gröbner bases can be computed for interesting sub-families of ideals, in much less time than that implied by Mayr and Meyer's doubly exponential lower bound.;
    Description
    December 1990; School of Science
    Department
    Dept. of Computer Science;
    Publisher
    Rensselaer Polytechnic Institute, Troy, NY
    Relationships
    Rensselaer Theses and Dissertations Online Collection;
    Access
    Restricted to current Rensselaer faculty, staff and students. Access inquiries may be directed to the Rensselaer Libraries.;
    Collections
    • RPI Theses Online (Complete)

    Browse

    All of DSpace@RPICommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Login

    DSpace software copyright © 2002-2022  DuraSpace
    Contact Us | Send Feedback
    DSpace Express is a service operated by 
    Atmire NV