Undecidable arithmetic properties of solutions of Fredholm integral equations

DOI10.1016/J.JNT.2021.07.018zbMath1490.11119OpenAlexW3198893057WikidataQ114156797 ScholiaQ114156797MaRDI QIDQ2116752

Timothy Ferguson

Publication date: 18 March 2022

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jnt.2021.07.018

zbMATH Keywords

algorithmsintegral equationsdecision problemsirrational numbers

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Fredholm integral equations (45B05) Diophantine approximation, transcendental number theory (11J99)

Related Items (2)

Exceptional values of E-functions at algebraic points ⋮ Zero counting for a class of univariate Pfaffian functions

Uses Software

• Unnamed Item

Cites Work

• The conversion of Fredholm integral equations to equivalent Cauchy problems. II: Computation of resolvents
• Arithmetic Gevrey series and transcendence. A survey.
• Decomposition of Feynman integrals on the maximal cut by intersection numbers
• A refined version of the Siegel-Shidlovskii theorem
• On Some Applications of Diophantine Approximations
• Exceptional values of E-functions at algebraic points
• The Undecidability of the Generalized Collatz Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Undecidable arithmetic properties of solutions of Fredholm integral equations