Related papers: Multiplicative Order of Gauss Periods

We establish a Polya-Vinogradov-type bound for finite periodic multipicative characters on the Gaussian integers.

We prove Gaussian upper and lower bounds for the fundamental solutions of a class of degenerate parabolic equations satisfying a weak Hormander condition. The bound is independent of the smoothness of the coefficients and generalizes…

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…

We give an upper bound on the number of extensions of a fixed number field of prescribed degree and discriminant less than X; these bounds improve on work of Schmidt. We also prove various related results, such as lower bounds for the…

A general description of the Vi\`ete coefficients of the gaussian period polynomials is given, in terms of certain symmetric representations of the subgroups and the corresponding quotient groups of the multiplicative group…

We present exponential and super factorial lower bounds on the number of Hamiltonian cycles passing through any edge of the basis graphs of a graphic, generalized Catalan and uniform matroids. All lower bounds were obtained by a common…

We give lower bounds for the degree of multiplicative combinations of iterates of rational functions (with certain exceptions) over a general field, establishing the multiplicative independence of said iterates. This leads to a…

We improve certain degree bounds for Grobner bases of polynomial ideals in generic position. We work exclusively in deterministically verifiable and achievable generic positions of a combinatorial nature, namely either strongly stable…

In this paper we give a short, new proof of a natural generalization of Gerzon's bound. This bound improves the Delsarte, Goethals and Seidel's upper bound in a special case. Our proof is a simple application of the linear algebra bound…

We obtain new bounds on short Weil sums over small multiplicative subgroups of prime finite fields which remain nontrivial in the range the classical Weil bound is already trivial. The method we use is a blend of techniques coming from…

We present a new upper bound for the orders of derivatives in the Rosenfeld-Groebner algorithm. This algorithm computes a regular decomposition of a radical differential ideal in the ring of differential polynomials over a differential…

An elementary approach is shown which derives the values of the Gauss sums over $\mathbb F_{p^r}$, $p$ odd, of a cubic character without using Davenport-Hasse's theorem. New links between Gauss sums over different field extensions are shown…

Given a finitely generated multiplicative subgroup of rational numbers $\Gamma$, assuming the Generalized Riemann Hypothesis, we determine an asymptotic formula for average over prime numbers, powers of the order of the reduction group…

We obtain a series of lower bounds for the product set of combinatorial cubes, as well as some non--trivial upper estimates for the multiplicative energy of such sets.

We prove new upper bounds for the sup-norm of Hecke Maa{\ss} newforms on $GL(2)$ over a number field. Our newforms are more general than those considered in a recent paper by Blomer, Harcos, Maga, and Mili\`cevi\`c: we do not require square…

This paper investigates the quadratic irrationals that arise as periodic points of the Gauss type shift associated to the odd continued fraction expansion. It is shown that these numbers, which we call O-reduced, when ordered by the length…

In this article we present a new method to obtain polynomial lower bounds for Galois orbits of torsion points of one dimensional group varieties.

We construct two new families of basis for finite field extensions. Basis in the first family, the so-called elliptic basis, are not quite normal basis, but they allow very fast Frobenius exponentiation while preserving sparse…

We introduce a technique for proving lower bounds on the essential dimension of split reductive groups. As an application, we strengthen the best previously known lower bounds for various split simple algebraic groups, most notably for the…

Given a global field K and a polynomial f defined over K of degree at least two, Morton and Silverman conjectured in 1994 that the number of K-rational preperiodic points of f is bounded in terms of only the degree of K and the degree of f.…