Related papers: On integer solutions of Parsell-Vinogradov systems

This paper solves the open problem on the sharp bound for the number of isolated solutions in $\mathbf{R}_*^n$ to the real system of $n$ polynomial equations in $n$ variables, i.e., the real $n$ by $n$ fewnomial system. For an unmixed…

Let $P$ be a polynomial with integer coefficients and degree at least two. We prove an upper bound on the number of integer solutions $n\leq N$ to $n! = P(x)$ which yields a power saving over the trivial bound. In particular, this applies…

In this paper, we prove the finiteness of the number of integer solutions of the decomposable form inequalities. We also study the number of integer solutions of a sequence of decomposable form inequalities.

The well known binary and decimal representations of the integers, and other similar number systems, admit many generalisations. Here, we investigate whether still every integer could have a finite expansion on a given integer base b, when…

We obtain a small improvement of Gallagher's larger sieve and we extend it to higher dimensions. We also obtain two interesting upper bounds for the number of solutions to polynomial congruences.

We use a generalization of Vinogradov's mean value theorem of S. Parsell, S. Prendiville and T. Wooley and ideas of W. Schmidt to give nontrivial bounds for the number of solutions to polynomial congruences, for arbitrary polynomials, when…

Given an integer $d \geq 2$, $s \in (0,1]$, and $t \in [0,2(d-1)]$, suppose a set $X$ in $\mathbb{R}^d$ has the following property: there is a collection of lines of packing dimension $t$ such that every line from the collection intersects…

In this note we investigate the set $S(n)$ of positive integer solutions of the title Diophantine equation. In particular, for a given $n$ we prove boundedness of the number of solutions, give precise upper bound on the common value of…

We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.

We obtain a new bound for incomplete Gauss sums modulo primes. Our argument falls under the framework of Vinogradov's method which we use to reduce the problem under consideration to bounding the number of solutions to two distinct systems…

We study the solution set to multivariate Chebyshev approximation problem, focussing on the ill-posed case when the uniqueness of solutions can not be established via strict polynomial separation. We obtain an upper bound on the dimension…

We show an improved global well-posedness result for the Zakharov system in two space dimensions with minimal regularity assumptions for the data. Especially we are able to allow Schroedinger and wave data, which do not belong to H^1 and…

For each $n$, let RD$(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In this paper, we recover an algorithm of Sylvester for determining…

We prove a result on lower bounds in large dimensions.

The invariants of all complex solvable rigid Lie algebras up to dimension eight are computed. Moreover we show, for rank one solvable algebras, some criteria to deduce to non-existence of non-trivial invariants or the existence of…

We determine all Chern numbers of smooth complex projective varieties of dimension at least four which are determined up to finite ambiguity by the underlying smooth manifold. We also give an upper bound on the dimension of the space of…

We establish a Polya-Vinogradov-type bound for finite periodic multipicative characters on the Gaussian integers.

In this paper, we bound the number of solutions to a quadratic Vinogradov system of equations in which the variables are required to satisfy digital restrictions in a given base. Certain sets of permitted digits, namely those giving rise to…

In this paper, we obtain an asymptotic formula for the number of integral solutions to a system of diagonal equations. We obtain an asymptotic formula for the number of solutions with variables restricted to smooth numbers as well. We…

We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…