Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2505.20397 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916760258609152 |
|---|---|
| author | Sertöz, Emre Can Ouaknine, Joël Worrell, James |
| author_facet | Sertöz, Emre Can Ouaknine, Joël Worrell, James |
| contents | A 1-period is a complex number given by the integral of a univariate algebraic function, where all data involved -- the integrand and the domain of integration -- are defined over algebraic numbers. We give an algorithm that, given a finite collection of 1-periods, computes the space of all linear relations among them with algebraic coefficients. In particular, the algorithm decides whether a given 1-period is transcendental, and whether two 1-periods are equal. This resolves, in the case of 1-periods, a problem posed by Kontsevich and Zagier, asking for an algorithm to decide equality of periods. The algorithm builds on the work of Huber and Wüstholz, who showed that all linear relations among 1-periods arise from 1-motives; we make this perspective effective by reducing the problem to divisor arithmetic on curves and providing the theoretical foundations for a practical and fully explicit algorithm. To illustrate the broader applicability of our methods, we also give an algorithmic classification of autonomous first-order (non-linear) differential equations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_20397 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Computing transcendence and linear relations of 1-periods Sertöz, Emre Can Ouaknine, Joël Worrell, James Algebraic Geometry Symbolic Computation Number Theory 14Q05, 14C30, 14F40, 14H40 A 1-period is a complex number given by the integral of a univariate algebraic function, where all data involved -- the integrand and the domain of integration -- are defined over algebraic numbers. We give an algorithm that, given a finite collection of 1-periods, computes the space of all linear relations among them with algebraic coefficients. In particular, the algorithm decides whether a given 1-period is transcendental, and whether two 1-periods are equal. This resolves, in the case of 1-periods, a problem posed by Kontsevich and Zagier, asking for an algorithm to decide equality of periods. The algorithm builds on the work of Huber and Wüstholz, who showed that all linear relations among 1-periods arise from 1-motives; we make this perspective effective by reducing the problem to divisor arithmetic on curves and providing the theoretical foundations for a practical and fully explicit algorithm. To illustrate the broader applicability of our methods, we also give an algorithmic classification of autonomous first-order (non-linear) differential equations. |
| title | Computing transcendence and linear relations of 1-periods |
| topic | Algebraic Geometry Symbolic Computation Number Theory 14Q05, 14C30, 14F40, 14H40 |
| url | https://arxiv.org/abs/2505.20397 |