中文
相关论文

相关论文: Note on the Chowla Conjecture and the Discrete Fou…

200 篇论文

We show that whenever $s>k(k+1)$, then for any complex sequence $(\mathfrak a_n)_{n\in \mathbb Z}$, one has $$\int_{[0,1)^k}\left| \sum_{|n|\le N}\mathfrak a_ne(\alpha_1n+\ldots +\alpha_kn^k) \right|^{2s}\,{\rm d}{\mathbf \alpha}\ll…

经典分析与常微分方程 · 数学 2024-07-01 Trevor D. Wooley

Using geometric methods, we improve on the function field version of the Burgess bound, and show that, when restricted to certain special subspaces, the M\"{o}bius function over $\mathbb F_q[T]$ can be mimicked by Dirichlet characters.…

数论 · 数学 2019-09-10 Will Sawin , Mark Shusterman

It is proven that a conjecture of Tao (2010) holds true for log-concave random variables on the integers: For every $n \geq 1$, if $X_1,\ldots,X_n$ are i.i.d. integer-valued, log-concave random variables, then $$ H(X_1+\cdots+X_{n+1}) \geq…

概率论 · 数学 2023-10-19 Lampros Gavalakis

As a generalization of the sum of digits function and other digital sequences, sequences defined as the sum of the output of a transducer are asymptotically analyzed. The input of the transducer is a random integer in $[0, N)$. Analogues in…

组合数学 · 数学 2015-09-16 Clemens Heuberger , Sara Kropf , Helmut Prodinger

We deduce an asymptotic formula with error term for the sum $\sum_{n_1,\ldots,n_k \le x} f([n_1,\ldots, n_k])$, where $[n_1,\ldots, n_k]$ stands for the least common multiple of the positive integers $n_1,\ldots, n_k$ ($k\ge 2$) and $f$…

数论 · 数学 2016-07-27 Titus Hilberdink , László Tóth

We give a detailed study of the discrete Fourier transform (DFT) of $r$-even arithmetic functions, which form a subspace of the space of $r$-periodic arithmetic functions. We consider the DFT of sequences of $r$-even functions, their mean…

数论 · 数学 2011-09-20 László Tóth , Pentti Haukkanen

We consider the nonlinear Schroedinger equation on the one dimensional torus, with a defocousing polynomial nonlinearity and study the dynamics corresponding to initial data in a set of large measure with respect to the Gibbs measure. We…

数学物理 · 物理学 2020-01-08 Dario Bambusi , Alberto Maiocchi , Luca Turri

Let \(u\neq \pm 1,v^2\) be a fixed integer, let \(p\geq 2\) be a prime, and let $\text{ord}_p(u) \mid p-1$ be the multiplicative order of $u \text{ mod } p$. Define a prime counting function by $\pi(u,x)=\# \{ p\leq x:\text{ord}_p(u)=p-1…

数论 · 数学 2026-02-17 N. A. Carella

Fast Fourier transform was included in the Top 10 Algorithms of 20th Century by Computing in Science & Engineering. In this paper, we provide a new simple derivation of both the discrete Fourier transform and fast Fourier transform by means…

数据结构与算法 · 计算机科学 2019-08-21 Peter Zeman

We consider the Frank-Wolfe algorithm for solving variational inequalities over compact, convex sets under a monotone $C^1$ operator and vanishing, nonsummable step sizes. We introduce a continuous-time interpolation of the discrete…

最优化与控制 · 数学 2026-04-10 Matthew Hough

Given an $n$-length input signal $\mbf{x}$, it is well known that its Discrete Fourier Transform (DFT), $\mbf{X}$, can be computed in $O(n \log n)$ complexity using a Fast Fourier Transform (FFT). If the spectrum $\mbf{X}$ is exactly…

数据结构与算法 · 计算机科学 2015-01-27 Sameer Pawar , Kannan Ramchandran

In this paper, we consider a method for fast numerical computation of the Fourier transform of a slowly decaying function with given accuracy in given ranges of the frequency. In these decades, some useful formulas for the Fourier transform…

数值分析 · 数学 2015-07-28 Ken'ichiro Tanaka

An arithmetical function $f$ is said to be even (mod r) if f(n)=f((n,r)) for all n\in\Z^+, where (n, r) is the greatest common divisor of n and r. We adopt a linear algebraic approach to show that the Discrete Fourier Transform of an even…

数论 · 数学 2012-10-02 Pentti Haukkanen

We use discrete Morse theory to provide another proof of Bernini, Ferrari, and Steingrimson's formula for the Mobius function of the consecutive pattern poset. In addition, we are able to determine the homotopy type of this poset. Earlier,…

组合数学 · 数学 2011-08-09 Bruce Sagan , Robert Willenbring

Let $n$ be a positive even integer, and let $a_1,...,a_n$ and $w_1, ..., w_n$ be integers satisfying $\sum_{k=1}^n a_k\equiv\sum_{k=1}^n w_k =0 (mod n)$. A conjecture of Bialostocki states that there is a permutation $\sigma$ on {1,...,n}…

组合数学 · 数学 2015-05-13 Song Guo , Zhi-Wei Sun

For each $f\!:\!\mathbb{R}\to\mathbb{C}$ that is Henstock--Kurzweil integrable on the real line, or is a distribution in the completion of the space of Henstock--Kurzweil integrable functions in the Alexiewicz norm, it is shown that the…

经典分析与常微分方程 · 数学 2025-01-29 Erik Talvila

We consider the problem of finding the Discrete Fourier Transform (DFT) of $N-$ length signals with known frequency support of size $k$. When $N$ is a power of 2 and the frequency support is a spectral set, we provide an $O(k \log k)$…

信号处理 · 电气工程与系统科学 2021-10-07 P Charantej Reddy , V S S Prabhu Tej , Aditya Siripuram , Brad Osgood

In this note we describe weight functions that exhibit a transitional behavior between weak and strong correlation with the Liouville function. We also describe a binary problem which may be considered as an interpolation between Chowla's…

数论 · 数学 2022-05-05 Sergei Preobrazhenskii , Tatyana Preobrazhenskaya

It is a folklore conjecture that the M\"obius function exhibits cancellation on shifted primes; that is, $\sum_{p\le X}\mu(p+h) \ = \ o(\pi(X))$ as $X\to\infty$ for any fixed shift $h>0$. This appears in print at least since Hildebrand in…

数论 · 数学 2022-05-11 Jared Duker Lichtman

Let $\mu_1, \ldots, \mu_s$ be real numbers, with $\mu_1$ irrational. We investigate sums of shifted $k$th powers $\mathfrak{F}(x_1, \ldots, x_s) = (x_1 - \mu_1)^k + \ldots + (x_s - \mu_s)^k$. For $k \ge 4$, we bound the number of variables…

数论 · 数学 2015-12-09 Sam Chow