On Efficient Noncommutative Polynomial Factorization via Higman Linearization

02/20/2022
by   V. Arvind, et al.
0

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⋯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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/31/2022

Matrix Polynomial Factorization via Higman Linearization

In continuation to our recent work on noncommutative polynomial factoriz...
research
07/01/2020

Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach

Let f̃(X)∈ℤ[X] be a degree-n polynomial such that f(X):=f̃(X) p factoriz...
research
01/06/2016

A Modular Algorithm for Computing Polynomial GCDs over Number Fields presented with Multiple Extensions

We consider the problem of computing the monic gcd of two polynomials ov...
research
03/10/2023

Multivariate to Bivariate Reduction for Noncommutative Polynomial Factorization

Based on a theorem of Bergman we show that multivariate noncommutative p...
research
07/25/2018

Toward an Optimal Quantum Algorithm for Polynomial Factorization over Finite Fields

We present a randomized quantum algorithm for polynomial factorization o...
research
06/14/2016

Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields

The fastest known algorithm for factoring univariate polynomials over fi...
research
08/07/2023

New Bounds on Quotient Polynomials with Applications to Exact Divisibility and Divisibility Testing of Sparse Polynomials

A sparse polynomial (also called a lacunary polynomial) is a polynomial ...

Please sign up or login with your details

Forgot password? Click here to reset