arXiv Analytics

Sign in

arXiv:1706.08023 [math.NT]AbstractReferencesReviewsResources

On generalizations of $p$-sets and their applications

Heng Zhou, Zhiqiang Xu

Published 2017-06-25Version 1

The $p$-set, which is in a simple analytic form, is well distributed in unit cubes. The well-known Weil's exponential sum theorem presents an upper bound of the exponential sum over the $p$-set. Based on the result, one shows that the $p$-set performs well in numerical integration, in compressed sensing as well as in UQ. However, $p$-set is somewhat rigid since the cardinality of the $p$-set is a prime $p$ and the set only depends on the prime number $p$. The purpose of this paper is to present generalizations of $p$-sets, say $\mathcal{P}_{d,p}^{{\mathbf a},\epsilon}$, which is more flexible. Particularly, when a prime number $p$ is given, we have many different choices of the new $p$-sets. Under the assumption that Goldbach conjecture holds, for any even number $m$, we present a point set, say ${\mathcal L}_{p,q}$, with cardinality $m-1$ by combining two different new $p$-sets, which overcomes a major bottleneck of the $p$-set. We also present the upper bounds of the exponential sums over $\mathcal{P}_{d,p}^{{\mathbf a},\epsilon}$ and ${\mathcal L}_{p,q}$, which imply these sets have many potential applications.

Related articles: Most relevant | Search more
arXiv:math/0010286 [math.NT] (Published 2000-10-29)
Comparison of algorithms to calculate quadratic irregularity of prime numbers
arXiv:2110.07271 [math.NT] (Published 2021-10-14, updated 2023-01-24)
Proofs, generalizations and analogs of Menon's identity: a survey
arXiv:1212.3989 [math.NT] (Published 2012-12-17)
Generalizations of Poly-Bernoulli numbers and polynomials