Polynomial rings over arbitrary fields in two or more variables are not pole assignable

DOI10.1016/0167-6911(82)90005-6zbMATH Open0505.93027OpenAlexW2052649411MaRDI QIDQ1836637FDOQ1836637

Authors: Allen Tannenbaum 

Publication date: 1982

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6911(82)90005-6

zbMATH Keywords

elliptic curvesreachabilitybranch pointscoefficient assignabilitypole assignabilityprojective idealssystems over polynomial rings

Mathematics Subject Classification ID

Controllability (93B05) Polynomials over commutative rings (13B25) Pole and zero placement problems (93B55) Algebraic methods (93B25) Elliptic curves (14H52)

Cites Work

• Title not available (Why is that?)
• Remarks on the pole-shifting problem over rings
• Ring models for delay-differential systems
• On pole assignability over polynomial rings
• On split realizations of response maps over rings

Cited In (11)

• Polynomial rings which are BCS rings
• Polynomial rings that are Bcs-rings
• Comments on pole assignability over rings
• New results on pole-shifting for parametrized families of systems
• Pole shifting for families of systems: The dimension one case
• BCS rings
• On pole assignment problems in polynomial rings
• Pole assignability in polynomial rings, power series rings, and Prüfer domains
• Three-dimensional feedback cyclization over \({\mathbb{C}}[y]\)
• ON POLE ASSIGNABILITY AND FEEDEBACK CYCLISATION FOR SYSTEMS OVER RINGS OF FINITE DIMENSION
• The pole assignability property in polynomial rings over GCD-domains

This page was built for publication: Polynomial rings over arbitrary fields in two or more variables are not pole assignable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1836637)