Related papers: Character sums of Division polynomials twisted by …

A general method to express in terms of Gauss sums the number of rational points of subschemes of projective schemes over finite fields is applied to the image of the triple embedding $\mathbb{P}^1\hookrightarrow\mathbb{P}^3$. As a…

We derive special forms of the Poisson summation formula for even and odd functions, which are applied to obtain representations for Euler-type numbers and to sum various series related to elliptic functions.

We use bounds of mixed character sum to study the distribution of solutions to certain polynomial systems of congruences modulo a prime $p$. In particular, we obtain nontrivial results about the number of solution in boxes with the side…

This paper extends earlier work on the distribution in the complex plane of the roots of random polynomials. In this paper, the random polynomials are generalized to random finite sums of given "basis" functions. The basis functions are…

We ask whether every polynomial function that is non-negative on a real algebraic curve can be expressed as a sum of squares in the coordinate ring. Scheiderer has classified all irreducible curves for which this is the case. For reducible…

We improve a recent result of B. Hanson (2015) on multiplicative character sums with expressions of the type $a + b +cd$ and variables $a,b,c,d$ from four distinct sets of a finite field. We also consider similar sums with $a + b(c+d)$.…

In this note, an upper bound for the sum of fractional parts of certain smooth functions is established. Such sums arise naturally in numerous problems of analytic number theory. The main feature is here an improvement of the main term due…

The $T$-adic exponential sum of a polynomial in one variable is studied. An explicit arithmetic polygon in terms of the highest two exponents of the polynomial is proved to be a lower bound of the Newton polygon of the $C$-function of the…

Let $\pi$ be a $SL(3,\mathbb{Z})$ Hecke Maass-cusp form, $f$ be a $SL(2,\mathbb{Z})$ holomorphic cusp form or Maass-cusp form with normalized Fourier coefficients $\lambda_{\pi}(r,n) \text{ and }\lambda_{f}(n)$ respectively and $\chi$ be…

We obtain new bounds for short sums of isotypic trace functions associated to some sheaf modulo prime $p$ of bounded conductor, twisted by the Mobius function and also by the generalised divisor function. These trace functions include…

We show that a character sum attached to a family of 3-isogenies defined on the fibers of a certain elliptic surface over $\mathbb{F}_p$ relates to the class number of the quadratic imaginary number field $\Q(\sqrt{-p})$. In this sense,…

For any elliptic curve E defined over the rationals with complex multiplication and for every prime p, we describe the image of the mod p Galois representation attached to E. We deduce information about the field of definition of torsion…

We study some properties of the exponents of the terms appearing in the splitting perfect polynomials over $\mathbb{F}_{p^2}$, where $p$ is a prime number. This generalizes the work of Beard et al. over $\mathbb{F}_p$. Corrected paper.…

The power graph $\mathscr{P}(G)$ of a group $G$ is defined as the simple graph with vertex set $G$, and where two distinct vertices $x$ and $y$ are joined by an edge if and only if either $x= y^k$ or $y= x^k$, $k \in \mathbb{N}$. Here we…

Let $S_p(n)$ denote the sum of $p$th powers of the first $n$ positive integers $1^p + 2^p + \cdots + n^p$. In this paper, first we express $S_p(n)$ in the so-called Faulhaber form, namely, as an even or odd polynomial in $(n + 1/2)$,…

In this work we provide a novel approach for computing the coefficients of the characteristic polynomial of a square matrix. We demonstrate that each coefficient can be efficiently represented by a set of circle graphs. Thus, one can employ…

Using the cyclotomic identity we compute sums over d-tuples of monic polynomials in F_q[x] weighted by the multiplicity of their irreducible factors. As consequences we determine explicit expressions for the number of d-tuples of…

Sum of powers 1^p+...+n^p, with n and p being natural numbers and n>=1, can be expressed as a polynomial function of n of degree p+1. Such representations are often called Faulhaber formulae. A simple recursive algorithm for computing…

In this work, we establish a relationship between the sum of irreducible character degrees and the number of twisted involutions associated with the automorphisms of a finite group. We develop algorithmic frameworks for evaluating these…

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…