相关论文: An efficient deterministic test for Kloosterman su…
In the group-testing literature, efficient algorithms have been developed to minimize the number of tests required to identify all minimal "defective" sub-groups embedded within a larger group, using deterministic group splitting with a…
Sequential testing problems involve a complex system with several components, each of which is "working" with some independent probability. The outcome of each component can be determined by performing a test, which incurs some cost. The…
We connect the sixth power moment of Kloosterman sums to elliptic curves. This yields an elementary proof that $K_u$ with $p\nmid u$ are $O(p^{2/3})$.
We derive explicit formulas for some Kloosterman sums on $\Gamma_0(N)$, and for the Fourier coefficients of Eisenstein series attached to arbitrary cusps, around a general Atkin-Lehner cusp.
We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two polynomial time algorithms for this problem, one randomized and the other deterministic. The randomized…
The generalized egg dropping problem is a classic challenge in sequential decision-making. Standard dynamic programming evaluates the minimax minimum number of tests in $\mathcal{O}(K \cdot N^2)$ time. A known approach formulates the…
In this paper, we construct three binary linear codes $C(SO^{-}(2,q))$, $C(O^{-}(2,q))$, $C(SO^{-}(4,q))$, respectively associated with the orthogonal groups $SO^{-}(2,q)$, $O^{-}(2,q)$, $SO^{-}(4,q)$, with $q$ powers of two. Then we obtain…
We bound double sums of Kloosterman sums over a finite field ${\mathbb F}_{q}$, with one or both parameters ranging over an affine space over its prime subfield ${\mathbb F}_p \subseteq {\mathbb F}_{q} $. These are finite fields analogues…
Determining the presence of a potential optical source in the interest region is important for an imaging system and can be achieved by using hypothesis testing. The previous studies assume that the potential source is completely…
In this paper, we construct an infinite family of binary linear codes associated with double cosets with respect to certain maximal parabolic subgroup of the orthogonal group O(2n+1,q). Here q is a power of two. Then we obtain an infinite…
We consider the distribution of the polygonal paths joining partial sums of classical Kloosterman sums, as their parameter varies modulo a prime tending to infinity. Using independence of Kloosterman sheaves, we prove convergence in the…
Given a set of $n$ real numbers, the 3SUM problem is to decide whether there are three of them that sum to zero. Until a recent breakthrough by Gr{\o}nlund and Pettie [FOCS'14], a simple $\Theta(n^2)$-time deterministic algorithm for this…
In the kSUM problem we are given an array of numbers $a_1,a_2,...,a_n$ and we are required to determine if there are $k$ different elements in this array such that their sum is 0. This problem is a parameterized version of the well-studied…
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…
I introduce a general, Bayesian method for modelling univariate time series data assumed to be drawn from a continuous, stochastic process. The method accommodates arbitrary temporal sampling, and takes into account measurement…
We give a new stability estimate for the problem of determining the time-dependent zero order coefficient in a parabolic equation from a partial parabolic Dirichlet-to-Neumann map. The novelty of our result is that, contrary to the previous…
Friedman test is a nonparametric method that proposed for analyzing data from a randomized complete block design as a robust alternative to parametric method and widely applied in many fields such as agriculture, biology, business,…
We show that sums of the SL(3,Z) long element Kloosterman sum against a smooth weight function have cancellation due to the variation in argument of the Kloosterman sums, when each modulus is at least the square root of the other. Our main…
Let $\mathcal{K}(a)$ denote the Kloosterman sum on the finite field of order $2^n$. We give a simple characterization of $\mathcal{K}(a)$ modulo 16, in terms of the trace of $a$ and one other function. We also give a characterization of…
We present subquadratic algorithms, in the algebraic decision-tree model of computation, for detecting whether there exists a triple of points, belonging to three respective sets $A$, $B$, and $C$ of points in the plane, that satisfy a…