Abstract: We present here an algorithm for factoring a given polynomial over GF(q) into powers of irreducible polynomials. The method reduces the factorization of a polynomial of degree m over GF(q) ...

Sage can compute ordinary Kazhdan-Lusztig polynomials for Weyl groups or affine Weyl groups (and potentially other Coxeter groups). You must create a Weyl group W and a ring containing an ...

q^3 - 3*q^2 + 3*q - 1 sage: KL.P(s2, s2*s1*s3*s2) q + 1 Thus we have the Kazhdan-Lusztig R and P polynomials. Known algorithms for computing Kazhdan-Lusztig polynomials are highly recursive, and ...

Abstract: In this article, we discuss the current status of polynomial factoring (root finding) algorithms with some historical and mathematical background including size limits, convergence, accuracy ...

In this video I will cover the topics and processes you will need to know before starting Polynomials. We will begin by solving quadratic equations using the zero product property, factoring ...