Abstract
We propose a general algorithmic approach to noncommutative operator algebras generated by linear operators using quotients of tensor algebras. In order to work with reduction systems in tensor algebras, Bergman’s setting provides a tensor analog of Gröbner bases. We discuss a modification of Bergman’s setting that allows for smaller reduction systems and tends to make computations more efficient. Verification of the confluence criterion based on S-polynomials has been implemented as a Mathematica package. Our implementation can also be used for computer-assisted construction of Gröbner bases starting from basic identities of operators. We illustrate our approach and the software using differential and integro-differential operators as examples.
All authors were supported by the Austrian Science Fund (FWF): P27229.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Bergman, G.M.: The diamond lemma for ring theory. Adv. Math. 29, 178–218 (1978)
Bokut, L.A., Chen, Y.: Gröbner-Shirshov bases and their calculation. Bull. Math. Sci. 4, 325–395 (2014)
Buchberger, B.: An algorithm for finding the bases elements of the residue class ring modulo a zero dimensional polynomial ideal (German). Ph.D. thesis, University of Innsbruck (1965)
Gómez-Torrecillas, J.: Basic module theory over non-commutative rings with computational aspects of operator algebras. In: Barkatou, M., Cluzeau, T., Regensburger, G., Rosenkranz, M. (eds.) AADIOS 2012. LNCS, vol. 8372, pp. 23–82. Springer, Heidelberg (2014)
Guo, L., Regensburger, G., Rosenkranz, M.: On integro-differential algebras. J. Pure Appl. Algebra 218, 456–473 (2014)
Hossein Poor, J., Raab, C.G., Regensburger, G.: Algorithmic operator algebras via normal forms for tensors. In: Proceedings of ISSAC 2016, p.8. ACM, New York (2016, to appear)
Knuth, D.E., Bendix, P.B.: Simple word problems in universal algebras. Computational Problems in Abstract Algebra, pp. 263–297. Pergamon, Oxford (1970)
Rosenkranz, M.: A new symbolic method for solving linear two-point boundary value problems on the level of operators. J. Symbolic Comput. 39, 171–199 (2005)
Rosenkranz, M., Regensburger, G.: Solving and factoring boundary problems for linear ordinary differential equations in differential algebras. J. Symbolic Comput. 43, 515–544 (2008)
Regensburger, G., Tec, L., Buchberger, B.: Symbolic analysis for boundary problems: from rewriting to parametrized Gröbner bases. Numerical and Symbolic Scientific Computing, pp. 273–331. Springer, Vienna (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Hossein Poor, J., Raab, C.G., Regensburger, G. (2016). Normal Forms for Operators via Gröbner Bases in Tensor Algebras. In: Greuel, GM., Koch, T., Paule, P., Sommese, A. (eds) Mathematical Software – ICMS 2016. ICMS 2016. Lecture Notes in Computer Science(), vol 9725. Springer, Cham. https://doi.org/10.1007/978-3-319-42432-3_65
Download citation
DOI: https://doi.org/10.1007/978-3-319-42432-3_65
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42431-6
Online ISBN: 978-3-319-42432-3
eBook Packages: Computer ScienceComputer Science (R0)