Related papers: On products of disjoint blocks of arithmetic progr…

In this paper we discuss a general problem on metrical Diophantine approximation associated with a system of linear forms. The main result is a zero-one law that extends one-dimensional results of Cassels and Gallagher. The paper contains a…

We prove a result on the existence of linear forms of a given Diophantine type.

Given two relatively prime numbers $a$ and $b$, it is known that exactly one of the two Diophantine equations has a nonnegative integral solution $(x,y)$: $$ ax + by \ =\ \frac{(a-1)(b-1)}{2}\quad \mbox{ and }\quad 1 + ax + by \ =\…

We study quadratic approximations for two families of hyperquadratic continued fractions in the field of Laurent series over a finite field. As the first application, we give the answer to a question of the second author concerning…

Let R be a recursive subring of a number field. We show that recursively enumerable sets are diophantine for the polynomial ring R[Z].

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…

Using the variational principle in parametric geometry of numbers, we compute the Hausdorff and packing dimension of Diophantine sets related to exponents of Diophantine approximation, and their intersections. In particular, we extend a…

Gallagher's theorem describes the multiplicative diophantine approximation rate of a typical vector. We establish a fully-inhomogeneous version of Gallagher's theorem, a diophantine fibre refinement, and a sharp and unexpected threshold for…

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…

We are motivated by a result of Alzer and Luca who presented all the integer solutions to the relations $(k!)^n-k^n=(n!)^k-n^k$ and $(k!)^n+k^n=(n!)^k+n^k$. We modify the equations by considering the double factorial instead and present all…

Let $s(n)$ be the number of nonzero bits in the binary digital expansion of the integer $n$. We study, for fixed $k,\ell,m$, the Diophantine system $$ s(ab)=k, \quad s(a)=\ell,\quad \mbox{and }\quad s(b)=m, $$ in odd integer variables…

Let $Q_1,...,Q_r\in \mathbb{Z}[x]$ be polynomials having $0$ as a root. Let $f(x,y)\in\mathbb{Z}[x,y]$ be a homogeneous polynomial with factorization $f(x,y)=f_1(x,y)^{e_1}\cdots f_u(x,y)^{e_u}$, where $f_i(x,y)$ are irreducible homogeneous…

We study questions inspired by Erd\H os' celebrated distance problems with dot products in lieu of distances, and for more than a single pair of points. In particular, we study point configurations present in large finite point sets in the…

We obtain an asymptotic formula for the number of ways to represent every reduced residue class as a product of a prime and square-free integer. This may be considered as a relaxed version of a conjecture of Erd\"os, Odlyzko, and…

A semiprime is a natural number which is the product of two (not necessarily distinct) prime numbers. Let $F(x_1, \ldots, x_n)$ be a degree $d$ homogeneous form with integer coefficients. We provide sufficient conditions, similar to those…

S-arithmetic Khintchine-type theorem for products of non-degenerate analytic p-adic manifolds is proved for the convergence case. In the p-adic case the divergence part is also obtained.

In two dimensions, Gallagher's theorem is a strengthening of the Littlewood conjecture that holds for almost all pairs of real numbers. We prove an inhomogeneous fibre version of Gallagher's theorem, sharpening and making unconditional a…

In this paper, by using the theory of elliptic curves, we discuss several Diophantine equations related with the so-called figurate primes. Meanwhile, we raise several conjectures related with figurate primes and Hilbert's 8th problem,…

In this paper we discourse basises of representable algebras. This question lead to arithmetic problems. We prove algorithmical solvability of exponential-Diophantine equations in rings represented by matrices over fields of positive…

Let $\alpha$ and $\beta$ be irrational real numbers and $0<\F<1/30$. We prove a precise estimate for the number of positive integers $q\leq Q$ that satisfy $\|q\alpha\|\cdot\|q\beta\|<\F$. If we choose $\F$ as a function of $Q$ we get…