Related papers: Matrix Kloosterman sums

We consider finite families of SL(2,R) matrices whose products display uniform exponential growth. These form open subsets of (SL(2,R))^N, and we study their components, boundary, and complement. We also consider the more general situation…

We present several sequences of Euler sums involving odd harmonic numbers. The calculational technique is based on proper two-valued integer functions, which allow to compute these sequences explicitly in terms of zeta values only.

In this paper we focus on two new families of polynomials which are connected with exponential polynomials and geometric polynomials. We discuss their generalizations and show that these new families of polynomials and their generalizations…

We derive and prove an explicit formula for the sum of the fractional parts of certain geometric series. Although the proof is straightforward, we have been unable to locate any reference to this result. This summation formula allows us to…

We devise the first constant-factor approximation algorithm for finding an integral multi-commodity flow of maximum total value for instances where the supply graph together with the demand edges can be embedded on an orientable surface of…

We revisit a recent bound of I. Shparlinski and T. P. Zhang on bilinear forms with Kloosterman sums, and prove an extension for correlation sums of Kloosterman sums against Fourier coefficients of modular forms. We use these bounds to…

Assuming that the Generalized Riemann Hypothesis (GRH) holds, we prove an explicit formula for the number of representations of an integer as a sum of $k\geq 5$ primes. Our error terms in such a formula improve by some logarithmic factors…

We establish a simple identity and using it we find a new proof of a result of Kloosterman.

The family of cycle completable graphs has several cryptomorphic descriptions, the equivalence of which has heretofore been proven by a laborious implication-cycle that detours through a motivating matrix completion problem. We give a…

We show that the multiple divisor functions of integers in invertible residue classes modulo a prime number, as well as the Fourier coefficients of GL(N) Maass cusp forms for all N larger than 2, satisfy a central limit theorem in a…

We consider the following inference problem: Given a set of edge-flow signals observed on a graph, lift the graph to a cell complex, such that the observed edge-flow signals can be represented as a sparse combination of gradient and curl…

In this paper, we construct four infinite families of ternary linear codes associated with double cosets in $O(2n+1,q)$ with respect to certain maximal parabolic subgroup of the special orthogonal group $SO(2n+1,q)$. Here $q$ is a power of…

Let f be a polinomial with coefficients in a finite field F. Let $\Psi : F \to C^{\ast}$ be a non-trivial additive character. In this paper we give bounds for the exponential sums $\sum_{x\in F^n} \Psi (Tr_{F/F_p} (f(x)))$ in some cases…

Multiple harmonic sums are iterated generalizations of harmonic sums. Recently Dilcher has considered congruences involving q-analogs of these sums in depth one. In this paper we shall study the homogeneous case for arbitrary depth by using…

We investigate the solubility of the congruence xy=1 (mod p), where p is a prime and x,y are restricted to lie in suitable short intervals. Our work relies on a mean value theorem for incomplete Kloosterman sums.

We study the symmetry groups and winding numbers of planar curves obtained as images of weighted sums of exponentials. More generally, we study the image of the complex unit circle under a finite or infinite Laurent series using a…

We prove quantitative estimates on flows of ordinary differential equations with vector field with gradient given by a singular integral of an $L^1$ function. Such estimates allow to prove existence, uniqueness, quantitative stability and…

We study polytopes defined by inequalities of the form $\sum_{i\in I} z_{i}\leq 1$ for $I\subseteq [d]$ and nonnegative $z_i$ where the inequalities can be reordered into a matrix inequality involving a column-convex $\{0,1\}$-matrix. These…

We use the resolution of singularities algorithm of [G4] to provide new estimates for exponential sums as well as new bounds on how often a function f(x) such as a polynomial with integer coefficients is divisible by various powers of a…

We prove that the Kloosterman sum $S(1,1;c)$ can change sign infinitely often as $c$ runs over squarefree moduli with at most 10 prime factors, which improves the previous results of E. Fouvry and Ph. Michel, J. Sivak-Fischler and K.…