Related papers: Character sums with division polynomials

Assuming Lang's conjectured lower bound on the heights of non-torsion points on an elliptic curve, we show that there exists an absolute constant C such that for any elliptic curve E/Q and non-torsion point P in E(Q), there is at most one…

We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…

Major controversy surrounds the use of Elliptic Curves in finite fields as Random Number Generators. There is little information however concerning the "randomness" of different procedures on Elliptic Curves defined over fields of…

Let t[n] be a sequence that satisfies a first order homogeneous recurrence t[n] = Q[n]*t[n-1], where Q is a polynomial with integer coefficients. The asymptotic behavior of the p-adic valuation of t[n] is described under the assumption that…

Let $q$ be a prime power, and $d$ a positive integer. We study the proportion of irreducible characters of $\mathrm{GL}(n,q)$ whose values evaluated on a fixed matrix $g$ are divisible by $d$. As $n$ approaches infinity, this proportion…

The q-characters of quantum loop algebras are very important objects in representation theory. In [20], we showed that q-characters factor as a power series of the form studied in [9] times a character, an important phenomenon which had…

Assuming the Generalized Riemann Hypothesis, the authors study when a character sum over all n <= x is o(x); they show that this holds if log x / log log q -> infinity and q -> infinity (q is the size of the finite field).

We develop the concept of character level for the complex irreducible characters of finite, general or special, linear and unitary groups. We give characterizations of the level of a character in terms of its Lusztig's label and in terms of…

In previous work we computed the number $C_n(q)$ of ideals of codimension $n$ of the algebra ${\mathbb{F}}_q[x,y,x^{-1}, y^{-1}]$ of two-variable Laurent polynomials over a finite field: it turned out that $C_n(q)$ is a palindromic…

We introduce the characteristic numbers and the chromatic polynomial of a tensor. Our approach generalizes and unifies the chromatic polynomial of a graph and of a matroid, characteristic numbers of quadrics in Schubert calculus, Betti…

A numerical semigroup is a subset of the non-negative integers that is closed under addition. For a randomly generated numerical semigroup, the expected number of minimum generators can be expressed in terms of a doubly-indexed sequence of…

Let $U_n$ denote the group of upper $n \times n$ unitriangular matrices over a fixed finite field $\mathbb{F}$ of order $q$. That is, $U_n$ consists of upper triangular $n \times n$ matrices having every diagonal entry equal to $1$. It is…

Given a finite field $\mathbb F_q$, a positive integer $n$ and an $\mathbb F_q$-affine space $\mathcal A\subseteq \mathbb F_{q^n}$, we provide a new bound on the sum $\sum_{a\in \mathcal A}\chi(a)$, where $\chi$ a multiplicative character…

Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we…

Energy level statistics of quantized chaotic systems have been evaluated in the semiclassical limit via their periodic orbits using the Gutzwiller and related trace formulae. Here we evaluate a spectral statistic of chaotic 4-regular…

Given an odd integer polynomial f(x) of a degree k >=3, we construct a non-negative valued, normed trigonometric polynomial with the spectrum in the set of integer values of f(x) not greater than n, and a small free coefficient…

Let f(z) = sum_n a(n) n^{(k-1)/2} e(nz) be a cusp form for Gamma_0(N), character chi and weight k geq 4. Let q(x) = x^2 + sx + t be a polynomial with integral coefficients. It is shown that sum_{n \leq X} a(q(n)) = cX + O(X^{6/7+eps}) for…

The discrete acyclic convolution computes the 2n-1 sums sum_{i+j=k; (i,j) in [0,1,2,...,n-1]^2} (a_i b_j) in O(n log n) time. By using suitable offsets and setting some of the variables to zero, this method provides a tool to calculate all…

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…

We develop a theory of sesquilinear forms over finite fields, investigating their representations via polynomials and coefficient matrices, along with classification results for these forms. Through their connection to quadratic forms, we…