Related papers: Multiplicative Order of Gauss Periods

It is a well-known fact that for any natural number $n$, there always exists a prime in $[n, 2n]$. Our aim in this note is to generalize this result to $[n, kn]$. A lower as well as an upper bound on the number of primes in $[n, kn]$ were…

An integral basis of the simplest number fields of degree 3,4 and 6 over $\mathbb{Q}$ are well-known, and widely investigated. We generalize the simplest number fields to any degree, and show that an integral basis of these fields is…

We prove a new lower bound for the dilatation of an arbitrary pseudo-Anosov map on a surface of genus g with n punctures. Our bound improves the former super-exponential dependence on the genus by a polynomial dependence.

For a given genus $g \geq 1$, we give lower bounds for the maximal number of rational points on a smooth projective absolutely irreducible curve of genus $g$ over ${\mathbb F}_q$. As a consequence of Katz-Sarnak theory, we first get for any…

The goal of this work is to prove a new sure upper bound in a setting that can be thought of as a simplified function field analogue. This result is comparable to a recent result of the author concerning almost sure upper bound of random…

This paper is an expanded version of a talk given at the Current Developments in Mathematics Conference last November (2002) on the work of Wilfred Schmid on periods of limits of Hodge structures. The paper begins with an exposition of the…

An upper bound of composition series of groups of finite order is obtained. The bound is a nontrivial bound and so far best possible.

In Part I we gave a polynomial growth lower-bound for the number of nodal domains of a Hecke-Maass cuspform in a compact part of the modular surface, assuming a Lindel\"of hypothesis. That was a consequence of a topological argument and…

We show that there is significant cancellation in certain exponential sums over small multiplicative subgroups of finite fields, giving an exposition of the arguments by Bourgain and Chang.

We report the finding of the new upper bound on the lowest positive integer $x$ for which the Mertens conjecture \begin{equation*} \left| \sum_{1 \leq n \leq x} \mu(n) \right| < \sqrt{x} \end{equation*} fails to hold: $x < \exp(1.017 \times…

This paper gives an improved sum-product estimate for subsets of a finite field whose order is not prime. It is shown, under certain conditions, that $$\max\{|A+A|,|A\cdot{A}|\}\gg{\frac{|A|^{12/11}}{(\log_2|A|)^{5/11}}}.$$ This new…

We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…

The author extends previous results to general classes of equations under weaker assumptions obtained in 2016 by Bao, Dong and Jiao concerning the study of the regularity of solutions for the first initial-boundary value problem for…

We prove the a priori bounds for infinitely renormalizable quadratic polynomials for which we can find an infinite sequence of primitive renormalizations such that the ratios of the periods of successive renormalizations is bounded. This…

We give a new asymptotic upper bound on the size of a code in the Grassmannian space. The bound is better than the upper bounds known previously in the entire range of distances except very large values.

We study sums of a random multiplicative function; this is an example, of number-theoretic interest, of sums of products of independent random variables (chaoses). Using martingale methods, we establish a normal approximation for the sum…

Let $A$ be a finite subset of $L^2(\mathbb{R})$ and $p,q\in\mathbb{N}$. We characterize the Schauder basis properties in $L^2(\mathbb{R})$ of the Gabor system $$G(1,p/q,A)=\{e^{2\pi i m x}g(x-np/q) : m,n\in \mathbb{Z}, g\in A\},$$ with a…

We determine the behavior of multiplicative functions vanishing at a positive proportion of prime numbers in almost all short intervals. Furthermore we quantify "almost all" with uniform power-saving upper bounds, that is, we save a power…

We derive upper and lower bounds on the determinant of an exponential matrix. They can be transformed into corresponding bounds for the determinant of a univariate Gaussian matrix.

Using the generic chaining method, we derive upper bounds for the \(L^q\) process of sub-Gaussian classes when \(1 \le q \le 2\), thereby resolving an open problem posed by Al-Ghattas, Chen, and Sanz-Alonso in arXiv:2502.16916. Combined…