Related papers: Computable Integrability. Chapter 5: Factorization…
Invariant linearization criteria of square systems of second-order quadratically semi-linear ordinary differential equations (ODEs) that can be represented as geodesic equations are extended to square systems of ODEs cubically nonlinear in…
An "exact discretization" of the Schroedinger operator is considered and its direct and inverse scattering problems are solved. It is shown that a differential-difference nonlinear evolution equation depending on two arbitrary constants can…
Integer factorization is a fundamental problem in algorithmic number theory and computer science. It is considered as a one way or trapdoor function in the (RSA) cryptosystem. To date, from elementary trial division to sophisticated methods…
It is widely known that the recursion operator is a very important component of integrability. It allows one to describe in a compact form both hierarchies of the generalized symmetries and infinite series of the local conservation laws. In…
The linear complementarity problem (LCP) is a general set membership problem that includes quadratic cone programming as a special case. In this work we consider a homogeneous embedding of the LCP, which encodes both the optimality…
In this paper we give definitions of basic concepts such as symmetries, first integrals, Hamiltonian and recursion operators suitable for ordinary differential equations on associative algebras, and in particular for matrix differential…
Parametric factorizations of linear partial operators on the plane are considered for operators of orders two, three and four. The operators are assumed to have a completely factorable symbol. It is proved that ``irreducible'' parametric…
We study deep-inelastic scattering factorization on a nucleon in the end-point regime $x_B \sim 1-{\cal O}(\Lambda_{\rm QCD}/Q)$ where the traditional operator product expansion is supposed to fail. We argue, nevertheless, that the standard…
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not…
A variety of problems emerged investigating electronic circuits, computer devices and cellular automata motivated a number of attempts to create a differential and integral calculus for Boolean functions. In the present article, we extend…
In [1], we have presented the theoretical background for finding the Elementary Invariants for a 3D system of first order rational differential equations (1ODEs). We have also provided an algorithm to find such Invariants. Here we introduce…
The factorisation method for Schr\"odinger operators with magnetic fields on a two-dimensional surface $M^2$ with non-trivial metric is investigated. This leads to the new integrable examples of such operators and brings a new look at some…
Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical computation using empirical data. As a regularization, this paper…
Single scale Feynman integrals in quantum field theories obey difference or differential equations with respect to their discrete parameter $N$ or continuous parameter $x$. The analysis of these equations reveals to which order they…
The concepts of differentiation and integration for matrices are known. As far as each matrix is differentiable, it is not clear a priori whether a given matrix is integrable or not. Recently some progress was obtained for diagonalizable…
We present an algorithm for factoring linear differential operators with coefficients in a finite separable extension of F p (x). Our methods rely on specific tools arising in positive characteristic: p-curvature, structure of simple…
Using geometric methods for linearizing systems of second order cubically semi-linear ordinary differential equations and third order quintically semi-linear ordinary differential equations, we extend to the fourth order by differentiating…
An algebraic approach for factorizing nonlinear partial differential equations (PDEs) and systems of PDEs is provided. In the particular case of second order linear and nonlinear PDEs and systems of PDEs, necessary and sufficient conditions…
We give an algorithm to decide whether an algebraic plane foliation F has a rational first integral and to compute it in the affirmative case. The algorithm runs whenever we assume the polyhedrality of the cone of curves of the surface…
Integer factorization is one of the vital algorithms discussed as a part of analysis of any black-box cipher suites where the cipher algorithm is based on number theory. The origin of the problem is from Discrete Logarithmic Problem which…