Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Computer Algebra in Scientific Computing

CASC 2017: Computer Algebra in Scientific Computing pp 313–328Cite as

Algorithms for Zero-Dimensional Ideals Using Linear Recurrent Sequences

  • Conference paper
  • First Online:

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

Abstract

Inspired by Faugère and Mou’s sparse FGLM algorithm, we show how using linear recurrent multi-dimensional sequences can allow one to perform operations such as the primary decomposition of an ideal, by computing of the annihilator of one or several such sequences.

This is a preview of subscription content, 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   59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   79.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

Learn about institutional subscriptions

References

  1. Berthomieu, J., Boyer, B., Faugère, J.-C.: Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences. J. Symb. Comput. 83, 36–67 (2016)

    Article  MATH  Google Scholar 

  2. Berthomieu, J., Faugère, J.-C.: Guessing linear recurrence relations of sequence tuples and P-recursive sequences with linear algebra. In: ISSAC 2016, pp. 95–102. ACM (2016)

    Google Scholar 

  3. Berthomieu, J., Faugère, J.-C.: In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the non adaptive variants. hal-01516708, May 2017

    Google Scholar 

  4. Bostan, A., Salvy, B., Schost, É.: Fast algorithms for zero-dimensional polynomial systems using duality. AAECC 14, 239–272 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  5. Brachat, J., Comon, P., Mourrain, B., Tsigaridas, E.: Symmetric tensor decomposition. Linear Algebra Appl. 433(11), 1851–1872 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  6. Dahan, X., Moreno Maza, M., Schost, É., Xie, Y.: On the complexity of the D5 principle. In: Transgressive Computing, pp. 149-168 (2006)

    Google Scholar 

  7. Della Dora, J., Dicrescenzo, C., Duval, D.: About a new method for computing in algebraic number fields. In: Caviness, B.F. (ed.) EUROCAL 1985. LNCS, vol. 204, pp. 289–290. Springer, Heidelberg (1985). doi:10.1007/3-540-15984-3_279

    Chapter  Google Scholar 

  8. Eisenbud, D.: Commutative Algebra: With a View Toward Algebraic Geometry, vol. 150. Springer Science & Business Media, New York (2013). doi:10.1007/978-1-4612-5350-1

    MATH  Google Scholar 

  9. Faugère, J.-C., Gaudry, P., Huot, L., Renault, G.: Polynomial Systems Solving by Fast Linear Algebra (2013). https://hal.archives-ouvertes.fr/hal-00816724

  10. Faugère, J.-C., Gaudry, P., Huot, L., Renault, G.: Sub-cubic change of ordering for Gröbner basis: a probabilistic approach. In: ISSAC 2014, pp. 170-177. ACM (2014)

    Google Scholar 

  11. Faugère, J.-C., Gianni, P., Lazard, D., Mora, T.: Efficient computation of zero-dimensional Gröbner bases by change of ordering. J. Symb. Comput. 16(4), 329–344 (1993)

    Article  MATH  Google Scholar 

  12. Faugère, J.-C., Mou, C.: Sparse FGLM algorithms. J. Symb. Comput. 80(3), 538–569 (2017)

    Article  MathSciNet  Google Scholar 

  13. von zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 3rd edn. Cambridge University Press, Cambridge (2013)

    Book  MATH  Google Scholar 

  14. Gianni, P., Mora, T.: Algebrric solution of systems of polynomirl equations using Groebher bases. In: Huguet, L., Poli, A. (eds.) AAECC 1987. LNCS, vol. 356, pp. 247–257. Springer, Heidelberg (1989). doi:10.1007/3-540-51082-6_83

    Chapter  Google Scholar 

  15. Gröbner, W.: Über irreduzible Ideale in kommutativen Ringen. Math. Ann. 110(1), 197–222 (1935)

    Article  MathSciNet  MATH  Google Scholar 

  16. Macaulay, F.S.: Modern algebra and polynomial ideals. Math. Proc. Camb. Philos. Soc. 30(1), 27–46 (1934)

    Article  MATH  Google Scholar 

  17. Marinari, M.G., Mora, T., Möller, H.M.: Gröbner bases of ideals defined by functionals with an application to ideals of projective points. AAECC 4, 103–145 (1993)

    Article  MATH  Google Scholar 

  18. Moreno-Socías, G.: Autour de la fonction de Hilbert-Samuel (escaliers d’ideaux polynomiaux). Ph.D. thesis, École polytechnique (1991)

    Google Scholar 

  19. Mourrain, B.: Fast algorithm for border bases of Artinian Gorenstein algebras. ArXiv e-prints, May 2017

    Google Scholar 

  20. Neiger, V.: Bases of relations in one or several variables: fast algorithms and applications. Ph.D. thesis, École Normale Supérieure de Lyon, November 2016

    Google Scholar 

  21. Rouillier, F.: Solving zero-dimensional systems through the rational univariate representation. AAECC 9(5), 433–461 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  22. Sakata, S.: Extension of the Berlekamp-Massey algorithm to \(N\) dimensions. Inform. Comput. 84(2), 207–239 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  23. Shoup, V.: A new polynomial factorization algorithm and its implementation. J. Symb. Comput. 20(4), 363–397 (1995)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

We thank the reviewers for their remarks and suggestions. The third author is supported by an NSERC Discovery Grant.

Author information

Authors and Affiliations

  1. Department of Applied Mathematics and Computer Science, Technical University of Denmark, Lyngby, Denmark

    Vincent Neiger

  2. Cheriton School of Computer Science, University of Waterloo, Waterloo, Canada

    Hamid Rahkooy & Éric Schost

Authors
  1. Vincent Neiger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hamid Rahkooy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Éric Schost
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vincent Neiger .

Editor information

Editors and Affiliations

  1. Joint Institute of Nuclear Research, Dubna, Russia

    Vladimir P. Gerdt

  2. Universität Kassel, Kassel, Germany

    Wolfram Koepf

  3. Universität Kassel, Kassel, Germany

    Werner M. Seiler

  4. Russian Academy of Sciences, Novosibirsk, Russia

    Evgenii V. Vorozhtsov

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Neiger, V., Rahkooy, H., Schost, É. (2017). Algorithms for Zero-Dimensional Ideals Using Linear Recurrent Sequences. In: Gerdt, V., Koepf, W., Seiler, W., Vorozhtsov, E. (eds) Computer Algebra in Scientific Computing. CASC 2017. Lecture Notes in Computer Science(), vol 10490. Springer, Cham. https://doi.org/10.1007/978-3-319-66320-3_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-66320-3_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-66319-7

  • Online ISBN: 978-3-319-66320-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation