<p>This work is devoted to the symbolic computation of centralizers of ordinary differential operators (ODOs), in the ring of differential operators. Starting with an operator <InlineEquation ID="IEq1"> <EquationSource Format="MATHML"><math> <mi>L</mi> </math></EquationSource> <EquationSource Format="TEX">$L$</EquationSource> </InlineEquation> of order <InlineEquation ID="IEq2"> <EquationSource Format="MATHML"><math> <mi>n</mi> </math></EquationSource> <EquationSource Format="TEX">$n$</EquationSource> </InlineEquation> and the order <InlineEquation ID="IEq3"> <EquationSource Format="MATHML"><math> <mi mathvariant="fraktur">m</mi> </math></EquationSource> <EquationSource Format="TEX">$\mathfrak{m}$</EquationSource> </InlineEquation> of a non-trivial operator in its centralizer, which is not a multiple of <InlineEquation ID="IEq4"> <EquationSource Format="MATHML"><math> <mi>n</mi> </math></EquationSource> <EquationSource Format="TEX">$n$</EquationSource> </InlineEquation>, a finite set of generators of a subalgebra of the centralizer is obtained, maximal of a certain rank <InlineEquation ID="IEq5"> <EquationSource Format="MATHML"><math> <mi>R</mi> </math></EquationSource> <EquationSource Format="TEX">$R$</EquationSource> </InlineEquation>, the greatest common divisor of all orders of its elements. The true rank <InlineEquation ID="IEq6"> <EquationSource Format="MATHML"><math> <mi>r</mi> </math></EquationSource> <EquationSource Format="TEX">$r$</EquationSource> </InlineEquation> of the centralizer is unknown to start unless <InlineEquation ID="IEq7"> <EquationSource Format="MATHML"><math> <mo stretchy="false">(</mo> <mi>n</mi> <mo>,</mo> <mi mathvariant="fraktur">m</mi> <mo stretchy="false">)</mo> <mo>=</mo> <mn>1</mn> </math></EquationSource> <EquationSource Format="TEX">$(n,\mathfrak{m})=1$</EquationSource> </InlineEquation> since <InlineEquation ID="IEq8"> <EquationSource Format="MATHML"><math> <mn>1</mn> <mo>≤</mo> <mi>r</mi> <mo>≤</mo> <mi>R</mi> <mo>≤</mo> <mo stretchy="false">(</mo> <mi>n</mi> <mo>,</mo> <mi mathvariant="fraktur">m</mi> <mo stretchy="false">)</mo> </math></EquationSource> <EquationSource Format="TEX">$1\leq r\leq R\leq (n,\mathfrak{m})$</EquationSource> </InlineEquation>, and remains unknown unless our algorithm returns <InlineEquation ID="IEq9"> <EquationSource Format="MATHML"><math> <mi>R</mi> <mo>=</mo> <mn>1</mn> </math></EquationSource> <EquationSource Format="TEX">$R=1$</EquationSource> </InlineEquation>. Ours is a direct approach based on solving the systems of equations of the stationary Gelfand-Dickey (GD) hierarchies, which after substituting the coefficients of <InlineEquation ID="IEq10"> <EquationSource Format="MATHML"><math> <mi>L</mi> </math></EquationSource> <EquationSource Format="TEX">$L$</EquationSource> </InlineEquation> become linear, and whose solution sets form a flag of constants. We are assuming that the coefficients of <InlineEquation ID="IEq11"> <EquationSource Format="MATHML"><math> <mi>L</mi> </math></EquationSource> <EquationSource Format="TEX">$L$</EquationSource> </InlineEquation> belong to a computable differential field. In addition, by considering parametric coefficients, we develop an algorithm to generate families of ODOs with non-trivial centralizer, whose coefficients belong to a previously chosen differential field. Our algorithms are implemented in SageMath.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Effective Computation of Centralizers of ODOs

  • Antonio Jiménez-Pastor,
  • Sonia L. Rueda

摘要

This work is devoted to the symbolic computation of centralizers of ordinary differential operators (ODOs), in the ring of differential operators. Starting with an operator L $L$ of order n $n$ and the order m $\mathfrak{m}$ of a non-trivial operator in its centralizer, which is not a multiple of n $n$ , a finite set of generators of a subalgebra of the centralizer is obtained, maximal of a certain rank R $R$ , the greatest common divisor of all orders of its elements. The true rank r $r$ of the centralizer is unknown to start unless ( n , m ) = 1 $(n,\mathfrak{m})=1$ since 1 r R ( n , m ) $1\leq r\leq R\leq (n,\mathfrak{m})$ , and remains unknown unless our algorithm returns R = 1 $R=1$ . Ours is a direct approach based on solving the systems of equations of the stationary Gelfand-Dickey (GD) hierarchies, which after substituting the coefficients of L $L$ become linear, and whose solution sets form a flag of constants. We are assuming that the coefficients of L $L$ belong to a computable differential field. In addition, by considering parametric coefficients, we develop an algorithm to generate families of ODOs with non-trivial centralizer, whose coefficients belong to a previously chosen differential field. Our algorithms are implemented in SageMath.