2024/09/14 by James H. Davenport, Davenport, James H.
Computer Science · Engineering · #Polynomial and algebraic computation #graph theory and CDMA systems #Digital Filter Design and Implementation
paper · pdf · doi:10.48550/arxiv.2409.09533
Computer algebra systems are really good at factoring polynomials, i.e. writing f as a product of irreducible factors. It is relatively easy to verify that we have a factorisation, but verifying that these factors are irreducible is a much harder problem. This paper reports work-in-progress to do such verification in Lean.