Formalization of a Newton series representation of polynomials
We formalize an algorithm to change the representation of a polynomial to a Newton power series. This provides a way to compute efficiently polynomials which roots are the sums or products of roots of other polynomials, and hence provide a base component of efficient computation for algebraic numbers. In order to achieve this, we formalize a notion of partial power series and develop an abstract theory of poles of fractions.
Mon 18 Jan
|16:00 - 16:30|
|16:30 - 17:00|
Formal proofs of transcendence for e and pi as an application of multivariate and symmetric polynomials
|17:00 - 17:30|
|17:30 - 18:00|