Related papers: Counting monochromatic solutions to diagonal Dioph…
In this paper we analyze computational properties of the Diophantine problem (and its search variant) for spherical equations $\prod_{i=1}^m z_i^{-1} c_i z_i = 1$ (and its variants) over the class of finite metabelian groups…
In the early 1920s, Hardy and Littlewood considered the number of integer points in the right-angled triangles with irrational inclines of the diagonal. We extend their results to higher dimensions.
A new class of non-monotone finite difference (FD) approximation methods for approximating solutions to non-degenerate stationary Hamilton-Jacobi problems with Dirichlet boundary conditions is proposed and analyzed. The new FD methods add a…
We present in this article a general approach (in the form of recommendations and guidelines) for tackling Diophantine equation problems (whether single equations or systems of simultaneous equations). The article should be useful in…
A method is described to sum multi-dimensional arithmetic functions subject to hyperbolic summation conditions, provided that asymptotic formulae in rectangular boxes are available. In combination with the circle method, the new method is a…
We give an asymptotic formula for the number of rational points of bounded height on algebraic varieties defined by systems of multihomogeneous diagonal equations. The proof uses the Hardy-Littlewood circle method and the hyperbola method…
The nonlinear equation which is connected with the main term of the Hardy-Littlewood formula for $\zeta^2(1/2+it)$ is studied. In this direction I obtain the fine results which cannot be reached by published methods of Balasubramanian,…
We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…
Using methods developed in multivariate splines, we present an explicit formula for discrete truncated powers, which are defined as the number of non-negative integer solutions of linear Diophantine equations. We further use the formula to…
Using the Davenport-Heilbronn circle method, we show that for almost all additive Diophantine inequalities of degree $k$ in more than $2k$ variables the expected asymptotic formula for the density of solutions holds true. This appears to be…
We consider first-order linear systems of ordinary differential equations with periodic coefficients. Supposing that right-hand sides of equations are not known and subjected to some quadratic restrictions, we obtain optimal, in certain…
This paper initiates a novel research direction in the theory of Diophantine equations: define an appropriate version of the equation's size, order all polynomial Diophantine equations starting from the smallest ones, and then solve the…
Let $\lambda_i, \mu_j$ be non-zero real numbers not all of the same sign and let $a_i, b_k$ be non-zero integers not all of the same sign. We investigate a mixed Diophantine system of the shape \begin{equation*} \begin{cases} \left|…
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…
This work determine the entire family of positive integer solutions of the diophantine equation. The solution is described in terms of $\frac{(m-1)(m+n-2)}{2} $ or $\frac{(m-1)(m+n-1)}{2}$ positive parameters depending on $n$ even or odd.…
We give a counting formula in terms of modified Hall-Littlewood polynomials and the chromatic quasisymmetric function for the number of points on an arbitrary Hessenberg variety over a finite field. As a consequence, we express the…
We investigate the number of integer solutions to a multiplicative Diophantine approximation problem and show that the associated counting function converges in distribution to a normal law. Our approach relies on the analysis of…
We introduce a filtering technique for Discontinuous Galerkin approximations of hyperbolic problems. Following an approach already proposed for the Hamilton-Jacobi equations by other authors, we aim at reducing the spurious oscillations…
Using elementary number theory we study Diophantine equations over the rational integers of the following form, $y^2=(x+a)(x+a+k)(x+b)(x+b+k)$, $y^2=c^2x^4+ax^2+b$ and $y^2=(x^2-1)(x^2-\alpha^2)(x^2-(\alpha+1)^2).$ We express their integer…
Magic-square constraints define Diophantine systems whose solutions, in several natural families, exhibit rigid periodic structure. We study this structure in an oracle setting, where a marked set of integers is given by black-box access…