Uniformizability of elementary Anderson -motives of dimension
Version 2 / Oct 31, 2026 / CC BY 4.0
Abstract
Let , , be the elementary Anderson -motive of dimension and rank defined by . Using the affine equation of Ehbauer, Grishkov and Logachev, we give an explicit sufficient condition for to be uniformizable, in terms of the valuations of the coefficients of that equation. It holds as soon as no cancellation occurs among the four summands of one of these coefficients; in particular in the simple case where no cancellation occurs in any coefficient. This proves their Conjecture 3.7: whenever lies outside an explicit union of nine hyperplanes.
Provenance statement
Tools used
- Anthropic
- Claude Opus
References
- G. Böckle, U. Hartl, Uniformizable families of -motives , Trans. Amer. Math. Soc. 359 (2007), no. 8, 3933--3972; arXiv:math/0411262.arXiv
- S. Ehbauer, A. Grishkov, D. Logachev, Calculation of of some Anderson -motives , J. Algebra Appl. 21 (2022), no. 1, 2250017; arXiv:2006.00316.arXiv
- A. Grishkov, D. Logachev, for Anderson -motives , J. Number Theory 225 (2021), 59--89; arXiv:1807.08675.arXiv
- D. Logachev, Research plan , complete version, 2026, private communication.
- D. Logachev, How to calculate of -motives: an example , 2026, private communication.
Version history
- v1 · 4 pagesSubmitted by David Niedbala GiraudinInitial depositSupersededOct 30, 2026
- v2 · 4 pagesSubmitted by David Niedbala GiraudinSubmitted as a new versionCurrentNov 03, 2026