A fast algorithm for computing the characteristic polynomial of the p-curvature

DOI10.1145/2608628.2608650zbMath1325.68265arXiv1405.5341OpenAlexW1973090961MaRDI QIDQ3452378

Alin Bostan, Éric Schost, Xavier Caruso

Publication date: 11 November 2015

Published in: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.5341

zbMATH Keywords

complexityalgorithmsdifferential equations\(p\)-curvature

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Abstract differential equations (12H20)

Related Items (6)

Intrinsic Approach to Galois Theory of 𝑞-Difference Equations ⋮ Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications ⋮ On the solutions of holonomic third-order linear irreducible differential equations in terms of hypergeometric functions ⋮ Transcendence Certificates for D-finite Functions ⋮ ON THE DENOMINATORS OF THE TAYLOR COEFFICIENTS OF <i>G</i>-FUNCTIONS ⋮ A new faster algorithm for factoring skew polynomials over finite fields

Uses Software

• Jordan

Cites Work

• Unnamed Item
• Unnamed Item
• An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
• Cylindrical algebraic decomposition using validated numerics
• The Jordan Curve Theorem, Formally and Informally
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Definability and decision problems in arithmetic

This page was built for publication: A fast algorithm for computing the characteristic polynomial of the p-curvature