Related papers: Computing bounded solutions to linear Diophantine …

In this paper, we investigate the complexity of the central path of semidefinite optimization through the lens of real algebraic geometry. To that end, we propose an algorithm to compute real univariate representations describing the…

In this paper, we perform the convergence analysis of unsupervised Legendre--Galerkin neural networks (ULGNet), a deep-learning-based numerical method for solving partial differential equations (PDEs). Unlike existing deep learning-based…

In this paper, we consider the problem of counting Diophantine inequalities with multiple natural constraints. We prove a very general result in this setting using dynamical techniques. More precisely, we consider the joint asymptotic…

In this paper one shows if the number of natural solutions of a general linear equation is limited or not. Also, it is presented a method of solving the Diophantine equation $ax-by=c$ in the set of natural numbers, and an example of solving…

Let $(U_n)_{n\geq 0}$ be a non-degenerate linear recurrence sequence with order at least two defined over a function field and $\mathcal{O}_S^*$ be the set of $S$-units. In this paper, we use a result of Brownawell and Masser to prove…

Let $1<c<37/18,\,c\neq2$ and $N$ be a sufficiently large real number. In this paper, we prove that, for almost all $R\in(N,2N],$ the Diophantine inequality $|p_1^c+p_2^c+p_3^c-R|<\log^{-1}N$ is solvable in primes $p_1,\,p_2,\,p_3.$…

In this paper, we consider elliptic boundary value problems with discontinuous coefficients and obtain the asymptotic optimal error estimate $\|u-u_k\|_{1,\Omega}\leqslant Ch|\ln h|^{1/2}\|u\|_{2,\Omega_1+\Omega_2}$ for triangle linear…

The paper is concerned with a free boundary problem generated by the biharmonic operator and an obstacle. The main goal is to deduce a fully guaranteed upper bound of the difference between the exact minimizer u and any function…

Nonlinear differential equations are challenging to solve numerically and are important to understanding the dynamics of many physical systems. Deep neural networks have been applied to help alleviate the computational cost that is…

Computing shortest paths for curvature-constrained Dubins vehicles on the unit sphere is fundamental to many engineering applications, including long-range flight planning, persistent surveillance patterns, and global routing problems where…

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 'exact subgraph' approach was recently introduced as a hierarchical scheme to get increasingly tight semidefinite programming relaxations of several NP-hard graph optimization problems. Solving these relaxations is a computational…

Let $\zeta$ be a real transcendental number. We introduce a new method to find upper bounds for the classical exponent $\widehat{w}_{n}(\zeta)$ concerning uniform polynomial approximation. Our method is based on the parametric geometry of…

This paper is concerned with supersolutions to parabolic equations of the form \begin{equation} \partial_t U (x,t)-D(x)\Delta U(x,t)=0, \quad (x,t)\in \mathbb{R}^N \times (0,\infty), \end{equation} where $D\in C(\mathbb{R}^N)$ is positive.…

A brief history and two formulations of the Diophantine problem's requirements are presented. One tier consisting of three two-parameter solutions is studied for its ability to provide examples for the small natural numbers considered.…

We derive a closed expression for the number of nonnegative solutions of a certain system of linear Diophantine equations. The motivation comes from high energy physics where the nonnegative solutions play a crucial role in the perturbative…

We prove the existence, uniqueness, and sharp bilateral pointwise estimates for positive bounded solutions to the Lane--Emden type problem \[ \begin{cases} L u = \sum\limits_{i=1}^{m}\sigma_{i} u^{q_{i}}+\sigma_0, \quad u\geq0 & \text{in }…

Let A be an arbitrary integral domain of characteristic 0 which is finitely generated over Z. We consider Thue equations $F(x,y)=b$ with unknowns x,y from A and hyper- and superelliptic equations $f(x)=by^m$ with unknowns from A, where the…

We solve the Diophantine equation $Y^2=X^3+k$ for all nonzero integers $k$ with $|k| \leq 10^7$. Our approach uses a classical connection between these equations and cubic Thue equations. The latter can be treated algorithmically via lower…

This paper is devoted to the study of a problem of Cassels in multiplicative Diophantine approximation which involves minimising values of a product of affine linear forms computed at integral points. It was previously known that values of…