Related papers: On Rational Recursion for Holonomic Sequences
A non-deterministic recursion scheme recognizes a language of finite trees. This very expressive model can simulate, among others, higher-order pushdown automata with collapse. We show decidability of the diagonal problem for schemes. This…
Solving symbolic reasoning problems that require compositionality and systematicity is considered one of the key ingredients of human intelligence. However, symbolic reasoning is still a great challenge for deep learning models, which often…
We study the use of Temporal-Difference learning for estimating the structural parameters in dynamic discrete choice models. Our algorithms are based on the conditional choice probability approach but use functional approximations to…
It is well known that the real and imaginary parts of any holomorphic function are harmonic functions of two variables. In this paper we generalize this property to finite-dimensional commutative algebras. We prove that if some basis of a…
We give an approximate algorithm of computing holonomic systems of linear differential equations for definite integrals with parameters. We show that this algorithm gives a correct answer in finite steps, but we have no general stopping…
This paper reports on a new algorithm to compute the asymptotic solutions of a linear differential system. A feature of the algorithm is the ability to accommodate periodic coefficients.
Modelling the process of recombination leads to a large coupled nonlinear dynamical system. Here, we consider a particular case of recombination in {\em discrete} time, allowing only for {\em single crossovers}. While the analogous dynamics…
By folding an autonomous system of rational equations in the plane to a scalar difference equation, we show that the rational system has coexisting periodic orbits of all possible periods as well as stable aperiodic orbits for certain…
We develop a numerical method for solving a system of nonlinear integral equations involving two integral terms: at the current time t, one integral is taken from 0 to t, and a different integral is taken from t to infinity. We prove the…
We present an algorithm for approximating semidefinite programs with running time that is sublinear in the number of entries in the semidefinite instance. We also present lower bounds that show our algorithm to have a nearly optimal running…
In discrete schemes, weak KAM solutions may be interpreted as approximations of correctors for some Hamilton-Jacobi equations in the periodic setting. It is known that correctors may not exist in the almost periodic setting. We show the…
Dynamical systems (DS) theory is fundamental for many areas of science and engineering. It can provide deep insights into the behavior of systems evolving in time, as typically described by differential or recursive equations. A common…
We study the existence of singular separable solutions to a class of quasilinear equations with reaction term. In the 2-dim case, we use a dynamical system approach to construct our solutions.
We propose Symplectic Recurrent Neural Networks (SRNNs) as learning algorithms that capture the dynamics of physical systems from observed trajectories. An SRNN models the Hamiltonian function of the system by a neural network and…
It is well known that for a first order system of linear difference equations with rational function coefficients, a solution that is holomorphic in some left half plane can be analytically continued to a meromorphic solution in the whole…
In this paper, we propose quasilinearization methods that convert nonlocal fully-nonlinear parabolic systems into the nonlocal quasilinear parabolic systems. The nonlocal parabolic systems serve as important mathematical tools for modelling…
Almost block diagonal linear systems of equations can be exemplified by two modules. This makes it possible to construct all sequential forms of band and/or block elimination methods, six old and fourteen new. It allows easy assessment of…
We derive the recurrence relations for relativistic Coulomb integrals directly from the integral representations with the help of computer algebra methods. In order to manage the computational complexity of this problem, we employ holonomic…
This paper establishes the equivalence between systems described by a single first-order hyperbolic partial differential equation and systems described by integral delay equations. System-theoretic results are provided for both classes of…
Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…