Related papers: Multiplicative Order of Gauss Periods

Let $A$ be an additive basis of order $h$ and $X$ be a finite nonempty subset of $A$ such that the set $A \setminus X$ is still a basis. In this article, we give several upper bounds for the order of $A \setminus X$ in function of the order…

For a smooth vectorial stationary Gaussian random field $X : \Omega \times \mathbb{R}^d \to \mathbb{R}^d$, we give necessary and sufficient conditions to have a finite second moment for the number of roots of $X(t) - u$. The results are…

Let A and B be finite sets in a commutative group. We bound |A+hB| in terms of |A|, |A+B| and h. We provide a submultiplicative upper bound that improves on the existing bound of Imre Ruzsa by inserting a factor that decreases with h.

The goal of this work is to prove an analogue of a recent result of Harper on almost sure lower bounds of random multiplicative functions, in a setting that can be thought of as a simplified function field analogue. It answers a question…

We improve the upper bounds (in terms of $n$) in [9] and [13] on the minimal number of elements required to generate a minimally transitive permutation group of degree $n$.

We show that finite fields over which there is a curve of a given genus g with its Jacobian having a small exponent, are very rare. This extends a recent result of W. Duke in the case g=1. We also show when g=1 or g=2 that our bounds are…

Counting number fields with prescribed Galois group is an enduring challenge in arithmetic statistics. Using the determinant method, we provide an upper bound for even groups, which is new in some cases.

In this short note we derive, for bounded domains, an upper bound for a Friedrichs type constant in a weighted Friedrichs type inequality. This upper bound generalizes a well known upper bound of the Friedrichs constant. This upper bound is…

We consider the Cauchy problem for the Kirchhoff equation on $\mathbb{T}^d$ with initial data of small amplitude $\varepsilon$ in Sobolev class. We prove a lower bound $\varepsilon^{-4}$ for the existence time, which improves the bound…

We solve the sup-norm problem for spherical Hecke-Maass newforms of square-free level for the group GL(2) over a number field, with a power saving over the local geometric bound simultaneously in the eigenvalue and the level aspect. Our…

In [1] a syndrome counting based upper bound on the minimum distance of regular binary LDPC codes is given. In this paper we extend the bound to the case of irregular and generalized LDPC codes over GF(q). The comparison to the lower bound…

A multiplicative stochastic process with the lower bound lognormally distributed is investigated. For the process, the model is constructed, and its distribution function (involving four parameters) and the related statistical properties…

We show that even mild improvements of the Polya-Vinogradov inequality would imply significant improvements of Burgess' bound on character sums. Our main ingredients are a lower bound on certain types of character sums (coming from works of…

We estimate the frequency of polynomial iterations which falls in a given multiplicative subgroup of a finite field of $p$ elements. We also give a lower bound on the size of the subgroup which is multiplicatively generated by the first $N$…

A completely elementary and self-contained proof of convergence of Gaussian multiplicative chaos is given. The argument shows further that the limiting random measure is nontrivial in the entire subcritical phase $(\gamma < \sqrt{2d})$ and…

We study product sets of finite arithmetic progressions of polynomials over a finite field. We prove a lower bound for the size of the product set, uniform in a wide range of parameters. We apply our results to resolve the function field…

We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…

We obtain new bounds, pointwisely and on average, for Dedekind sums $\mathsf{s}(\lambda,p)$ modulo a prime $p$ with $\lambda$ of small multiplicative order $d$ modulo $p$. Assuming the infinitude of Mersenne primes, the range of our results…

In the field of algebraic systems biology, the number of minimal polynomial models constructed using discretized data from an underlying system is related to the number of distinct reduced Gr\"obner bases for the ideal of the data points.…

Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$ which satisfy certain extra conditions. For this average sum we obtain an explicit upper bound, which is close to the optimal. As an application we improve…