An Effective Version of the $p$-Curvature Conjecture for Order One Differential Equations
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866918383970156544 |
|---|---|
| author | Fürnsinn, Florian Pannier, Lucas |
| author_facet | Fürnsinn, Florian Pannier, Lucas |
| contents | We develop an effective version of Kronecker's Theorem on the splitting of polynomials, based on asymptotic arguments proposed by the Chudnovsky brothers, coming from Hermite-Padé approximation. In conjunction with Honda's proof of the $p$-curvature conjecture for order one equations with polynomial coefficients we use this to deduce an effective version of the Grothendieck $p$-curvature conjecture for order one equations. More precisely, we bound the number of primes for which the $p$-curvature of a given differential equation has to vanish in terms of the height and the degree of the coefficients, in order to conclude it has a non-zero algebraic solution. Using this approach, we describe an algorithm that decides algebraicity of solutions of differential equation of order one using $p$-curvatures, and report on an implementation in SageMath. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_00892 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | An Effective Version of the $p$-Curvature Conjecture for Order One Differential Equations Fürnsinn, Florian Pannier, Lucas Number Theory Symbolic Computation 34M15 (primary), 11Y05, 11Y16, 68W30 (secondary) We develop an effective version of Kronecker's Theorem on the splitting of polynomials, based on asymptotic arguments proposed by the Chudnovsky brothers, coming from Hermite-Padé approximation. In conjunction with Honda's proof of the $p$-curvature conjecture for order one equations with polynomial coefficients we use this to deduce an effective version of the Grothendieck $p$-curvature conjecture for order one equations. More precisely, we bound the number of primes for which the $p$-curvature of a given differential equation has to vanish in terms of the height and the degree of the coefficients, in order to conclude it has a non-zero algebraic solution. Using this approach, we describe an algorithm that decides algebraicity of solutions of differential equation of order one using $p$-curvatures, and report on an implementation in SageMath. |
| title | An Effective Version of the $p$-Curvature Conjecture for Order One Differential Equations |
| topic | Number Theory Symbolic Computation 34M15 (primary), 11Y05, 11Y16, 68W30 (secondary) |
| url | https://arxiv.org/abs/2510.00892 |