Related papers: A Linear Prelle-Singer method
We use the arithmetic of the Kummer surface associated to the Jacobian of a hyperelliptic curve to study the primality of integers of the form $4m^2 5^n-1$. We provide an algorithm capable of proving the primality or compositeness of most…
The Painlev\'{e} and weak Painlev\'{e} conjectures have been used widely to identify new integrable nonlinear dynamical systems. For a system which passes the Painlev\'{e} test, the calculation of the integrals relies on a variety of…
Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…
The plane wave solutions of the three-wave resonant interaction in the plane are considered. It is shown that rank-one constraints over the right derivatives of invertible operators on an arbitrary linear space gives solutions of the…
In this work, we introduce a method based on piecewise polynomial interpolation to enclose rigorously solutions of nonlinear ODEs. Using a technique which we call a priori bootstrap, we transform the problem of solving the ODE into one of…
We present a primal-dual majorization-minimization method for solving large-scale linear programs. A smooth barrier augmented Lagrangian (SBAL) function with strict convexity for the dual linear program is derived. The…
The explicit solution of the initial-values problem is exhibited of a subclass of the autonomous system of 2 coupled first-order ODE s with second-degree polynomial right-hand sides, hence featuring 12 a prior arbitrary (time-independent)…
The paper develops the method for construction of families of particular solutions to some classes of nonlinear Partial Differential Equations (PDE). Method is based on the specific link between algebraic matrix equations and PDE.…
In this paper we propose two different primal-dual splitting algorithms for solving inclusions involving mixtures of composite and parallel-sum type monotone operators which rely on an inexact Douglas-Rachford splitting method, however…
We study algebraic integrability of complex planar polynomial vector fields $X=A (x,y)(\partial/\partial x) + B(x,y) (\partial/\partial y) $ through extensions to Hirzebruch surfaces. Using these extensions, each vector field $X$ determines…
By establishing an interesting connection between ordinary Bell polynomials and rational convolution powers, some composition and inverse relations of Bell polynomials as well as explicit expressions for convolution roots of sequences are…
We consider an integrable polynomial system with generalized Darboux first integral H_0. We assume that it defines a family of real cycles in a region bounded by a polycycle. To any polynomial form \eta one can associate the pseudo-abelian…
We investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation (PLDE). Two kinds of polynomials are to be distinguished, we call them /periodic/ and…
Deep learning has boosted the performance of many music information retrieval (MIR) systems in recent years. Yet, the complex hierarchical arrangement of music makes end-to-end learning hard for some MIR tasks - a very deep and flexible…
This paper attempts to look for a mathematical method of composing music by incorporating Schonbergs idea of tone rows and matrix theory from linear algebra. The elements of a note set S are considered as the integer values for the natural…
We develop the Darboux procedure for the case of the two-level system. In particular, it is demonstrated that one can construct the Darboux intertwining operator that does not violate the specific structure of the equations of the two-level…
The standard text book theory of ODEs lacks a general method to solve linear equations having variable coefficients, providing instead a collection of special techniques for particular classes of equations. The present article addresses…
The usual methods for root finding of polynomials are based on the iteration of a numerical formula for improvement of successive estimations. The unpredictable nature of the iterations prevents to search roots inside a pre-specified region…
The number field sieve is the most efficient known algorithm for factoring large integers that are free of small prime factors. For the polynomial selection stage of the algorithm, Montgomery proposed a method of generating polynomials…
We study discretization of Darboux integrable systems. The discretization is done by using $x$- or $y$-integrals of the considered systems. New examples of semi-discrete Darboux integrable systems are obtained.