arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1010.2652math.AP
收藏

线性偏微分算子分解为多个因子的障碍

Obstacles to the Factorization of Linear Partial Differential Operators into Several Factors

Ekaterina Shemyakova, Franz Winkler

摘要:

我们考虑线性偏微分算子的因子分解算法。我们引入几个新的理论概念,以简化这些考虑。我们定义了一个障碍和一个环的障碍因子分解。我们得到一些有趣的事实,例如,新的对象,它们是不变的规范变换。证明了构造因子分解算法的一个重要定理:因子分解从某一时刻起唯一定义.对于三阶和二阶算子,明确地找到了障碍.

英文摘要:

We consider algorithms for the factorization of linear partial differential operators. We introduce several new theoretical notions in order to simplify such considerations. We define an obstacle and a ring of obstacles to factorizations. We derive some interesting facts about the new objects, for instance, that they are invariant under gauge transformations. An important theorem for the construction of factoring algorithms is proved: a factorization is defined uniquely from a certain moment on. For operators of orders three and two, obstacles are found explicitly.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑