Related papers: Two Combinatorial Geometric Problems Involving Mod…

Recently, a lower bound was established on the size of linear sets in projective spaces, that intersect a hyperplane in a canonical subgeometry. There are several constructions showing that this bound is tight. In this paper, we generalize…

We use recent bounds on bilinear sums with modular square roots to study the distribution of solutions to congruences $x^2 \equiv p \pmod q$ with primes $p\le P$ and integers $q \le Q$. This can be considered as a combined scenario of Duke,…

Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potential energy of spherical designs. This approach gives unified bounds that are valid for a large class of potential functions. Our lower bounds…

We show how positive unital linear maps can be used to obtain lower bounds for the maximum distance between the eigenvalues of two normal matrices. Some related bounds for the spread and condition number of Hermitian matrices are also…

We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…

Classical results of second order parabolic quasi-linear equations always require that the nonlinear terms are controlled by a power of the unknown functions and their first derivatives. We improve the previous results. More precisely, in…

Let $q=p^\alpha$ be a fixed prime power, $k\geq 2$ be an integer. We give a new upper bound for the size of $k$-wise $q$-modular $L$-avoiding $L$-intersecting set systems, where $L$ is any proper subset of $\{0, \ldots , q-1\}$. Our proof…

We extend bounds on additive energies of modular square roots by Dunn, Kerr, Shparlinski, Shkredov and Zaharescu and apply these results to obtain bounds on certain bilinear exponential sums with modular square roots. From here, we make…

We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the…

We bound the modulus of continuity of solutions to quasilinear parabolic equations in one space variable in terms of the initial modulus of continuity and elapsed time. In particular we characterize those equations for which the Lipschitz…

For a composite $n$ and an odd $c$ with $c$ not dividing $n$, the number of solutions to the equation $n+a\equiv b\mod c$ with $a,b$ quadratic residues modulus $c$ is calculated. We establish a direct relation with those modular solutions…

We give a lower bound for the widths of the collars of certain short partial pants decomposition of the surface. Then we apply this to obtain upper bounds of the renormalized volume of certain Schottky manifolds in terms of the hyperbolic…

We study theoretically the responsivity of optical modulators. For the case of linear response we find using perturbation theory an upper bound imposed upon the responsivity. For the case of two mode modulator we find a lower bound imposed…

We provide a definitive classification of all finite sets of regular polygons that admit a tiling of the hyperbolic plane, thereby establishing the decidability of the Domino Problem for this class of prototiles. We show that admissibility…

Let $p$ be a large prime number, $K,L,M,\lambda$ be integers with $1\le M\le p$ and ${\color{red}\gcd}(\lambda,p)=1.$ The aim of our paper is to obtain sharp upper bound estimates for the number $I_2(M; K,L)$ of solutions of the congruence…

We find upper bounds for the essential dimension of various moduli stacks of $\sln$-bundles over a curve. When $n$ is a prime power, our calculation computes the essential dimension of the stack of stable bundles exactly and the essential…

A detailed combinatorial analysis of planar convex lattice polygonal lines is presented. This makes it possible to answer an open question of Vershik regarding the existence of a limit shape when the number of vertices is constrained.

We propose upper bounds for the number of modular constituents of the restriction modulo $p$ of a complex irreducible character of a finite group, and for its decomposition numbers, in certain cases.

We consider a problem posed by Shparlinski, of giving nontrivial bounds for rational exponential sums over the arithmetic function $\tau(n)$, counting the number of divisors of $n$. This is done using some ideas of Sathe concerning the…

In this paper we give lower bounds for the representation of real univariate polynomials as sums of powers of degree 1 polynomials. We present two families of polynomials of degree d such that the number of powers that are required in such…