Related papers: An estimate for Frobenius' diophantine problem in …

Let $1<k<7/6$, $\lambda_1,\lambda_2,\lambda_3$ and $\lambda_4$ be non-zero real numbers, not all of the same sign such that $\lambda_1/\lambda_2$ is irrational and let $\omega$ be a real number. We prove that the inequality…

We study connections between linear equations over various semigroups and recursively enumerable sets of positive integers. We give variants of the universal Diophantine representation of recursively enumerable sets of positive integers…

We show that the denominator formula for the strange series of affine superalgebras, conjectured by Kac and Wakimoto and proved by Zagier, follows from a classical determinant evaluation of Frobenius. As a limit case, we obtain exact…

For any $\varepsilon > 0$ we derive effective estimates for the size of a non-zero integral point $m \in \mathbb{Z}^d \setminus \{0\}$ solving the Diophantine inequality $\lvert Q[m] \rvert < \varepsilon$, where $Q[m] = q_1 m_1^2 + \ldots +…

We establish improved mean value estimates associated with the number of integer solutions of certain systems of diagonal equations, in some instances attaining the sharpest conjectured conclusions. This is the first occasion on which…

The paper is devoted to the problem of estimating the constant of the best Diophantine approximations. The estimates of lower bound $ C_n $ for $ n = 5 $ and $ n = 6 $ was improved. The first chapter gives an overview of the history of…

Let E_n={x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. If Matiyasevich's conjecture on finite-fold Diophantine representations is true, then for every computable function f:N->N there is a positive integer m(f) such that for…

Let $1 < k < 33 / 29$. We prove that if $\lambda_1$, $\lambda_2$ and $\lambda_3$ are non-zero real numbers, not all of the same sign and that $\lambda_1 / \lambda_2$ is irrational and $\varpi$ is any real number, then for any $\eps > 0$ the…

Let $n$ be a non-zero integer. A set $S$ of positive integers is a Diophantine tuple with the property $D(n)$ if $ab+n$ is a perfect square for each $a,b \in S$ with $a \neq b$. It is of special interest to estimate the quantity $M_n$, the…

In this note we consider the title Diophantine equation from both theoretical as well as experimental point of view. In particular, we prove that for $k=4, 6$ and each choice of the signs our equation has infinitely many co-prime positive…

We establish a strong form of Littlewood's conjecture with inhomogeneous shifts, for a full-dimensional set of pairs of badly approximable numbers on a vertical line. We also prove a uniform assertion of this nature, generalising a strong…

We refine a result of the last two Authors of [8] on a Diophantine approximation problem with two primes and a $k$-th power of a prime which was only proved to hold for $1<k<4/3$. We improve the $k$-range to $1<k\le 3$ by combining Harman's…

We establish a new upper bound for the number of rationals up to a given height in a missing-digit set, making progress towards a conjecture of Broderick, Fishman, and Reich. This enables us to make novel progress towards another conjecture…

In this paper, we consider the exponential Diophantine equation \( (2^k-1)(b^k-1)=y^q \) with $k\ge 2$, odd integer $b$ and an odd prime exponent $q$ and obtain effective upper bounds for $q$ in terms of $b$. In particular, we show that…

This paper explores multiple closely related themes: bounding the complexity of Diophantine equations over the integers and developing mathematical proofs in parallel with formal theorem provers. Hilbert's Tenth Problem (H10) asks about the…

In this paper, we consider some hybrid Diophantine equations of addition and multiplication. We first improve a result on new Hilbert-Waring problem. Then we consider the equation \begin{equation} \begin{cases} A+B=C ABC=D^n \end{cases}…

We propose a method for computing upper bounds for the Heilbronn problem for triangles.

The following result, a consequence of Dumas criterion for irreducibility of polynomials over integers, is generally proved using the notion of Newton diagram: Let $f(x)$ be a polynomial with integer coefficients and $k$ be a positive…

Zarankiewicz's problem asks for the largest possible number of edges in a graph that does not contain a $K_{u,u}$ subgraph for a fixed positive integer $u$. Recently, Fox, Pach, Sheffer, Sulk and Zahl considered this problem for…

Let $N$ be a sufficiently large, odd integer. We prove an asymptotic formula for the number of representations of $N$ as the sum of three primes, one of which is smaller than a given $U$. By inserting the currently best zero-density…