Faster computation of Witt vectors over polynomial rings
We describe an algorithm which computes the ring laws for Witt vectors of finite length over a polynomial ring with coefficients in a finite field. This algorithm uses an isomorphism of Illusie in order to compute in an adequate polynomial ring. We also give an implementation of the algorithm in SageMath, which turns out to be faster that Finotti's algorithm, which was until now the most efficient one for these operations.
Authors
- Rubén Muñoz--Bertrand
Institutions
- Centre National de la Recherche Scientifique (FR)
- Laboratoire de Mathématiques de Besançon (FR)
Publication Details
- Journal
- ArXiv.org
- Published
- 2025-04-02
- Primary Topic
- Polynomial and algebraic computation
- Type
- article
- Field-Weighted Citation Impact
- 0.00