A criterion for the similarity of length-two elements in a noncommutative PID.

DOI10.1007/s11424-011-8392-xzbMath1236.16034OpenAlexW1992239560MaRDI QIDQ646744

Ziming Li, Huaifu Wang

Publication date: 17 November 2011

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-011-8392-x

zbMATH Keywords

algorithmsOre polynomialsirreducible elementsrings of differential operatorscompletely reducible elementsnoncommutative principal ideal domainsproducts of irreducible factorsRisch equationssimilarity of length-two elements

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Ordinary and skew polynomial rings and semigroup rings (16S36) Linear ordinary differential equations and systems (34A30) Computational aspects of associative rings (general theory) (16Z05) Divisibility, noncommutative UFDs (16U30)

Related Items (1)

Telescopers for differential forms with one parameter

Cites Work

• An introduction to pseudo-linear algebra
• Theory of non-commutative polynomials
• Symbolic integration I: Transcendental functions
• Testing reducibility of linear differential operators: A group theoretic perspective
• Solving parameterized linear difference equations in terms of indefinite nested sums and products
• The Problem of Integration in Finite Terms
• Finite-Dimensional Division Algebras over Fields
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A criterion for the similarity of length-two elements in a noncommutative PID.