Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/1993886.1993911acmconferencesArticle/Chapter ViewAbstractPublication PagesissacConference Proceedingsconference-collections
research-article

An algorithm for computing set-theoretic generators of an algebraic variety

Published: 08 June 2011 Publication History

Abstract

Based on Eisenbud's idea (see [Eisenbud, D., Evans, G., 1973. Every algebraic set in n-space is the intersection of n hypersurfaces. Invent. Math. 19, 107-112]), we present an algorithm for computing set-theoretic generators for any algebraic variety in the affine n-space, which consists of at most n polynomials. With minor modifications, this algorithm is also valid for projective algebraic variety in projective n-space.

References

[1]
Abhyankar, S.S., 1973. On Macaulay's example. In: Conf. Comm. Algebra, Lawrence 1972, Springer LNM, vol311, 1--16.
[2]
Atiyah, M.F., Macdonald, I.G., 1969. Introduction to Commutative Algebra, Addison-Wesley Publishing Company.
[3]
Chou, S.C. and Gao, X.S., 1991. On the dimension of an arbitrary ascending chain. Chinese Bull. of Sci. 38, 799--804.
[4]
Cox, D., Little, J., O'Shea, D., 1996. Ideals, Varieties, and Algorithms, Second Edition. Springer.
[5]
Eisenbud, D., Evans, G., 1973. Every algebraic set in n-space is the intersection of n hypersurfaces. Invent. Math. 19, 107--112.
[6]
Eisenbud, D., Sturmfels, B., 1994. Finding sparse systems of parameters. Journal of Pure and Applied Algebra, 143--157.
[7]
Eisenbud, D., 1994. Commutative Algebra with a View toward Algebraic Geometry. Graduate Texts in Mathematics. Springer-Verlag New York.
[8]
Fortuna, E., Gianni, P., Trager, B., 2009. Generators of the ideal of an algebraic space curve. Journal of Symbolic Computation 44, 1234--1254.
[9]
Gianni, P., Trager, B., Zacharias, G., 1988. Grobner bases and primary decomposition of polynomial ideals. Journal of Symbolic Computation 6, 149--167.
[10]
Hubert, E., 2003. Notes on triangular sets and triangulation-decomposition algorithms I: Polynomial systems. In Symbolic and Numerical Scientific Computing 2001, pages 1--39.
[11]
Jia, X., Wang, H., Goldmand, R., 2010. Set-theoretic generators of rational space curves. Journal of Symbolic Computation 45, 414--433.
[12]
Kneser, M., 1960. Uber die Darstellung algebraischer Raumkurven als Durchschnitte von Flachen. Arch. Math. 11, 157--158.
[13]
Kalkbrener, M., 1993. A generalized euclidean algorithm for computing triangular representations of algebraic varieties. J. Symb. Comp.15, 143--167.
[14]
Kronecher, L., 1882. Grundzuge einer arithmetischen Theorie der algebraischen Großen. J. Reine Angew. Math. 92, 1--123.
[15]
Lemaire, F., Moreno Maza, M., Pan, W., and Xie, Y., 2008. When does (T) equal Sat(T)?. In Proc. ISSAC'2008, 207--214. ACM Press.
[16]
Laplagne, S., 2006. An algorithm for the computation of the radical of an ideal. Proceedings of the 2006 international symposium on Symbolic and algebraic computation, July 09--12, Genoa, Italy.
[17]
Maza, M.M., Rioboo, R., 1995. Polynomial gcd computations over towers of algebraic extensions. In Applied algebra, algebraic algorithms and errorcorrecting codes, 365--382. Springer, Berlin.
[18]
Moh, T.T., 1974. On the unboundedness of generators of prime ideals in power series rings of three variables, J.Math.Soc.Japan 26, 722--734.
[19]
Sturmfels, B., 2002. Solving Systems of Polynomial Equations. Amer.Math.Soc.
[20]
Schauenburg, P., 2007. A Grobner-based treatment of elimination theory for affine varieties. Journal of Symbolic Computation 42, 859--870.
[21]
Van der Waerden, B.L., 1941. Review. Zentralblatt fur Math. 24, 276.
[22]
Wu, W.T., 2003. Mathematics Machenization. Science Press/Kluwer, Beijing.
[23]
Yang, L. and Zhang, J., 1991. Searching dependency between algebraic equations: an algorithm applied to automated reasoning. Technical report ic/91/6, International Atomic Engery Angency, Miramare, Trieste, Italy.

Index Terms

  1. An algorithm for computing set-theoretic generators of an algebraic variety

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    ISSAC '11: Proceedings of the 36th international symposium on Symbolic and algebraic computation
    June 2011
    372 pages
    ISBN:9781450306751
    DOI:10.1145/1993886
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 08 June 2011

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. grobner basis
    2. regular sequence
    3. set-theoretic generators

    Qualifiers

    • Research-article

    Conference

    ISSAC '11
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 395 of 838 submissions, 47%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 86
      Total Downloads
    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 24 Sep 2024

    Other Metrics

    Citations

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media