相关论文: An efficient deterministic test for Kloosterman su…
Generalized Cullen Numbers are positive integers of the form $C_b(n):=nb^n+1$. In this work we generalize some known divisibility properties of Cullen Numbers and present two primality tests for this family of integers. The first test is…
Determining whether a given integer is prime or composite is a basic task in number theory. We present a primality test based on quantum order finding and the converse of Fermat's theorem. For an integer $N$, the test tries to find an…
Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases. In this paper we use the method developed before to solve one more special case. We make extensive use of standard…
We study the computational complexity of the problem SFT (Sum-free Formula partial Trace): given a tensor formula F over a subsemiring of the complex field (C,+,.) plus a positive integer k, under the restrictions that all inputs are column…
We present fully polynomial-time (deterministic or randomised) approximation schemes for Holant problems, defined by a non-negative constraint function satisfying a generalised second order recurrence modulo a couple of exceptional cases.…
We consider the probability distributions of values in the complex plane attained by Fourier sums of the form \sum_{j=1}^n a_j exp(-2\pi i j nu) /sqrt{n} when the frequency nu is drawn uniformly at random from an interval of length 1. If…
In this paper, we construct the binary linear codes $C(SL(n,q))$ associated with finite special linear groups $SL(n,q)$, with both \emph{n,q} powers of two. Then, via Pless power moment identity and utilizing our previous result on the…
In this paper, $2\times2$ zero-sum games are studied under the following assumptions: $(1)$ One of the players (the leader) commits to choose its actions by sampling a given probability measure (strategy); $(2)$ The leader announces its…
Data sets in the form of binary matrices are ubiquitous across scientific domains, and researchers are often interested in identifying and quantifying noteworthy structure. One approach is to compare the observed data to that which might be…
We prove non-trivial bounds for bilinear forms with hyper-Kloosterman sums with characters modulo a prime $q$ which, for both variables of length $M$, are non-trivial as soon as $M\geq q^{3/8+\delta}$ for any $\delta>0$. This range, which…
Given a pair of non-negative random variables $X$ and $Y$, we introduce a class of nonparametric tests for the null hypothesis that $X$ dominates $Y$ in the total time on test order. Critical values are determined using bootstrap-based…
In combinatorial group testing problems Questioner needs to find a special element $x \in [n]$ by testing subsets of $[n]$. Tapolcai et al. introduced a new model, where each element knows the answer for those queries that contain it and…
We establish how the coefficients of a sparse polynomial system influence the sum (or the trace) of its zeros. As an application, we develop numerical tests for verifying whether a set of solutions to a sparse system is complete. These…
We reexamine the classical subset sum problem: given a set $X$ of $n$ positive integers and a number $t$, decide whether there exists a subset of $X$ that sums to $t$; or more generally, compute the set $\mbox{out}$ of all numbers…
We propose a general methodology for testing whether a given polynomial with integer coefficients is identically zero. The methodology evaluates the polynomial at efficiently computable approximations of suitable irrational points. In…
Erd\H{o}s-Ginzburg-Ziv theorem is a famous theorem in additive number theory, which states any sequence of $2n-1$ integers contains a subsequence of $n$ elements, with their sum being a multiple of $n$. In this article, we provide an…
If $E$ is an elliptic curve over $\mathbb{Q}$, then it follows from work of Serre and Hooley that, under the assumption of the Generalized Riemann Hypothesis, the density of primes $p$ such that the group of $\mathbb{F}_p$-rational points…
In this paper, motivated by the setting of white-space detection [1], we present theoretical and empirical results for detection of the zero-support E of x \in Cp (xi = 0 for i \in E) with reduced-dimension linear measurements. We propose…
We present an algorithm to decide whether or not a finitely generated subgroup of the isometry group of a locally finite simplicial tree is both discrete and free. The correctness of this algorithm relies on the following conjecture: every…
We study two schemes for a time-fractional Fokker-Planck equation with space- and time-dependent forcing in one space dimension. The first scheme is continuous in time and is discretized in space using a piecewise-linear Galerkin finite…