Related papers: Explicit upper bounds on the least primitive root

Given a positive integer $k$ and graph $G$, the $\mathbb{Z}_k$-Ramsey number $R(G,\mathbb{Z}_k)$ is the least $N$ (if it exists) such that every coloring $f:E(K_N)\rightarrow \mathbb{Z}_k$ contains a copy $G'$ of $G$ such that $\sum_{e\in…

Using an approach of Bergh, we give an alternate proof of Bennett's result on lower bounds for non-negative matrices acting on non-increasing non-negative sequences in $l^p$ when $p \geq 1$ and its dual version, the upper bounds when $0<p…

We showed that the prime gap for a prime number p is less than or equal to the prime count of the prime number.

Let $p$ be a fixed prime, and let $v(a)$ stand for the exponent of $p$ in the prime factorization of the integer $a$. Let $f$ and $g$ be two monic polynomials with integer coefficients and nonzero resultant $r$. Write $S$ for the maximum of…

The cage problem asks for the smallest number $c(k,g)$ of vertices in a $k$-regular graph of girth $g$ and graphs meeting this bound are known as cages. While cages are known to exist for all integers $k \ge 2$ and $g \ge 3$, the exact…

If p is a prime, then the numbers 1, 2, ..., p-1 form a group under multiplication modulo p. A number g that generates this group is called a primitive root of p; i.e., g is such that every number between 1 and p-1 can be written as a power…

This paper proposes lower bounds on a quantity called $L^p$-norm joint spectral radius, or in short, $p$-radius, of a finite set of matrices. Despite its wide range of applications to, for example, stability analysis of switched linear…

Let $E$ be an elliptic curve defined over ${\mathbb Q}$. For a prime $p$ of good reduction for $E$, denote by $e_p$ the exponent of the reduction of $E$ modulo $p$. Under GRH, we prove that there is a constant $C_E\in (0, 1)$ such that $$…

Let $S$ be a set of $n$ points in the plane, $\wp(S)$ be the set of all simple polygons crossing $S$, $\gamma_P$ be the maximum angle of polygon $P \in \wp(S)$ and $\theta =min_{P\in\wp(S)} \gamma_P$. In this paper, we prove that…

Recently, Korkmaz established the lower bound of $3g - 2$ for the dimension of a faithful representation of the mapping class group of an orientable surface of genus $g \ge 3$. We raise this bound to $4g - 3$ in the setting of surfaces of…

We study the complexity of optimizing highly smooth convex functions. For a positive integer $p$, we want to find an $\epsilon$-approximate minimum of a convex function $f$, given oracle access to the function and its first $p$ derivatives,…

Expansive polynomials (whose roots are greater than 1 in modulus) often arise in dynamical systems and other computational problems. This paper examines the expansivity gap (the gap between 1 and the smallest modulus of the roots) of these…

In the present paper we obtain new upper bound estimates for the number of solutions of the congruence $$ x\equiv y r\pmod p;\quad x,y\in \mathbb{N},\quad x,y\le H,\quad r\in\cU, $$ for certain ranges of $H$ and $|\cU|$, where $\cU$ is a…

For every $p\leq n$ positive integer we obtain the lower bound $(3-\frac{1}{p+1})n^2-\big(2\binom{2p}{p+1}-\binom{2p-2}{p-1}+2\big)n$ for the rank of the $n\times n$ matrix multiplication. This bound improves the previous one…

Let $p$ be a prime number and let $G$ be a graph on $n$ vertices and $m$ edges. The zero-sum Ramsey number of $G$ over $\mathbb{Z}_p$, denoted by $R(G, \mathbb{Z}_p)$, is the minimum $\ell\in \mathbb{N}$ such that for any edge-coloring…

Let $p(z)=z^n+a_{n-1}z^{n-1}+a_{n-2}z^{n-2}+\ldots+a_1z+a_0$ be a complex polynomial with $a_0\neq 0$ and $n\geq 3$. Several new upper bounds for the moduli of the zeros of $p$ are developed. In particular, if…

We prove non-trivial lower bounds for sums of type $\sum_{p\sim P}g(\gamma\Log p)$, where $g$ is a non-negative $2\pi$-periodical function and $\gamma$ is a given parameter. As an application we prove that $\zeta(1+it)^{\pm1}\ll\Log\Log…

Many upper bounds for the moduli of polynomial roots have been proposed but reportedly assessed on selected examples or restricted classes only. Regarding quality measured in terms of worst-case relative overestimation of the maximum…

We prove that if p is a prime with a primitive root 2 then S_p(2^p)=p and give a sufficient condition for an equality of kind S_p(2^p)=+or-p.

We establish a lower bound for the cop number of graphs of high girth in terms of the minimum degree, and more generally, in terms of a certain growth condition. We show, in particular, that the cop number of any graph with girth $g$ and…