Search arXivSearch

arXiv · 1210.1815

Differential Type Operators and Gröbner-Shirshov Bases

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. As it turns out, these two classes of operators correspond to those that possess Gröbner-Shirshov bases under two different monomial orderings. Working in this framework, and with the aid of 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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Li Guo, William Y. Sit, Ronghua Zhang. 2012-10-05. Differential Type Operators and Gröbner-Shirshov Bases. https://doi.org/10.1016/j.jsc.2012.05.014

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On solutions of singular Sylvester equations in quaternions

The quaternionic equations ax-xb=0 and ax-xb=c are investigated, which are called homogeneous and inhomogeneous Sylvester equations, respectively. Conditions for the existence of solutions are provided. In addition, the general and nonzero solutions to these equations are derived applying quaternion square roots.

math.RA

Positivity preservers over finite fields II

We say that a matrix over a finite field $\mathbb{F}_q$ is positive definite if it is symmetric and each of its leading principal minors is a nonzero square in $\mathbb{F}_q$. In previous work of the authors [J. Algebra, 2025], the entrywise positivity preservers on $M_n(\mathbb{F}_q)$ were classified in every case except when $n=2$, $q\equiv1\pmod4$, and $q$ is not a square. We settle this remaining case, thereby completing the classification of entrywise positivity preservers over every finite field and in every dimension $n\ge2$. Our proof is based on a novel idempotent reduction that not only resolves the remaining case but also yields a self-contained proof of the complete classification, while avoiding several technical results used in the earlier arguments. As a further application of the same reduction, we classify the entrywise preservers of strongly nonsingular matrices, i.e., matrices whose leading principal minors are all nonzero. We also prove a more general theorem in odd characteristic: for every prescribed sign pattern of nonzero leading principal minors of matrices of a fixed dimension $n\ge2$, the entrywise preservers are precisely the positive scalar multiples of field automorphisms. Thus, in odd characteristic, preserving any nonzero leading-principal-minor sign pattern surprisingly forces the preservation of every such sign pattern.

math.RA

Graphs of Moore-Penrose inverse of matrices possessing the treeangle property

It is known that the inverse of an invertible real square matrix satisfying the treeangle property, is a treediagonal matrix. A converse statement also holds. We show that the verbatim analogues are not true for the Moore-Penrose inverse, and obtain the precise structure of graphs corresponding to the Moore-Penrose inverse of matrices possessing the treeangle property.

math.RA