Skip to main content
SpringerLink
Log in

Computing Gröbner Bases for Vanishing Ideals of Finite Sets of Points

  • Conference paper
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3857))

Abstract

We present an algorithm to compute a Gröbner basis for the vanishing ideal of a finite set of points in an affine space. For distinct points the algorithm is a generalization of univariate Newton interpolation. Computational evidence suggests that our method compares favorably with previous algorithms when the number of variables is small relative to the number of points. We also present a preprocessing technique that significantly enhances the performance of all the algorithms considered. For points with multiplicities, we adapt our algorithm to compute the vanishing ideal via Taylor expansions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abbott, J., Bigatti, A., Kreuzer, M., Robbiano, L.: Computing ideals of points. J. Symbolic Comput. 30, 341–356 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Buchberger, B., Möller, H.M.: The construction of multivariate polynomials with preassigned zeros. In: Calmet, J. (ed.) ISSAC 1982 and EUROCAM 1982. LNCS, vol. 144. Springer, Heidelberg (1982)

    Google Scholar 

  3. Cerlienco, L., Mureddu, M.: From algebraic sets to monomial linear bases by means of combinatorial algorithms. Formal power series and algebraic combinatorics Montreal, PQ, 1992; Discrete Math. 139(1-3), 73–87 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  4. Cox, D., Little, J., O’Shea, D.: Ideals, varieties, and algorithms, 2nd edn. Undergraduate Texts in Mathematics. Springer, New York (1997)

    Google Scholar 

  5. Cox, D., Little, J., O’Shea, D.: Using algebraic geometry. Graduate Texts in Mathematics, vol. 185. Springer, New York (1998)

    MATH  Google Scholar 

  6. Farr, J.B, Gao, S.: Gröbner bases and generalized Padé approximation. Math. Comp. (to appear)

    Google Scholar 

  7. Jeffrey, B.F., Gao, S.: Gröbner bases, Padé approximation, and decoding of linear codes. In: Evans, D., et al. (eds.) Coding Theory and Quantum Computing. Contemp. Math, vol. 381, pp. 3–18. Amer. Math. Soc, Providence (2005)

    Google Scholar 

  8. Faugere, J., Gianni, P., Lazard, D., Mora, T.: Efficient computation of zero-dimensional Gröbner bases by change of ordering. J. Symbolic Comput. 16, 329–344 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  9. Fitzpatrick, P., O’Keeffe, H.: Gröbner basis solutions of constrained interpolation problems. Fourth special issue on linear systems and control. Linear Algebra Appl. 351/352, 533–551 (2002)

    MathSciNet  Google Scholar 

  10. Gasca, M., Sauer, T.: Polynomial interpolation in several variables, in Multivariate polynomial interpolation. Adv. Comput. Math. 12(4), 377–410 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  11. Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraic-geometric codes. IEEE Transactions on Information Theory 46(6), 1757–1767 (1999)

    Article  MathSciNet  Google Scholar 

  12. Koetter, R., Vardy, A.: Algebraic Soft-Decision Decoding of Reed-Solomon Codes. IEEE Transactions on Information Theory 49, 2809–2825 (2003)

    Article  MathSciNet  Google Scholar 

  13. Laubenbacher, R., Stigler, B.: A computational algebra approach to the reverse engineering of gene regulatory networks. Journal of Theoretical Biology 229, 523–537 (2004)

    Article  MathSciNet  Google Scholar 

  14. Marinari, M.G., Möller, H.M., Mora, T.: Gröbner bases of ideals defined by functionals with an application to ideals of projective points. Appl. Algebra Engrg. Comm. Comput. 4(2), 103–145 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  15. Marinari, M.G., Möller, H.M., Mora, T.: On multiplicities in polynomial system solving. Trans. Amer. Math. Soc. 348(8), 3283–3321 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  16. Pistone, G., Riccomagno, E., Wynn, H.P.: Algebraic Statistics: Computational Commutative Algebra in Statistics. Monographs on Statistics & Applied Probability 89. Chapman & Hall/CRC, Boca Raton (2001)

    MATH  Google Scholar 

  17. Robbiano, L.: Gröbner bases and statistics. Gröben bases and applications (Linz, 1998). London Math. Soc. Lecture Note Ser., vol. 251, pp. 179–204. Cambridge Univ. Press, Cambridge (1998)

    Google Scholar 

  18. Sudan, M.: Decoding of Reed Solomon codes beyond the error-correction bound. J. Complexity 13(1), 180–193 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  19. Shuhong Gao’s webpage, http://www.math.clemson.edu/~sgao/

  20. David Joyner’s webpage, http://cadigweb.ew.usna.edu/~wdj/gap/curves/

Download references

Author information

Authors and Affiliations

  1. Simon Fraser University, Burnaby, B.C., V5A 1S6, Canada

    Jeffrey B. Farr

  2. Clemson University, Clemson, SC, 29634-0975, USA

    Shuhong Gao

Authors
  1. Jeffrey B. Farr
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shuhong Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering, University of Hawaii, Honolulu, USA

    Marc P. C. Fossorier

  2. National Institute of Advanced Industrial Science and Technology (AIST), Research Center for Information Security (RCIS),  

    Hideki Imai

  3. Department of Electrical and Computer Engineering, University of California, CA 95616, Davis,  

    Shu Lin

  4. University Paul Sabatier, AAECC/IRIT, 118 route de Narbonne, 31300, Toulouse cedex, France

    Alain Poli

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Farr, J.B., Gao, S. (2006). Computing Gröbner Bases for Vanishing Ideals of Finite Sets of Points. In: Fossorier, M.P.C., Imai, H., Lin, S., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2006. Lecture Notes in Computer Science, vol 3857. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11617983_11

Download citation

  • DOI: https://doi.org/10.1007/11617983_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-31423-3

  • Online ISBN: 978-3-540-31424-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation