On Efficient Noncommutative Polynomial Factorization via Higman Linearization release_bufncnpmcjcr3k3zxxj3zl46zq

by V. Arvind, Pushkar S. Joglekar

Released as a article .

2022  

Abstract

In this paper we study the problem of efficiently factorizing polynomials in the free noncommutative ring F<x_1,x_2,...,x_n> of polynomials in noncommuting variables x_1,x_2,..., x_n over the field F. We obtain the following result: Given a noncommutative arithmetic formula of size s computing a noncommutative polynomial f in F<x_1,x_2,...,x_n> as input, where F=F_q is a finite field, we give a randomized algorithm that runs in time polynomial in s, n and log q that computes a factorization of f as a product f=f_1f_2\cdots f_r, where each f_i is an irreducible polynomial that is output as a noncommutative algebraic branching program. The algorithm works by first transforming f into a linear matrix L using Higman's linearization of polynomials. We then factorize the linear matrix L and recover the factorization of f. We use basic elements from Cohn's theory of free ideals rings combined with Ronyai's randomized polynomial-time algorithm for computing invariant subspaces of a collection of matrices over finite fields.
In text/plain format

Archived Files and Locations

application/pdf  367.5 kB
file_s4vpzx7iwzhnfdqqkwcb7vx2yq
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2022-02-27
Version   v2
Language   en ?
arXiv  2202.09883v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: c1fab8e7-1b2f-4647-9001-325daac6ca35
API URL: JSON