Year: 2024
Type: conference-paper
Abstract: 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.
Author: James H. Davenport
Institution: University of Bath
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4407951091