Effective computation of centralizers of ODOs
Abstract
This work is devoted to computing the centralizer of an ordinary differential operator (ODO) in the ring of differential operators. Non-trivial centralizers are known to be coordinate rings of spectral curves and contain the ring of polynomials , with coefficients in the field of constants of . We give an algorithm to compute a basis of as a -module. Our approach combines results by K. Goodearl in 1985 with solving the systems of equations of the stationary Gelfand-Dickey (GD) hierarchy, which after substituting the coefficients of become linear, and whose solution sets form a flag of constants. We are assuming that the coefficients of belong to a differential algebraic extension of . In addition, by considering parametric coefficients we develop an algorithm to generate families of ODOs with non trivial centralizer, in particular algebro-geometric, whose coefficients are solutions in of systems of the stationary GD hierarchy.
Keywords
Cite
@article{arxiv.2505.01289,
title = {Effective computation of centralizers of ODOs},
author = {Antonio Jiménez-Pastor and Sonia L. Rueda},
journal= {arXiv preprint arXiv:2505.01289},
year = {2025}
}