arXiv · 2504.01834
Faster computation of Witt vectors over polynomial rings
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Rubén Muñoz--Bertrand. 2025-04-02. Faster computation of Witt vectors over polynomial rings. https://arxiv.org/abs/2504.01834
Cite the original work for its findings. Save a collection to share your selection of sources.