Related papers: Upper bounds for integer solutions to a system of …

Let Q be a non-singular quadratic form with integer coefficients. When Q is indefinite we provide new upper bounds for the least non-trivial integral solution to the equation Q=0. When Q is positive definite we provide improved upper bounds…

We describe an algorithmic method to determine the image of restriction maps for Siegel modular forms with \textit{arbitrary} characters and arbitrary weight. A program has been implemented in the mathematical software \texttt{Java} to…

We study the problem of placing effective upper bounds for the number of zeros of solutions of Fuchsian systems on the Riemann sphere. The principal result is an explicit (non-uniform) upper bound, polynomially growing on the frontier of…

Boundary value problems for linear stationary dispersive equations of order $2l+1$, $l\in \mathbb{N}$ have been considered on finite intervals $(0,L)$. The existence and uniqueness of regular solutions have been established for general…

The fascinating question of the maximum value of twin-width on planar graphs is nowadays not far from the final resolution; there is a lower bound of 7 coming from a construction by Kr\'al' and Lamaison [arXiv, September 2022], and an upper…

We give upper bounds for the number of integral solutions of bounded height to a system of equations $f_i(x_1,\ldots,x_n) = 0$, $1 \leq i \leq r$, where the $f_i$ are polynomials with integer coefficients. The estimates are obtained by…

This paper is concerned with list decoding of $2$-interleaved binary alternant codes. The principle of the proposed algorithm is based on a combination of a list decoding algorithm for (interleaved) Reed-Solomon codes and an algorithm for…

We discuss the problem of finding an upper bound for the number of equilibrium points of a potential of several fixed point charges in R^n. This question goes back to J.C.Maxwell and M.Morse. Using fewnomial theory we show that for a given…

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…

We estimate the number of solutions to $|y^2 - x^3| \leq X$ with $N \leq y \leq 2N$, in terms of both $N$ and $X$.

We consider a system of $R$ cubic forms in $n$ variables, with integer coefficients, which define a smooth complete intersection in projective space. Provided $n\geq 25R$, we prove an asymptotic formula for the number of integer points in…

We prove the off-diagonal estimates of the bilinear iterated commutators in the two-weight setting. The upper bound is established via sparse domination, and the lower bound is proved by the median method. Our methods are so flexible so…

Let $A(n,d)$ (respectively $A(n,d,w)$) be the maximum possible number of codewords in a binary code (respectively binary constant-weight $w$ code) of length $n$ and minimum Hamming distance at least $d$. By adding new linear constraints to…

We proved that any even number not less than 6 can be expressed as the sum of two old primes, $2n=p_i+p_j$

A two-player one-round binary game consists of two cooperative players who each replies by one bit to a message that he receives privately; they win the game if both questions and answers satisfy some predetermined property. A game is…

A classic result of Cook et al. (1986) bounds the distances between optimal solutions of mixed-integer linear programs and optimal solutions of the corresponding linear relaxations. Their bound is given in terms of the number of variables…

It is conjectured that for any fixed relatively prime positive integers $a,b$ and $c$ all greater than 1 there is at most one solution to the equation $a^x+b^y=c^z$ in positive integers $x,y$ and $z$, except for specific cases. We develop…

We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through…

If a Lagrangian defining a variational problem has order $k$ then its Euler-Lagrange equations generically have order $2k$. This paper considers the case where the Euler-Lagrange equations have order strictly less than $2k$, and shows that…

We establish two-sided bounds for expectations of order statistics ($k$-th maxima) of moduli of coordinates of centered log-concave random vectors with uncorrelated coordinates. Our bounds are exact up to multiplicative universal constants…