Skip to main content

Nouvelle Cuisine for the Computation of the Annihilating Ideal of f s

  • Conference paper
Computer Algebra in Scientific Computing (CASC 2005)

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

Included in the following conference series:

Abstract

Let f 1,..., f p be polynomials in C[x 1,..., x n ] and let D = D n be the n-th Weyl algebra. The annihilating ideal of \(f^{s}=f_{1}^{s1}...f_{p}^{sp}\) in D[s]=D[s 1,...,s p ] is a necessary step for the computation of the Bernstein-Sato ideals of f 1,..., f p .

We point out experimental differences among the efficiency of the available methods to obtain this annihilating ideal and provide some upper bounds for the complexity of its computation.

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

Access this chapter

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. Bahloul, R.: Algorithm for computing Bernstein-Sato ideals associated with a polynomial mapping. Journal of Symbolic Computation 32, 643–662 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bernstein, I.N.: The analytic continuation of generalized functions with respect to a parameter. Funct. Anal. 6, 273–285 (1972)

    MATH  Google Scholar 

  3. Bjork, J.E.: Dimensions over Algebras of Differential Operators (1973) (preprint)

    Google Scholar 

  4. Briançon, J., Maisonobe, P.: Remarques sur l’idéal de Bernstein associé à des polynômes. PUMA, 650, (2002) (preprint)

    Google Scholar 

  5. Budur, N., Saito, M.: Multiplier ideals, V-filtration and spectrum. arXiv:math.AG/0305118 (2003)

    Google Scholar 

  6. Bueso, J.L., Goméz-Torrecillas, J., Verschoren, A.: Algorithmic methods in non-commutative algebra. In: Applications to quantum groups. Mathematical modelling, Theory and applications, vol. 17. Kluwer Academic Publishers, Dordrecht (2004)

    Google Scholar 

  7. Gago-Vargas, J., Hartillo-Hermoso, M.I., Ucha-Enríquez, J.M.: On the computation of the annihilating ideal of a product of polynomials (in preparation)

    Google Scholar 

  8. Greuel, G.-M., Levandovskyy, V., Schönemann, H.: Singular::Plural 2.1. A Computer Algebra System for Noncommutative Polynomial Algebras. Centre for Computer Algebra, University of Kaiserslautern (2003), http://www.singular.uni-kl.de/plural

  9. Grigoriev, D.: Complexity of solving systems of linear equations over the rings of differential operators. In: Effective methods in algebraic geometry, Castiglioncello (1990); Progr. Math. vol. 94, pp. 195–202. Birkhauser, Boston (1991)

    Google Scholar 

  10. Hamm, H.A.: Remarks on asymptotic integrals, the polynomial of I.N. Bernstein and the Picard-Lefschetz monodromy. In: Several complex variables (Proc. Sympos. Pure Math. Vol. XXX, Part 1, Williams Coll., Williamstown, Mass. 1975), pp. 31–35. Amer. Math. Soc, Providence (1977)

    Google Scholar 

  11. Kashiwara, M.: B-functions and holonomic systems. Rationality of roots of B-functions. Invent. Math. 38(1), 33–53 (1976)

    MATH  MathSciNet  Google Scholar 

  12. Lichtin, B.: Generalized Dirichlet series and b-functions. Compositio Math. 65, 81–120 (1988)

    MATH  MathSciNet  Google Scholar 

  13. Malgrange, B.: Le polynôme de Bernstein d’une singularité isolée. In: Fourier integral operators and partial differential equations (Colloq. Internat., Univ. Nice, Nice, 1974). Lecture Notes in Math., vol. 459, pp. 98–119. Springer, New York (1975)

    Chapter  Google Scholar 

  14. Mayr, E.W., Meyer, A.R.: The complexity of the word problems for commutative semigroups and polynomial ideals. Adv. in Math. 46(3), 305–329 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  15. Noro, M., Shimoyama, T., Takeshima, T.: A Computer Algebra System Risa/Asir (2000), Available at ftp://archives.cs.ehime-u.ac.jp/pub/asir2000/

  16. Oaku, T.: An algorithm of computing b-functions. Duke Math. J. 87, 115–132 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  17. Oaku, T., Takayama, N.: An algorithm for de Rham cohomology groups of the complement of an affine variety via D-module computation. Journal of Pure and Applied Algebra 139, 201–233 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  18. Sabbah, C.: Proximité évanescente I. La structure polaire d’un D-Module. Apendice en collaboration avec F.J. Castro Jiménez. Compositio Math. 62, 283–328 (1987)

    MATH  MathSciNet  Google Scholar 

  19. Sabbah, C.: Proximité évanescente II. Equations fonctionelles pour plusieurs fonctions analytiques. Compositio Math. 64, 213–241 (1987)

    MATH  MathSciNet  Google Scholar 

  20. Seidenberg, A.: Constructions in algebra. Trans. Amer. Math. Soc. 197, 273–313 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  21. Stafford, J.T.: Module structure of Weyl algebras. J. London Math. Soc. (2) 18(3), 429–442 (1978)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gago-Vargas, J., Hartillo-Hermoso, M.I., Ucha-Enríquez, J.M. (2005). Nouvelle Cuisine for the Computation of the Annihilating Ideal of f s . In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2005. Lecture Notes in Computer Science, vol 3718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11555964_14

Download citation

  • DOI: https://doi.org/10.1007/11555964_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28966-1

  • Online ISBN: 978-3-540-32070-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics