A Realization Algorithm for SL2(R[x1 , . . . ,xm]) over the Euclidean Domain

DOI10.1137/S0895479897331096zbMath0953.15027OpenAlexW1982236283MaRDI QIDQ4702258

Hyungju Park

Publication date: 24 November 1999

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895479897331096

zbMATH Keywords

Gröbner basissignal processingpolynomial matrixEuclidean domainLaurent polynomial ringsmonomial ordersrealization algorithmSuslin's stability theoremelementary matrix factorization

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Matrices over function rings in one or more variables (15A54) Grothendieck groups, (K)-theory and commutative rings (13D15) Stability for linear groups (19B14)

Related Items (5)

Linear groups over general rings. I: Generalities. ⋮ Coordinates and automorphisms of polynomial and free associative algebras of rank three. ⋮ The Strong Anick Conjecture ⋮ The strong Anick conjecture is true. ⋮ Automorphisms fixing a variable of \(K\langle x,y,z\rangle\).

This page was built for publication: A Realization Algorithm for SL₂(R[x₁ , . . . ,x_m]) over the Euclidean Domain