中文
相关论文

相关论文: Exponential sums over M\"{o}bius convolutions with…

200 篇论文

We examine exponential sums of the form $\sum_{n \le X} w(n) e^{2\pi i\alpha n^k}$, for $k=1,2$, where $\alpha$ satisfies a generalized Diophantine approximation and where $w$ are different arithmetic functions that might be multiplicative,…

数论 · 数学 2024-12-31 Anji Dong , Nicolas Robles , Alexandru Zaharescu , Dirk Zeindler

In this article, we consider the weighted partition function $p_f(n)$ given by the generating series $\sum_{n=1}^{\infty} p_f(n)z^n = \prod_{n\in\mathbb{N}^{*}}(1-z^n)^{-f(n)}$, where we restrict the class of weight functions to strongly…

数论 · 数学 2024-12-31 Madhuparna Das

Let $\mathfrak{p}_{\mathbb{P}_r}(n)$ denote the number of partitions of $n$ into $r$-full primes. We use the Hardy-Littlewood circle method to find the asymptotic of $\mathfrak{p}_{\mathbb{P}_r}(n)$ as $n \to \infty$. This extends previous…

数论 · 数学 2025-05-01 Anji Dong , Nicolas Robles , Alexandru Zaharescu , Dirk Zeindler

We introduce a general class $F_0$ of additive functions $f$ such that $f(p) = 1$ and prove a tight bound for exponential sums of the form $\sum_{n \le x} f(n) e(\alpha n)$ where $f \in F_0$ and $e(\theta) = \exp(2\pi i \theta)$. Both…

数论 · 数学 2026-02-13 Ayla Gafni , Nicolas Robles

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…

Let $w$ be a weight on the unit disk $\mathbb{D}$ having the form \[w(z)=|v(z)|^2\prod_{k=1}^s\left|\frac{z-a_k}{1-z\overline{a}_k}\right|^{m_k}\,,\quad m_k>-2,\ |a_k|<1,\] where $v$ is analytic and free of zeros in $\overline{\mathbb{D}}$,…

经典分析与常微分方程 · 数学 2023-10-12 Erwin Miña-Díaz

In his paper, W. M. Schmidt obtained an exponential sum estimate for systems of polynomials not including linear polynomials, which was then used to apply the Hardy-Littlewood circle method. We prove an analogous estimate for systems…

数论 · 数学 2016-07-29 Shuntaro Yamagishi

We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…

组合数学 · 数学 2007-05-23 S. Corteel , C. D. Savage

We consider random orthonormal polynomials $$ P_{n}(x)=\sum_{i=0}^{n}\xi_{i}p_{i}(x), $$ where $\xi_{0}$, . . . , $\xi_{n}$ are independent random variables with zero mean, unit variance and uniformly bounded $(2+\ep_0)$-moments, and…

概率论 · 数学 2023-01-02 Yen Do , Doron Lubinsky , Hoi H. Nguyen , Oanh Nguyen , Igor Pritsker

For a subset $\mathcal A\subset \mathbb N$, let $p_{\mathcal A}(n)$ denote the restricted partition function which counts partitions of $n$ with all parts lying in $\mathcal A$. In this paper, we use a variation of the Hardy-Littlewood…

数论 · 数学 2021-02-23 Ayla Gafni

We present a new way to factor the dirichlet convolution for completely multiplicative functions whitch led us to constructing a ring that arise from the operations involved in the factorisation. We will conclude by some identities that was…

数论 · 数学 2022-06-14 Ansar El Hassani

The aim of this paper is to construct generating functions for some families of special finite sums with the aid of the Newton-Mercator series, hypergeometric series, and $p$-adic integral (the Volkenborn integral). By using these…

数论 · 数学 2023-02-22 Yilmaz Simsek

We revisit several hybrid multiplicative-to-additive type functions from a recent preprint article. These functions, $g(n)$ with Dirichlet generating function (DGF) $\zeta(s)^{-1} (1+P(s))^{-1}$ for $\Re(s) > 1$ where $P(s) = \sum_p p^{-s}$…

数论 · 数学 2026-04-28 Maxie Dion Schmidt

Hardy and Littlewood conjectured that every large integer $n$ that is not a square is the sum of a prime and a square. They believed that the number $\mathcal{R}(n)$ of such representations for $n = p+m^2$ is asymptotically given by…

数论 · 数学 2012-04-10 Aran Nayebi

We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…

数论 · 数学 2020-07-30 Igor E. Shparlinski , Qiang Wang

For $n \in \mathbb{N}$ let $\Pi[n]$ denote the set of partitions of $n$, i.e., the set of positive integer tuples $(x_1,x_2,\ldots,x_k)$ such that $x_1 \geq x_2 \geq \cdots \geq x_k$ and $x_1 + x_2 + \cdots + x_k = n$. Fixing…

数论 · 数学 2024-11-22 Taylor Daniels

Let $\tau$ denote the divisor function, and $f$ be any multiplicative function that satisfies some mild hypotheses. We establish the asymptotic formula or non-trivial upper bound for the shifted convolution sum $\sum_{n \leq…

数论 · 数学 2022-04-19 Yujiao Jiang , Guangshi Lü

Let $x$ be a complex number which has a positive real part, and $w_1,\ldots,w_N$ be positive rational numbers. We show that $w^s \zeta_N (s, x \ |\ w_1,\ldots, w_N)$ can be expressed as a finite linear combination of the Hurwitz zeta…

数论 · 数学 2021-08-06 Shinpei Sakane , Miho Aoki

The zeta and Moebius transforms over the subset lattice of $n$ elements and the so-called subset convolution are examples of unary and binary operations on set functions. While their direct computation requires $O(3^n)$ arithmetic…

数据结构与算法 · 计算机科学 2020-09-02 Mikko Koivisto , Antti Röyskö

In the Bin Packing problem one is given $n$ items with weights $w_1,\ldots,w_n$ and $m$ bins with capacities $c_1,\ldots,c_m$. The goal is to find a partition of the items into sets $S_1,\ldots,S_m$ such that $w(S_j) \leq c_j$ for every bin…

数据结构与算法 · 计算机科学 2023-09-11 Jesper Nederlof , Jakub Pawlewicz , Céline M. F. Swennenhuis , Karol Węgrzycki
‹ 上一页 1 2 3 10 下一页 ›