相关论文: An implementation of Runge's method for Diophantin…
We consider Diophantine equations of the shape $ f(x) = g(y) $, where the polynomials $ f $ and $ g $ are elements of power sums. Using a finiteness criterion of Bilu and Tichy, we will prove that under suitable assumptions infinitely many…
The results of difference sequences theory are applied to analytic function theory and Diophantine equations. As a result we have the equation which connects the $n$-th derivative of a function with the difference sequence for the values of…
We develop an algebraic method of studying of Diophantine quadratic equations in three variables over the ring of Gaussian integers.
Let $A\subset \N_{+}$ and by $P_{A}(n)$ denotes the number of partitions of an integer $n$ into parts from the set $A$. The aim of this paper is to prove several result concerning the existence of integer solutions of Diophantine equations…
It is a generalization of Pell's equation $x^2-Dy^2=0$. Here, we show that: if our Diophantine equation has a particular integer solution and $ab$ is not a perfect square, then the equation has an infinite number of solutions; in this case…
We present in this paper a detailed note on the computation of Puiseux series solutions of the Riccatti equation associated with a homogeneous linear ordinary differential equation. This paper is a continuation of [1] which was on the…
We propose a new variational formulation of the elliptic Monge-Ampere equation and show how classical Lagrange elements can be used for the numerical resolution of classical solutions of the equation. Error estimates are given for Lagrange…
The Conte-Musette method has been modified for the search of only elliptic solutions to systems of differential equations. A key idea of this a priory restriction is to simplify calculations by means of the use of a few Laurent series…
New formulae are presented for the number $P(b)$ of non-negative integer solutions of a Diophantine equation $\sum_{i=1}^{n}a_ix_i=b$ and for the number $Q(b)$ of non-negative integer solutions of the Diophantine inequality…
The paper studies numerical methods that preserve a Lyapunov function of a dynamical system, i.e. numerical approximations whose energy decreases, just like in the original differential equation. With this aim, a discrete gradient method is…
We present structural results on solutions to the Diophantine system $A{\boldsymbol y} = {\boldsymbol b}$, ${\boldsymbol y} \in \mathbb Z^t_{\ge 0}$ with the smallest number of non-zero entries. Our tools are algebraic and number theoretic…
We give solutions of a Diophantine equation containing factorials, which can be written as a cubic form, or as a sum of binomial coefficients. We also give some solutions to higher degree forms and relate some solutions to an unsolvable…
Our goal is to finally settle the persistent problem in Diophantine Approximation of finding best linear approximates. Classical results from the theory of continued fractions provide the solution for the special homogeneous case in the…
The paper considers parabolic equations in non-divergent form with discontinuous coefficients at higher derivatives. Their investigation is most complicated because, in general, in the case of discontinuous coefficients, the uniqueness of a…
We discuss alternative iteration methods for differential equations. We provide a convergence proof for exactly solvable examples and show more convenient formulas for nontrivial problems.
The author showed that any homogeneous algebraic Diophantine equation of the second order can be converted to a diagonal form using an integer non-orthogonal transformation maintaining asymptotic behavior of the number of its integer…
In this paper we give solutions of certain diophantine equations related to triangular and tetrahedral numbers and propose several problems connected with these numbers. The material of this paper was presented in part at the 11th…
We establish an explicit asymptotic formula for the number of rational solutions of intrinsic Diophantine inequalities on simply-connected simple algebraic groups, at arbitrarily small scales.
We solve completely the Lebesgue-Nagell equation x^2+D=y^n, in integers x, y, n>2, for D in the range 1 =< D =< 100.
There exist many Runge-Kutta methods (explicit or implicit), more or less adapted to specific problems. Some of them have interesting properties, such as stability for stiff problems or symplectic capability for problems with energy…