\(\mathbb{C}[y]\) is a CA-ring and coefficient assignment is properly weaker than feedback cyclization over a PID
type: Item
instance of: scholarly article
title: \(\mathbb{C}[y]\) is a CA-ring and coefficient assignment is properly weaker than feedback cyclization over a PID
zbMATH Open document ID: 0842.13016
DOI: 10.1016/0022-4049(93)00012-T
author: Lee Klingler
author: Wiland Schmale
author: James Brewer
published in: Journal of Pure and Applied Algebra
publication date: 1996-01-24T00:00:00Z
review text: The authors investigate the connection between the following properties of linear systems: cyclizability, coefficient assignability, pole assignability, and reachability. Over an arbitrary commutative ring each of the properties implies those following it. The main result of the paper is that for an algebraically closed field \(K\) the polynomial ring \(K[X]\) is a CA-ring: reachability implies coefficient assignability. (For example, this fails for \(\mathbb{R} [X]\).) An important step in the proof is a `canonical form' for linear systems over a principal ideal domain derived in a previous article of the authors [J. Pure Appl. Algebra 92, No. 3, 213-225 (1994; Zbl 0791.13008)]. It is known that for a field \(F\) of positive characteristic the polynomial ring \(F[X]\) is not an FC-ring: reachability does not imply cyclizability. This provides an example of a CA-ring that is not FC, answering a question of \textit{R. Bumby}, \textit{E. D. Sontag}, \textit{H. J. Sussman} and \textit{W. Vasconcelos} [J. Pure Appl. Algebra 20, 113-127 (1981; Zbl 0455.15009)].
reviewed by: Winfried Bruns
Mathematics Subject Classification ID: 13F50
Mathematics Subject Classification ID: 13F10
Mathematics Subject Classification ID: 93B52
zbMATH DE Number: 735690
zbMATH Keywords: cyclizability
zbMATH Keywords: pole assignability
zbMATH Keywords: reachability
zbMATH Keywords: coefficient assignability
MaRDI profile type: Publication
cites work: On hermite rings and the pole assignability property
cites work: Q3745932
cites work: The pole assignability property in polynomial rings over GCD-domains
cites work: Pole assignability in polynomial rings, power series rings, and Prüfer domains
cites work: Pole assignability and the invariant factor theorem in Prüfer domains and Dedekind domains
cites work: Pole shifting for families of systems: The dimension one case
cites work: The dynamic feedback cyclization problem for principal ideals domains
cites work: On bézout domains, elementary divisor rings, and pole assignability
cites work: Remarks on the pole-shifting problem over rings
cites work: Pole assignment for systems over rings
cites work: New results on pole-shifting for parametrized families of systems
cites work: Q3902876
cites work: Three-dimensional feedback cyclization over \({\mathbb{C}}[y]\)
cites work: Q3674472
cites work: Complex-valued functions on the plane are pole-assignable
cites work: Linear multivariable control. A geometric approach
Recommended article: A note on feedback cyclicity of \(\mathbb{C} [Y]\)
Recommended article: ON POLE ASSIGNABILITY AND FEEDEBACK CYCLISATION FOR SYSTEMS OVER RINGS OF FINITE DIMENSION
Recommended article: Strong feedback cyclization for systems over rings
Recommended article: Feedback cyclization over certain principal ideal domains
Recommended article: Feedback cyclization for rings with finite stable range
Recommended article: Q5701828
Recommended article: The dynamic feedback cyclization problem for principal ideals domains
Recommended article: Three-dimensional feedback cyclization over \({\mathbb{C}}[y]\)
Recommended article: Feedback stabilization over commutative rings: Further study of the coordinate-free approach
Recommended article: Q4308992
description: scientific article; zbMATH DE number 735690