Let $S$ be a finite set of primes. The $S$-part $[m]_S$ of a non-zero integer $m$ is the largest positive divisor of $m$ that is composed of primes from $S$. In 2013, Gross and Vincent proved that if $f(X)$ is a polynomial with integer coefficients and with at least two roots in the complex numbers, then for every integer $x$ at which $f(x)$ is non-zero, we have (*) $[f(x)]_S\leq c\cdot |f(x)|^d$, where $c$ and $d$ are effectively computable and $d<1$. Their proof uses Baker-type estimates for linear forms in complex logarithms of algebraic numbers. As an easy application of the $p$-adic Thue-Siegel-Roth theorem we show that if $f(X)$ has degree $n\geq 2$ and no multiple roots, then an inequality such as (*) holds for all $d>1/n$, provided ...
Estimating averages of Dirichlet convolutions 1 * χ, for some real Dirichlet character χ of fixed m...
Denote by s(r)0 the least integer such that if s⩾s(r)0 , and F is a cubic form with real coe...
AbstractLet Fx1,…,xs be a form of degree d with integer coefficients. How large must s be to ensure ...
We determine the density of integral binary forms of given degree that have squarefree discriminant,...
We use recent results about linking the number of zeros on algebraic varieties over $\mathbb{C}$, de...
In this thesis we study several problems related to the representation of integers by binary forms a...
We will give new upper bounds for the number of solutions to the inequalities of the shape $|F(x , y...
International audienceLet F ∈ Z[X, Y ] be an integral binary form of degree g ≥2, and let Ψ_F (x, y)...
In this paper, we strengthen a result by Green about an analogue of Sarkozy's theorem in the setting...
An old conjecture of Erdős and Rényi, proved by Schinzel, predicted a bound for the number of terms ...
AbstractLet R[X] be the real polynomial ring in n variables. Pólya’s Theorem says that if a homogene...
Let $X$ be a sufficiently large positive integer. We prove that one may choose a subset $S$ of prime...
AbstractThis paper obtains a result on the finiteness of the number of integer solutions to decompos...
This thesis comes in four parts, which can be read independently of each other. In the first chapter...
AbstractUsing the procedure of G. I. Arkhipov and A. A. Karatsuba (Math. USSR-Izv. 19 (1982), 321–34...
Estimating averages of Dirichlet convolutions 1 * χ, for some real Dirichlet character χ of fixed m...
Denote by s(r)0 the least integer such that if s⩾s(r)0 , and F is a cubic form with real coe...
AbstractLet Fx1,…,xs be a form of degree d with integer coefficients. How large must s be to ensure ...
We determine the density of integral binary forms of given degree that have squarefree discriminant,...
We use recent results about linking the number of zeros on algebraic varieties over $\mathbb{C}$, de...
In this thesis we study several problems related to the representation of integers by binary forms a...
We will give new upper bounds for the number of solutions to the inequalities of the shape $|F(x , y...
International audienceLet F ∈ Z[X, Y ] be an integral binary form of degree g ≥2, and let Ψ_F (x, y)...
In this paper, we strengthen a result by Green about an analogue of Sarkozy's theorem in the setting...
An old conjecture of Erdős and Rényi, proved by Schinzel, predicted a bound for the number of terms ...
AbstractLet R[X] be the real polynomial ring in n variables. Pólya’s Theorem says that if a homogene...
Let $X$ be a sufficiently large positive integer. We prove that one may choose a subset $S$ of prime...
AbstractThis paper obtains a result on the finiteness of the number of integer solutions to decompos...
This thesis comes in four parts, which can be read independently of each other. In the first chapter...
AbstractUsing the procedure of G. I. Arkhipov and A. A. Karatsuba (Math. USSR-Izv. 19 (1982), 321–34...
Estimating averages of Dirichlet convolutions 1 * χ, for some real Dirichlet character χ of fixed m...
Denote by s(r)0 the least integer such that if s⩾s(r)0 , and F is a cubic form with real coe...
AbstractLet Fx1,…,xs be a form of degree d with integer coefficients. How large must s be to ensure ...