Daniel Andres
ABSTRACT
We present a general algorithm for computing an intersection of a left ideal of an associative algebra over a field with a subalgebra, generated by a single element. We show applications of this algorithm in different algebraic situations and describe our implementation in Singular. Among other, we use this algorithm in computational D-module theory for computing e.g. the Bernstein-Sato polynomial of a single polynomial with several approaches. We also present a new method, having no analogues yet, for the computation of the Bernstein-Sato polynomial of an affine variety. Also, we provide a new proof of the algorithm by Briançon-Maisonobe for the computation of the s-parametric annihilator of a polynomial.
- J. Briancon and P. Maisonobe. Remarques sur l'idéal de Bernstein associé à des polynômes. Preprint no. 650, Univ. Nice Sophia-Antipolis, 2002.Google Scholar
- N. Budur, M. MustaţÎ, and M. Saito. Bernstein-Sato polynomials of arbitrary varieties. Compos. Math., 142(3):779--797, 2006.Google ScholarCross Ref
- J. Bueso, J. Gómez-Torrecillas, and A. Verschoren. Algorithmic methods in non-commutative algebra. Kluwer, 2003.Google ScholarCross Ref
- S. Coutinho. A primer of algebraic D-modules. Cambridge Univ. Press., 1995.Google ScholarCross Ref
- J. C. Faugere, P. Gianni, D. Lazard, and T. Mora. Efficient computation of zero-dimensional Gröbner bases by change of ordering. J. Symb. Comp., 16(4):329--344, 1993. Google ScholarDigital Library
- G.-M. Greuel, V. Levandovskyy, and H. Schönemann. Plural. A Singular 3.0 subsystem for computations with non-commutative polynomial algebras. University of Kaiserslautern, 2006.Google Scholar
- G.-M. Greuel, G. Pfister, and H. Schönemann. Singular 3.1.0 - A computer algebra system for polynomial computations. University of Kaiserslautern, 2009.Google Scholar
- M. Kashiwara. B-functions and holonomic systems. Rationality of roots of B-functions. Invent. Math., 38(1):33--53, 1976/77.Google ScholarCross Ref
- V. Levandovskyy. On preimages of ideals in certain non-commutative algebras. In Computational Commutative and Non-Commutative Algebraic Geometry. IOS Press, 2005.Google Scholar
- V. Levandovskyy. Intersection of ideals with non-commutative subalgebras. In Proc. ISSAC'06, pages 212--219. ACM, 2006. Google ScholarDigital Library
- V. Levandovskyy and J. Morales. Computational D-module theory with singular, comparison with other systems and two new algorithms. In Proc. ISSAC'08, pages 173--180. ACM, 2008. Google ScholarDigital Library
- V. Levandovskyy and H. Schönemann. Plural - a computer algebra system for noncommutative polynomial algebras. In Proc. ISSAC'03, pages 176--183. ACM, 2003. Google ScholarDigital Library
- J. McConnell and J. Robson. Noncommutative Noetherian rings. AMS, 2001.Google ScholarCross Ref
- M. Noro. An efficient modular algorithm for computing the global b-function. In Mathematical software (Beijing'02), pages 147--157. World Sci. Publ., 2002.Google Scholar
- M. Noro, T. Shimoyama, and T. Takeshima. Risa/Asir, an open source general computer algebra system, 2006.Google Scholar
- T. Oaku. Algorithms for the b-function and D-modules associated with a polynomial. J. Pure Appl. Algebra, 117/118:495--518, 1997.Google ScholarCross Ref
- M. Saito, B. Sturmfels, and N. Takayama. Gröbner deformations of hypergeometric differential equations. Springer, 2000.Google ScholarCross Ref
- N. Takayama. KAN/SM1, a Gröbner engine for the ring of differential and difference operators, 2003.Google Scholar
- H. Tsai and A. Leykin. D-modules package for Macaulay 2 - algorithms for D-modules, 2006.Google Scholar
Index Terms
- Principal intersection and bernstein-sato polynomial of an affine variety
Recommendations
Computational D-module theory with singular, comparison with other systems and two new algorithms
ISSAC '08: Proceedings of the twenty-first international symposium on Symbolic and algebraic computationWe present the new implementation of core functions for the computational D-module theory. It is realized as a library dmod.lib in the computer algebra system Singular. We show both theoretical advances, such as the LOT and checkRoot algorithms as well ...
Algorithms for Bernstein--Sato polynomials and multiplier ideals
ISSAC '10: Proceedings of the 2010 International Symposium on Symbolic and Algebraic ComputationThe Bernstein--Sato polynomial (or global b-function) is an important invariant in singularity theory, which can be computed using symbolic methods in the theory of D-modules. After providing a survey of known algorithms for computing the global b-...
Intersection of ideals with non-commutative subalgebras
ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computationComputation of an intersection of a left ideal with a subalgebra, which is not fully investigated until now, is important for different areas of mathematics.We present an algorithm for the computation of the preimage of a left ideal under a morphism of ...
Comments