The pole assignability property in polynomial rings over GCD-domains

DOI10.1016/0021-8693(85)90058-4zbMath0574.13011OpenAlexW2052155648MaRDI QIDQ1063647

James Brewer, William J. Heinzer, David C. Lantz

Publication date: 1985

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-8693(85)90058-4

zbMATH Keywords

polynomial ringGCD domainreachable pairPAF- ringspole assignability

Mathematics Subject Classification ID

Matrices over special rings (quaternions, finite fields, etc.) (15B33) Pole and zero placement problems (93B55) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (9)

Pole assignability in polynomial rings, power series rings, and Prüfer domains ⋮ \(\mathbb{C}[y\) is a CA-ring and coefficient assignment is properly weaker than feedback cyclization over a PID] ⋮ On the pole assignability property over commutative rings ⋮ BCS rings ⋮ Pole assignability of rings of low dimension ⋮ Pole assignability and the invariant factor theorem in Prüfer domains and Dedekind domains ⋮ New results on pole-shifting for parametrized families of systems ⋮ ON POLE ASSIGNABILITY AND FEEDEBACK CYCLISATION FOR SYSTEMS OVER RINGS OF FINITE DIMENSION ⋮ Comments on pole assignability over rings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Remarks on the pole-shifting problem over rings
• On pole assignability over polynomial rings
• Polynomial rings over arbitrary fields in two or more variables are not pole assignable
• Critères de platitude et de projectivité. Techniques de platification d'un module. (Criterial of flatness and projectivity. Technics of flatification of a module.)
• On bézout domains, elementary divisor rings, and pole assignability

This page was built for publication: The pole assignability property in polynomial rings over GCD-domains