Related papers: On integer solutions of Parsell-Vinogradov systems

In this paper, we will investigate the solvability of the equation $x_1^k + x_2^k + \ldots + x_s^k = n$, $n\in \mathbb{Z}_{p^k}$, $x_1,...,x_s\in \mathcal{A}$, $\mathcal{A}\subseteq \mathbb{Z}_{p^k}$. We will give a upper bound of the…

We prove some sharp upper bounds on the number of resonances associated with the Laplacian, or Laplacian plus potential, on a manifold with infinite cylidrical ends.

We shall show that, for any positive integer $D>0$ and any primes $p_1, p_2$ not dividing $D$, the diophantine equation $x^2+D=2^s p_1^k p_2^l$ has at most $63$ integer solutions $(x, k, l, s)$ with $x, k, l\geq 0$ and $s\in \{0, 2\}$.

Here we prove the existence of global in time regular solutions to the two-dimensional compressible Navier-Stokes equations supplemented with arbitrary large initial velocity $v\_0$ and almost constantdensity $\varrho\_0$, for large volume…

We develop a numerical method for solving a system of nonlinear integral equations involving two integral terms: at the current time t, one integral is taken from 0 to t, and a different integral is taken from t to infinity. We prove the…

We apply duality theory to discretized convex minimization problems to obtain computable guaranteed upper bounds for the distance of given discrete functions and the exact discrete minimizer. Furthermore, we show that the discrete duality…

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…

In this paper, we prove the Sendov conjecture for polynomials of degree nine. We use a new idea to obtain new upper bound for the $\sigma-$sum to zeros of the polynomial.

We show that the number of lines in an $m$--homogeneous supersolvable line arrangement is upper bounded by $3m-3$ and we classify the $m$--homogeneous supersolvable line arrangements with two modular points up-to lattice-isotopy. A lower…

A new series of integrable cases of the many-body problem in many-dimensional spaces is found. That series appears as a part of the larger series of integrable problems, which are in 1-1 correspondence with Krichever-Novikov algebras of…

We show that the higher order linear differential equation possesses all solutions of infinite order under certain conditions by extending the work of authors about second order differential equation \cite{dsm2}.

We study a nonlinear Schr\"{o}dinger-Poisson system which reduces to the nonlinear and nonlocal equation \[- \Delta u+ u + \lambda^2 \left(\frac{1}{\omega|x|^{N-2}}\star \rho u^2\right) \rho(x) u = |u|^{q-1} u \quad x \in \mathbb R^N, \]…

We give a simplified proof and an improvement of a recent theorem by A. Grigoriev, placing an upper bound for the number of roots of linear combinations of solutions to systems of linear equations with polynomial or rational coefficients.

This paper is devoted to finding solutions of polynomial equations in roots of unity. It was conjectured by S. Lang and proved by M. Laurent that all such solutions can be described in terms of a finite number of parametric families called…

In this paper, we consider Hartree-type equations on the two-dimensional torus and on the plane. We prove polynomial bounds on the growth of high Sobolev norms of solutions to these equations. The proofs of our results are based on the…

We present a wide class of differential systems in any dimension that are either integrable or complete integrable. In particular, our result enlarges a known family of planar integrable systems. We give an extensive list of examples that…

Infinite families of multi-indexed orthogonal polynomials are discovered as the solutions of exactly solvable one-dimensional quantum mechanical systems. The simplest examples, the one-indexed orthogonal polynomials, are the infinite…

Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$. We extract an asymptotic formula for the average divisor sum in a convenient form, and provide an explicit upper bound for this sum with the correct main…

Let $P_{d}(n)$ denote the number of $n \times \ldots \times n$ $d$-dimensional partitions with entries from $\left\{0,1,\ldots,n\right\}$. Building upon the works of Balogh-Treglown-Wagner and Noel-Scott-Sudakov, we show that when $d \to…

We give an upper bound on the number of perfect matchings in an undirected simple graph $G$ with an even number of vertices, in terms of the degrees of all the vertices in $G$. This bound is sharp if $G$ is a union of complete bipartite…