Related papers: Counting monochromatic solutions to diagonal Dioph…
We present a multiscale finite element method for a diffusion problem with rough and high contrast coefficients. The construction of the multiscale finite element space is based on the localized orthogonal decomposition methodology and it…
This study shows how to obtain least-squares solutions to initial and boundary value problems to nonhomogeneous linear differential equations with nonconstant coefficients of any order. However, without loss of generality, the approach has…
These notes represent an extended version of a talk I gave for the participants of the IMO 2009 and other interested people. We introduce diophantine equations and show evidence that it can be hard to solve them. Then we demonstrate how one…
For fixed integers $D \geq 0$ and $c \geq 3$, we demonstrate how to use $2$-adic valuation trees of sequences to analyze Diophantine equations of the form $x^2+D=2^cy$ and $x^3+D=2^cy$, for $y$ odd. Further, we show for what values $D \in…
We give bounds on the number of solutions to the Diophantine equation (X+1/x)(Y+1/y) = n as n tends to infinity. These bounds are related to the number of solutions to congruences of the form ax+by = 1 modulo xy.
In this paper, we solve Diophantine equation in the tittle in nonnegative integers m,n, and a. In order to prove our result, we use lower bounds for linear forms in logarithms and and a version of the Baker-Davenport reduction method in…
We study density and partition properties of polynomial equations in prime variables. We consider equations of the form $a_1h(x_1) + \cdots + a_sh(x_s)=b$, where the $a_i$ and $b$ are fixed coefficients, and $h$ is an arbitrary integer…
The dispersive estimate plays a pivotal role in establishing the long-term behavior of solutions to the nonlinear equation, thereby being crucial for investigating the well-posedness of the equation.In this work we prove that the solutions…
We introduce a two-phase approximation method designed to resolve singularities in three-dimensional harmonic Dirichlet problems. The approach utilizes the classical Green's function representation, decomposing the function into its…
Random constraint satisfaction problems can exhibit a phase where the number of constraints per variable $\alpha$ makes the system solvable in theory on the one hand, but also makes the search for a solution hard, meaning that common…
Generalizing an argument of Matiyasevich, we illustrate a method to generate infinitely many diophantine equations whose solutions can be completely described by linear recurrences. In particular, we provide an integer-coefficient…
In this note we recall the definition of the digital root, and apply the notion of the digital root to searching solutions of Diophantine equations. A table of arithmetic operations with digital roots is given. This method is incapable of…
We introduce a generalized finite difference method for solving a large range of fully nonlinear elliptic partial differential equations in three dimensions. Methods are based on Cartesian grids, augmented by additional points carefully…
We consider the problem of finding the shortest possible period for an exactly periodic solution to some given autonomous ordinary differential equation. We show that, given a pair of Lyapunov-like observable functions defined over the…
In this paper we propose a method of solving a Nonlinear Diophantine Equation by converting it into a System of Diophantine Linear Equations.
A scheme stemming from the use of pseudospectral approximations to spatial derivatives followed by a time integrator based on trigonometric polynomials is proposed for the numerical solutions of the coupled nonlinear Klein--Gordon…
In the first part of the paper, we classify linear integrable (multi-dimensionally consistent) quad-equations on bipartite isoradial quad-graphs in $\mathbb C$, enjoying natural symmetries and the property that the restriction of their…
A multiscale numerical method is proposed for the solution of semi-linear elliptic stochastic partial differential equations with localized uncertainties and non-linearities, the uncertainties being modeled by a set of random parameters. It…
We establish a well-posedness and error-estimation framework that solves Hamilton-Jacobi equations by minimizing the least-squares residual of monotone finite-difference discretizations. This approach also applies naturally to second-order…
Periodic solutions of delay equations are usually approximated as continuous piecewise polynomials on meshes adapted to the solutions' profile. In practical computations this affects the regularity of the (coefficients of the) linearized…