arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2212.12489math.NT
收藏

半素数分拆

Partitions into semiprimes

Madhuparna Das, Nicolas Robles, Alexandru Zaharescu, Dirk Zeindler

AI总结:

本文利用 Hardy-Littlewood 圆法的变体,推导了半素数集合上受限分拆函数的渐近公式,并推广了 Vinogradov 的结果,同时提出了处理一般加权集的方法。

摘要:

设 $\mathbb{P}$ 表示素数集,$\mathcal{N}\subset \mathbb{N}$ 是一个元素带有任意权重的集合。定义 $\mathfrak{p}_{\mathcal{N}}(n)$ 为受限分拆函数,它计算 $n$ 的所有部分都属于 $\mathcal{N}$ 的分拆个数。通过采用 Hardy-Littlewood 圆法的一个适当变体,我们给出了半素数集 $\mathcal{N} = \{p_1 p_2 : p_1, p_2 \in \mathbb{P}\}$ 在不同设置下(计数因子、重复计数因子、不同因子)$\mathfrak{p}_{\mathcal{N}}(n)$ 的渐近公式。为了处理小弧,我们研究了素数乘积上的双重 Weyl 和,并找到了相应的界,从而推广了 Vinogradov 关于分拆的一些结果。我们还描述了一种方法,通过为大弧、非主大弧和小弧分配不同策略,来找到一般加权集 $\mathcal{N}$ 的渐近分拆 $\mathfrak{p}_{\mathcal{N}}(n)$。我们的结果与分拆渐近学中其他近期结果进行了比较。

英文摘要:

Let $\mathbb{P}$ denote the set of primes and $\mathcal{N}\subset \mathbb{N}$ be a set with arbitrary weights attached to its elements. Set $\mathfrak{p}_{\mathcal{N}}(n)$ to be the restricted partition function which counts partitions of $n$ with all its parts lying in $\mathcal{N}$. By employing a suitable variation of the Hardy-Littlewood circle method we provide the asymptotic formula of $\mathfrak{p}_{\mathcal{N}}(n)$ for the set of semiprimes $\mathcal{N} = \{p_1 p_2 : p_1, p_2 \in \mathbb{P}\}$ in different set-ups (counting factors, repeating the count of factors, and different factors). In order to deal with the minor arc, we investigate a double Weyl sum over prime products and find its corresponding bound thereby extending some of the results of Vinogradov on partitions. We also describe a methodology to find the asymptotic partition $\mathfrak{p}_{\mathcal{N}}(n)$ for general weighted sets $\mathcal{N}$ by assigning different strategies for the major, non-principal major, and minor arcs. Our result is contextualized alongside other recent results in partition asymptotics.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑