Undecidable arithmetic properties of solutions of Fredholm integral equations
The author considers the problem of determining whether a value of a transcendental function \(f(z)\) is rational or algebraic for a fixed value of \(z\). Such an algorithm exists for a class of functions called \(E\)-functions due to results of \textit{B. Adamczewski} and \textit{T. Rivoal} [Bull. Lond. Math. Soc. 50, No. 4, 697--708 (2018; Zbl 1450.11076)]. An \(E\)-function function \(f(z)\) satisfies the formula \(f(z)=\sum_{k=0}^{\infty}a_kz^k\), \(a_k \in \overline{\mathbb Q}\), where \(\overline{\mathbb Q}\) is an algebraic closure of \(\mathbb Q\), and is an entire function such that the coefficients \(a_k\) of its series satisfy certain arithmetic conditions while \(f(z)\) satisfies a certain linear differential equation. The author shows that for a class of functions satisfying a Fredholm integral equation (as opposed to a differential equation as was the case above), there is no algorithm to determine whether the value of the function at 0 is rational. This conclusion is obtained by simulating iterations of a generalized Collatz function and using a result of [\textit{J. H. Conway}, in: Proc. Number Theory Conf., Univ. Colorado, Boulder, 49--52 (1972; Zbl 0337.10041)] that the Generalized Collatz Problem is undecidable.
- Entire functions with undecidable arithmetic properties
- scientific article; zbMATH DE number 3875367
- Arithmetical properties of the solutions of certain functional equations
- Undecidability of restricted uniform recurrence equations
- On arithmetic properties of the solutions of a universal differential equation at algebraic points
- Arithmetic properties of solutions of certain Poincaré-type functional equations
- Diophantine equations, Hilbert series, and undecidable spaces
- scientific article; zbMATH DE number 3285227
- Arithmetic properties of solutions of certain functional equations in several variables
- On an undecidable problem related to difference equations with parameters
- A refined version of the Siegel-Shidlovskii theorem
- Arithmetic Gevrey series and transcendence. A survey.
- Decomposition of Feynman integrals on the maximal cut by intersection numbers
- Exceptional values of E-functions at algebraic points
- FRACTRAN: a simple universal programming language for arithmetic
- Handbook of integral equations
- scientific article; zbMATH DE number 3526785 (Why is no real title available?)
- scientific article; zbMATH DE number 1225772 (Why is no real title available?)
- scientific article; zbMATH DE number 1231230 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- On some applications of Diophantine approximations. (A translation of Carl Ludwig Siegel's ``Über einige Anwendungen diophantischer Approximationen by Clemens Fuchs).
- The conversion of Fredholm integral equations to equivalent Cauchy problems. II: Computation of resolvents
- The Undecidability of the Generalized Collatz Problem
This page was built for publication: Undecidable arithmetic properties of solutions of Fredholm integral equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2116752)