Author
Ludovic Tagnon
0 works0 citations
Recent research
- AI & ComputingOpen access
We prove a per-field periodicity theorem for the complex sin²-algorithm: for every cubic field K of signature (1, 1) and every order of K, with constants γ = 51/50, m₀ = 10, κ = 1 independent of the field and state, the selected greedy orbit of every admissible initial state is e...
- AI & ComputingOpen access
We prove a per-field periodicity theorem for the complex sin²-algorithm: for every cubic field K of signature (1, 1) and every order of K, with constants γ = 51/50, m₀ = 10, κ = 1 independent of the field and state, the selected greedy orbit of every admissible initial state is e...