On efficient noncommutative polynomial factorization via Higman linearization

DOI10.1007/S00037-025-00272-9MaRDI QIDQ6938571zbMATH OpenFDO

Authors Vikraman Arvind, Pushkar S. Joglekar

Publication date 25 August 2025

Published in Computational Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00037-025-00272-9

zbMATH Keywords

factorizationHigman linearizationidentity testinginvariant subspaceslinear matricesnoncommutative polynomials

Mathematics Subject Classification ID

Associative rings and algebras (16-XX)

Cites work

• A probabilistic remark on algebraic program testing
• A Special Case of Rational Identity Testing and the Brešar-Klep Theorem.
• Closure results for polynomial factorization
• Computing the structure of finite algebras
• Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
• Constructive non-commutative rank computation is in deterministic polynomial time
• Derandomizing polynomial identity tests means proving circuit lower bounds
• Deterministic polynomial identity testing in non-commutative models
• Equivalence of polynomial identity testing and polynomial factorization
• Factoring polynomials with rational coefficients
• Factorization of Noncommutative Polynomials and Nullstellensätze for the Free Algebra
• Factorization theory: from commutative to noncommutative settings.
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Geometry of free loci and factorization of noncommutative polynomials
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 3265895 (Why is no real title available?)
• scientific article; zbMATH DE number 2228140 (Why is no real title available?)
• Minimal Identities for Algebras
• Modern computer algebra
• Non-commutative Edmonds' problem and matrix semi-invariants
• On noncommutative finite factorization domains
• On the complexity of noncommutative polynomial factorization
• On the condition of reducibility of any group of linear substitutions.
• Operator scaling: theory and applications
• Polynomial degree bounds for matrix semi-invariants
• Rational identities and applications to algebra and geometry
• The units of group-rings.

This page was built for publication: On efficient noncommutative polynomial factorization via Higman linearization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6938571)