Related papers: On Polynomial Solutions of Linear Differential Equ…
We consider multivariable polynomials over a fixed number field, linear in some of the variables. For a system of such polynomials satisfying certain technical conditions we prove the existence of search bounds for simultaneous zeros with…
In this paper we use the comparison method for investigation of first order polynomial differential equations. We prove two comparison criteria for these equations. The proved criteria we use to obtain some global solvability criteria for…
In this paper, we propose some algorithms for analytical solution construction to nonlinear polynomial partial differential equations with constant function coefficients. These schemes are based on one-(single), two- (double) or three-…
We give a fast, exact algorithm for solving Dirichlet problems with polynomial boundary functions on quadratic surfaces in R^n such as ellipsoids, elliptic cylinders, and paraboloids. To produce this algorithm, first we show that every…
The great innovation of the Generalized Theorem is that it gives us the philosophy to work out the knowledge that the number of roots of an equation depends on the subfields of the functional terms of the equation they generate. Thus, the…
General concept of a gradation slicing is used to analyze polynomial solutions of ordinary differential equations (ODE) with polynomial coefficients, ${\cal L}\psi=0$, where ${\cal L}=\sum_l p_l(z) d_z^l$, $p_l(z)$ are polynomials, $z$ is a…
The bivariate difference filed $(\mathbb{F}(\alpha, \beta), \sigma)$ provides an algebraic framework for a sequence satisfying a recurrence of order two and it could transform the summation involving a sequence satisfying a recurrence of…
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…
We generalize the polynomial-time solvability of $k$-\textsc{Diverse Minimum s-t Cuts} (De Berg et al., ISAAC'23) to a wider class of combinatorial problems whose solution sets have a distributive lattice structure. We identify three…
We characterize the rational solutions to a KdV-like equation which are generated from polynomial solutions to the corresponding generalized bilinear equation. We use a particular class of polynomials satisfying a quadratic difference…
We explicate a procedure to solve general linear differential equations, which connects the desired solutions to monomials x^m of an appropriate degree m. In the process the underlying symmetry of the equations under study, as well as that…
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are…
We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…
Fourier series multiscale method, a concise and efficient analytical approach for multiscale computation, will be developed out of this series of papers. In the third paper, the analytical analysis of multiscale phenomena inherent in the…
Some interesting (periodic!) solutions of certain systems of $4$ nonlinear Ordinary Differential Equations $dx_{n}\left( t\right) /dt=P_{2}^{\left( n\right) }\left[ x_{m}\left( t\right) \right] /\left[ x_{1}\left( t\right) +x_{2}\left(…
A general sufficient condition for the convergence of subsequences of solutions of non-autonomous, nonlinear difference equations and systems is obtained. For higher order equations the delay sizes and patterns play essential roles in…
A construction of differential constraints compatible with partial differential equations is considered. Certain linear determining equations with parameters are used to find such differential constraints. They generalize the classical…
We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…
We study mild solutions of a class of stochastic partial differential equations, involving operators with polynomially bounded coefficients. We consider semilinear equations under suitable hyperbolicity hypotheses on the linear part. We…
A general method for solving linear differential equations of arbitrary order, is used to arrive at new representations for the solutions of the known differential equations, both without and with a source term. A new quasi-solvable…