Related papers: $SL_4$-Kloosterman sum via the Bruhat decompositio…
We define certain higher-dimensional Dedekind sums that generalize the classical Dedekind-Rademacher sums, and show how to compute them effectively using a generalization of the continued-fraction algorithm. We present two applications.…
For a set $A$ of integers, the sumset $lA =A+...+A$ consists of those numbers which can be represented as a sum of $l$ elements of $A$ $$lA =\{a_1+... a_l| a_i \in A_i \}. $$ A closely related and equally interesting notion is that of…
In this paper, first we characterize closedness of range of the finite sum of weighted composition operators between different Lp-spaces. Then we discuss polar decomposition and invertibility of these operators.
The study of $n$-dimensional inverted Kloosterman sums was suggested by Katz (1995) who handled the case when $n=1$ from complex point of view. For general $n\geq 1$, the $n$-dimensional inverted Kloosterman sums were studied from both…
We obtain upper bounds for the fourth and higher moments of short exponential sums involving Fourier coefficients of holomorphic cusp forms twisted by rational additive twists with small denominators.
We use recently obtained bounds for sums of Kloosterman sums to bound the sum $\sum_{-D\leq d\leq D} \int_{-D}^D |\zeta(1/2+it,\lambda^d)|^4| \sum_{0<|\mu|^2\leq M} A(\mu)\lambda^d((\mu)) |\mu|^{-2it}|^2 {\rm d}t$, where $\lambda^d$ is the…
We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…
In this paper, we construct a binary linear code connected with the Kloosterman sum for $GL(2,q)$. Here $q$ is a power of two. Then we obtain a recursive formula generating the power moments 2-dimensional Kloosterman sum, equivalently that…
The set of all uniquely decipherable (UD) codes is partially ordered by refinement, meaning that all strings in the cruder code can be represented as concatenations of strings taken from the finer code. The Kraft sum is a monotone…
We obtain several estimates for bilinear form with Kloosterman sums. Such results can be interpreted as a measure of cancellations amongst with parameters from short intervals. In particular, for certain ranges of parameters we improve some…
Sums of Kloosterman sums have deep connections with the theory of modular forms, and their estimation has many important consequences. Kuznetsov used his famous trace formula and got a power-saving estimate with respect to $x$ with implied…
Cross-Lingual Summarization (CLS) is the task to generate a summary in one language for an article in a different language. Previous studies on CLS mainly take pipeline methods or train the end-to-end model using the translated parallel…
A subset $A$ of a group $G$ is called $(k, l)$-{\it sumset}, if $A= kB-lB$ for some $B\subseteq G$, where $kB-lB={x_1+...+x_k-x_{k+1}-...-x_{k+l} : x_1,..., x_{k+l}\in B}.$ Upper and lower bounds for the number $(k, l)$-sumsets in groups of…
A generalization of the classical Lipschitz summation formula is proposed. It involves new polylogarithmic rational functions constructed via the Fourier expansion of certain sequences of Bernoulli--type polynomials. Related families of…
The main purpose of this paper is to study the hybrid mean value problem involving generalized Dedekind sums, generalized Hardy sums and Kloosterman sums, and give some exact computational formulae for them by using the properties of Gauss…
In this paper we explore a new hierarchy of classes of languages and infinite words and its connection with complexity classes. Namely, we say that a language belongs to the class $L_k$ if it is a subset of the catenation of $k$ languages…
Let $A \subset \mathbb{R}$ be finite. We quantitatively improve the Balog-Wooley decomposition, that is $A$ can be partitioned into sets $B$ and $C$ such that $$\max\{E^+(B) , E^{\times}(C)\} \lesssim |A|^{3 - 7/26}, \ \ \max \{E^+(B,A) ,…
A family of quaternary sequences over Z4 is defined based on the Ding-Helleseth generalized cyclotomic classes modulo pq for two distinct odd primes p and q. The linear complexity is determined by computing the defining polynomial of the…
We generalise the work of Sarnak-Tsimerman to twisted sums of Kloosterman sums and thus give evidence towards the twisted Linnik-Selberg Conjecture.
We describe and experimentally evaluate a method for automatically clustering words according to their distribution in particular syntactic contexts. Deterministic annealing is used to find lowest distortion sets of clusters. As the…