English

On generalizations of $p$-sets and their applications

Number Theory 2017-06-27 v1 Computational Complexity Information Theory math.IT Numerical Analysis

Abstract

The pp-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 pp-set. Based on the result, one shows that the pp-set performs well in numerical integration, in compressed sensing as well as in UQ. However, pp-set is somewhat rigid since the cardinality of the pp-set is a prime pp and the set only depends on the prime number pp. The purpose of this paper is to present generalizations of pp-sets, say Pd,pa,ϵ\mathcal{P}_{d,p}^{{\mathbf a},\epsilon}, which is more flexible. Particularly, when a prime number pp is given, we have many different choices of the new pp-sets. Under the assumption that Goldbach conjecture holds, for any even number mm, we present a point set, say Lp,q{\mathcal L}_{p,q}, with cardinality m1m-1 by combining two different new pp-sets, which overcomes a major bottleneck of the pp-set. We also present the upper bounds of the exponential sums over Pd,pa,ϵ\mathcal{P}_{d,p}^{{\mathbf a},\epsilon} and Lp,q{\mathcal L}_{p,q}, which imply these sets have many potential applications.

Keywords

Cite

@article{arxiv.1706.08023,
  title  = {On generalizations of $p$-sets and their applications},
  author = {Heng Zhou and Zhiqiang Xu},
  journal= {arXiv preprint arXiv:1706.08023},
  year   = {2017}
}

Comments

11 pages

R2 v1 2026-06-22T20:28:42.101Z