Abstract
In the paper, construction of algorithms for factoring linear partial differential operators is studied. New theoretical concepts—obstacle and ring of obstacles—are introduced. These are invariants and posses other interesting properties. A theorem on unique factorization extension starting from some moment, which is important from the standpoint of construction of such algorithms, is proved. Obstacles in the case of the second and third degrees are found.