Towards Verified Polynomial Factorisation
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917775667101696 |
|---|---|
| author | Davenport, James H. |
| author_facet | Davenport, James H. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_09533 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Towards Verified Polynomial Factorisation Davenport, James H. Symbolic Computation 68W30 G.4 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. |
| title | Towards Verified Polynomial Factorisation |
| topic | Symbolic Computation 68W30 G.4 |
| url | https://arxiv.org/abs/2409.09533 |