Related papers: Calculating "small" solutions of relative Thue equ…
By the theory of elliptic curves, we study the nontrivial rational parametric solutions and rational solutions of the Diophantine equations $z^2=f(x)^2 \pm f(y)^2$ for some simple Laurent polynomials $f$.
An algorithm to compute Dirichlet $L$-functions for many quadratic characters is derived. The algorithm is optimal (up to logarithmic factors) provided that the conductors of the characters under consideration span a dyadic window.
We present an adaptive algorithm for effectively solving rough differential equations (RDEs) using the log-ODE method. The algorithm is based on an error representation formula that accurately describes the contribution of local errors to…
In this paper, we propose a low rank approximation method for efficiently solving stochastic partial differential equations. Specifically, our method utilizes a novel low rank approximation of the stiffness matrices, which can significantly…
By the theory of elliptic curves, we investigate the nontrivial rational parametric solutions of the Diophantine equation $f(x)f(y)=f(z)^n$, where $n=1,2$ and $f(X)$ are some simple Laurent polynomials.
The analysis of the solving complexity of random 3-SAT instances using the Davis-Putnam-Loveland-Logemann (DPLL) algorithm slightly below threshold is presented. While finding a solution for such instances demands exponential effort with…
Linear Programming (LP) is widely applied in industry and is a key component of various other mathematical problem-solving techniques. Recent work introduced an LP compiler translating polynomial-time, polynomial-space algorithms into…
Asymptotic approximations ($n \to \infty$) to the truncation errors $r_n = - \sum_{\nu=0}^{\infty} a_{\nu}$ of infinite series $\sum_{\nu=0}^{\infty} a_{\nu}$ for special functions are constructed by solving a system of linear equations.…
We address complexity issues for linear differential equations in characteristic $p>0$: resolution and computation of the $p$-curvature. For these tasks, our main focus is on algorithms whose complexity behaves well with respect to $p$. We…
Recent developments in the theory and application of the Hardy-Littlewood method are discussed, concentrating on aspects associated with diagonal diophantine problems. Recent efficient differencing methods for estimating mean values of…
Sparse polynomial approximation has become indispensable for approximating smooth, high- or infinite-dimensional functions from limited samples. This is a key task in computational science and engineering, e.g., surrogate modelling in…
We solve Diophantine equations of the type $ a \, (x^3 \!+ \! y^3 \!+ \! z^3 ) = (x \! + \! y \! + \! z)^3$, where $x,y,z$ are integer variables, and the coefficient $a\neq 0$ is rational. We show that there are infinite families of such…
In this paper we suggest analytical methods and associated algorithms for determining the sum of the subsets $X_m$ of the set $X_n$ (subset sum problem). Our algorithm has time complexity $T=O(C_{n}^{k})$ ($k=[m/2]$, which significantly…
Newton method is one of the most powerful methods for finding solutions of nonlinear equations and for proving their existence. In its "pure" form it has fast convergence near the solution, but small convergence domain. On the other hand…
In this paper we give a new aggregation framework for linear Diophantine equations. In particular, we prove that an aggregated system of minimum size can be built in polynomial time. We also derive an analytic formula that gives the number…
This paper offers a contemporary and comprehensive perspective on the classical algorithms utilized for the solution of minimum-time problem for linear systems (MTPLS). The use of unified notations supported by visual geometric…
In this paper we completely solve a simple quartic family of Thue equations over $\mathbb{C}(T)$. Specifically, we apply the ABC-Theorem to find all solutions $(x,y) \in \mathbb{C}[T] \times \mathbb{C}[T]$ to the set of Thue equations…
Nonlinear differential equations exhibit rich phenomena in many fields but are notoriously challenging to solve. Recently, Liu et al. [1] demonstrated the first efficient quantum algorithm for dissipative quadratic differential equations…
In this article, we present an iterative method to find simple roots of nonlinear equations, that is, to solving an equation of the form $f(x) = 0$. Different from Newton's method, the method we purpose do not require evaluation of…
A recursive algorithm is constructed which finds all solutions to a class of Diophantine equations connected to the problem of determining ordered n-tuples of positive integers satisfying the property that their sum is equal to their…