Linearizing the Word Problem in (some) Free Fields

Konrad Schrempf

Research output: Working paperPreprint

Abstract

We describe a solution of the word problem in free fields (coming from non-commutative polynomials over a commutative field) using elementary linear algebra, provided that the elements are given by minimal linear representations. It relies on the normal form of Cohn and Reutenauer and can be used more generally to (positively) test rational identities. Moreover we provide a construction of minimal linear representations for the inverse of non-zero elements.
Original languageEnglish
Pages1-24
Number of pages24
Publication statusPublished - 12 Jan 2017

Publication series

NamearXiv.org e-Print archive
PublisherCornell University Library

Keywords

  • math.RA
  • 16K40, 03B25 (Primary), 16S10, 15A22 (Secondary)

Fingerprint

Dive into the research topics of 'Linearizing the Word Problem in (some) Free Fields'. Together they form a unique fingerprint.

Cite this