English
Related papers

Related papers: Weighted exponential sums and its applications

200 papers

Given a multiplicative function $f$, we let $S(x,f)=\sum_{n\leq x}f(n)$ be the associated partial sum. In this note, we show that lower bounds on partial sums of divisor-bounded functions result in lower bounds on the partial sums…

Number Theory · Mathematics 2024-05-02 Claire Frechette , Mathilde Gerbelli-Gauthier , Alia Hamieh , Naomi Tanabe

For $f$ a Steinhaus random multiplicative function, we prove convergence in distribution of the appropriately normalised partial sums \[ \frac{{(\log \log x)}^{1/4}}{\sqrt{x}} \sum_{\substack{n \leq x \\ P(n) > \sqrt{x}}} f(n), \] where…

Number Theory · Mathematics 2025-03-11 Seth Hardy

A positive integer $n$ is practical if every $m \leq n$ can be written as a sum of distinct divisors of $n$. One can generalize the concept of practical numbers by applying an arithmetic function $f$ to each of the divisors of $n$ and…

Number Theory · Mathematics 2017-03-24 Nicholas Schwab , Lola Thompson

We study the probabilistic behavior of sums of Fourier coefficients in arithmetic progressions. We prove a result analogous to previous work of Fouvry-Ganguly-Kowalski-Michel and Kowalski-Ricotta in the context of half-integral weight…

Number Theory · Mathematics 2020-06-26 Corentin Darreye

We prove that if $f(n)$ is a Steinhaus or Rademacher random multiplicative function, there almost surely exist arbitrarily large values of $x$ for which $|\sum_{n \leq x} f(n)| \geq \sqrt{x} (\log\log x)^{1/4+o(1)}$. This is the first such…

Number Theory · Mathematics 2021-01-01 Adam J. Harper

The integer $d=\prod_{i=1}^s p_i^{b_i}$ is called an exponential divisor of $n=\prod_{i=1}^s p_i^{a_i}>1$ if $b_i \mid a_i$ for every $i\in \{1,2,...,s\}$. Let $\tau^{(e)}(n)$ denote the number of exponential divisors of $n$, where…

Number Theory · Mathematics 2007-08-28 László Tóth

We explore solutions for fairly allocating indivisible items among agents assigned weights representing their entitlements. Our fairness goal is weighted-envy-freeness (WEF), where each agent deems their allocated portion relative to their…

Computer Science and Game Theory · Computer Science 2025-02-25 Noga Klein Elmalem , Rica Gonen , Erel Segal-Halevi

Cyclic codes have efficient encoding and decoding algorithms. The decoding error probability and the undetected error probability are usually bounded by or given from the weight distributions of the codes. Most researches are about the…

Information Theory · Computer Science 2013-09-03 Xiaogang Liu , Yuan Luo

Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial…

Number Theory · Mathematics 2019-01-11 F. E. Brochero Martínez , Lucas Reis , Lays Silva

In this paper, we consider sums of three generalized $m$-gonal numbers whose parameters are restricted to integers with a bounded number of prime divisors. With some restrictions on $m$ modulo $30$, we show that a density one set of…

Number Theory · Mathematics 2024-09-23 Soumyarup Banerjee , Ben Kane , Daejun Kim

We define the $\textit{Divisor Divisibility Sequence}$ associated to a Laurent polynomial $f\in\mathbb{Z}[X_1^{\pm1},\ldots,X_N^{\pm1}]$ to be the sequence $W_n(f)=\prod f(\zeta_1,\ldots,\zeta_N)$, where $\zeta_1,\ldots,\zeta_N$ range over…

Number Theory · Mathematics 2018-07-03 Joseph H. Silverman

We study a function field version of a classical problem concerning square-free values of polynomials evaluated at primes. We show that for a square-free polynomial $f\in \mathbb{F}_q[t][x]$, there is a limiting density as $n\to \infty$ of…

Number Theory · Mathematics 2015-06-02 Guy Lando

In this note we consider the distribution of values of weighted sums of the von Mangoldt arithmetical function. By using a formula for the distribution of values of trigonometric polynomials, we are able to present evidence supporting the…

Number Theory · Mathematics 2024-11-12 Eugenio P. Balanzario

Weighted Poincar\'e-type and related inequalities provide upper bounds of the variance of functions. Their application in sensitivity analysis allows for quickly identifying the active inputs. Although the efficiency in prioritizing inputs…

Probability · Mathematics 2019-12-06 Matieyendou Lamboni

We obtain general estimates for exponential integrals of the form \[ E_f(y)=\int_{\mathbb{Z}_{p}^{n}}\psi(\sum_{j=1}^r y_j f_j(x))|dx|, \] where the $f_j$ are restricted power series over $\mathbb{Q}_p$, $y_j\in\mathbb{Q}_p$, and $\psi$ a…

Number Theory · Mathematics 2007-05-23 Raf Cluckers

For a function $f\colon \mathbb{N}\to\mathbb{N}$, define $N^{\times}_{f}(x)=\#\{n\leq x: n=kf(k) \mbox{ for some $k$} \}$. Let $\tau(n)=\sum_{d|n}1$ be the divisor function, $\omega(n)=\sum_{p|n}1$ be the prime divisor function, and…

Number Theory · Mathematics 2022-10-03 Mikhail R. Gabdullin , Vitalii V. Iudelevich , Florian Luca

We give a new proof of Fatou's theorem: {\em if an algebraic function has a power series expansion with bounded integer coefficients, then it must be a rational function.} This result is applied to show that for any non--trivial completely…

Number Theory · Mathematics 2008-06-11 Michael Coons , Peter Borwein

We obtain almost sure bounds for the weighted sum $\sum_{n \leq t} \frac{f(n)}{\sqrt{n}}$, where $f(n)$ is a Steinhaus random multiplicative function. Specifically, we obtain the bounds predicted by exponentiating the law of the iterated…

Number Theory · Mathematics 2025-11-10 Seth Hardy

We study the fair allocation of indivisible goods with variable groups. In this model, the goal is to partition the agents into groups of given sizes and allocate the goods to the groups in a fair manner. We show that for any number of…

Computer Science and Game Theory · Computer Science 2025-11-11 Paul Gölz , Ayumi Igarashi , Pasin Manurangsi , Warut Suksompong

We consider partitions $p_{w}(n)$ of a positive integer $n$ arising from the generating functions \[ \sum_{n=1}^\infty p_{w}(n) z^n = \prod_{m \in \mathbb{N}} (1-z^m)^{-w(m)}, \] where the weights $w(m)$ are M\"{o}bius convolutions. We…

Number Theory · Mathematics 2026-03-04 Debmalya Basak , Nicolas Robles , Alexandru Zaharescu