Related papers: Counting monochromatic solutions to diagonal Dioph…
This article discusses the question - how to estimate the number of solutions of algebraic Diophantine equations with natural coefficients using Circular method developed by Hardy and Littlewood. This paper considers the estimate of the…
This paper investigates the upper bound of the number of integer (natural) solutions of inhomogeneous algebraic Diophantine diagonal equations with integer coefficients without a free member via the circle method of Hardy and Littlewood.…
Author developed a method in the paper, which, unlike the circle method of Hardy and Littlewood (CM), allows you to perform a lower estimate for the number of natural (integer) solutions of algebraic Diophantine equation with integer…
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…
We give upper bounds for the number of integral solutions of bounded height to a system of equations $f_i(x_1,\ldots,x_n) = 0$, $1 \leq i \leq r$, where the $f_i$ are polynomials with integer coefficients. The estimates are obtained by…
We count integer points on bihomogeneous varieties using the Hardy-Littlewood method. The main novelty lies in using the structure of bihomogeneous equations to obtain asymptotics in generically fewer variables than would be necessary in…
Using the circle method in combination with lattice point counting arguments, we show that for almost all homogeneous diophantine equations of additive type and degree $k$ in more than $4k$ variables, the Local-Global principle holds true.…
We investigate the growth of the polynomial and multilinear Hardy--Littlewood inequalities. Analytical and numerical approaches are performed and, in particular, among other results, we show that a simple application of the best known…
We describe algorithms for finding harmonic cochains, an essential ingredient for solving elliptic partial differential equations in exterior calculus. Harmonic cochains are also useful in computational topology and computer graphics. We…
Monograph "B. Grechuk, Polynomial Diophantine equations. A systematic approach" suggests solving Diophantine equations systematically in certain order. Many hundreds of the equations are left to the reader. Here, we provide complete…
In this paper we present a new method of solving certain quartic and higher degree homogeneous polynomial diophantine equations in four variables. The method can also be extended to solve simultaneous homogeneous polynomial diophantine…
It is important in drawing techniques to find combinations of two straight lines and their angle bisectors whose slopes are all rational numbers. This problem is reduced to solving the Diophantine equation $(a-c)^2(b^2+1) = (b-c)^2(a^2+1).$…
We consider a finite element method for elliptic equation with heterogeneous and possibly high-contrast coefficients based on primal hybrid formulation. A space decomposition as in FETI and BDCC allows a sequential computations of the…
We derive asymptotic formulas with a secondary term for the (smoothly weighted) count of number of integer solutions of height $\leqslant B$ with local conditions to the equation $F(x_1,x_2,x_3)=m$, where $F$ is a non-degenerate indefinite…
Given an equation, the integers $[n] = \{1, 2, \dots, n\}$ as inputs, and the colors red and blue, how can we color $[n]$ in order to minimize the number of monochromatic solutions to the equation, and what is the minimum? The answer is…
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.
Diophantine equations are multivariate equations, usually polynomial, in which only integer solutions are admitted. A brute force method for finding solutions would be to systematically substitute possible integer solutions and check for…
In this paper we will exhibit a rational parametric solution for the Diophantine equations of diagonal quartic varieties. Our approach is based on utilizing the Calabi-Yau varieties including elliptic curves and diagonal quartic surfaces.
In this paper, we propose two iterative methods for finding a common solution of a finite family of equilibrium problems for pseudomonotone bifunctions. The first is a parallel hybrid extragradient-cutting algorithm which is extended from…
The following question was asked by Prendiville: given an $r$-colouring of the interval $\{2, \dotsc, N\}$, what is the minimum number of monochromatic solutions of the equation $xy = z$? For $r=2$, we show that there are always…