Abstract
A long standing problem of Gian-Carlo Rota for associative algebras is the classification of all linear operators that can be defined on them. In the 1970s, there were only a few known operators, for example, the derivative operator, the difference operator, the average operator, and the Rota–Baxter operator. A few more appeared after Rota posed his problem. However, little progress was made to solve this problem in general. In part, this is because the precise meaning of the problem is not so well understood. In this paper, we propose a formulation of the problem using the framework of operated algebras and viewing an associative algebra with a linear operator as one that satisfies a certain operated polynomial identity. This framework also allows us to apply theories of rewriting systems and Gröbner–Shirshov bases. To narrow our focus more on the operators that Rota was interested in, we further consider two particular classes of operators, namely, those that generalize differential or Rota–Baxter operators. These two classes of operators correspond to those that possess Gröbner–Shirshov bases under two different monomial orderings. Using this framework and computer algebra, we are able to come up with a list of these two classes of operators, and provide some evidence that these lists may be complete. Our search has revealed quite a few new operators of these types whose properties are expected to be similar to the differential operator and Rota–Baxter operator respectively.Recently, a more unified approach has emerged in related areas, such as difference algebra and differential algebra, and Rota–Baxter algebra and Nijenhuis algebra. The similarities in these theories can be more efficiently explored by advances on Rotaʼs problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.