FGLM for Hermite and Popov Normal Forms of Ore Polynomial Matrices

  • Johannes Middeke (Speaker)

Activity: Talk or presentationContributed talkunknown

Description

We are working with matrices over a ring $K[D,σ,θ]$ of Ore polynomials over a skew field $K$. Extending a result of Kojima et al for usual polynomials it is shown that in this setting the Hermite and Popov normal forms correspond to Gröbner bases with respect to certain orders. The FGLM algorithm is adapted to this setting and used for converting Popov forms into Hermite forms and vice versa. The approach works for arbitrary, i.e., not necessarily square matrices where we establish termination criteria to deal with infinitely dimensional factor spaces.
Period25 Jun 2010
Event titleApplications of Computer Algebra 2010
Event typeConference
LocationAlbaniaShow on map

Fields of science

  • 101002 Analysis
  • 101013 Mathematical logic
  • 101001 Algebra
  • 101012 Combinatorics
  • 101020 Technical mathematics
  • 102 Computer Sciences
  • 101 Mathematics
  • 102011 Formal languages
  • 101005 Computer algebra
  • 101025 Number theory
  • 101003 Applied geometry
  • 102025 Distributed systems

JKU Focus areas

  • Computation in Informatics and Mathematics