中文
相关论文

相关论文: On the Littlewood problem modulo a prime

200 篇论文

Fix integers a_1,...,a_d satisfying a_1 + ... + a_d = 0. Suppose that f : Z_N -> [0,1], where N is prime. We show that if f is ``smooth enough'' then we can bound from below the sum of f(x_1)...f(x_d) over all solutions (x_1,...,x_d) in Z_N…

数论 · 数学 2007-08-29 Ernie Croot

Using elementary arguments based on the Fourier transform we prove that for $1 \leq q < p < \infty$ and $s \geq 0$ with $s > n(1/2-1/p)$, if $f \in L^{q,\infty}(\R^n) \cap \dot{H}^s(\R^n)$ then $f \in L^p(\R^n)$ and there exists a constant…

偏微分方程分析 · 数学 2013-03-27 David S. McCormick , James C. Robinson , Jose L. Rodrigo

For each $f\in L^p({\mathbb R)}$ ($1\leq p<\infty$) it is shown that the Fourier transform is the distributional derivative of a H\"older continuous function. For each $p$ a norm is defined so that the space Fourier transforms is…

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

Suppose that A is a subset of F_2^n of density as close to 1/3 as possible. We show that the A(F_2^n)-norm (that is the sum of the absolute values of the Fourier transform) of the characterstic function of A is bounded below by an absolute…

经典分析与常微分方程 · 数学 2010-04-01 Tom Sanders

Let $\{Z_t, t\geq 0\}$ be a strictly stable process on $\R$ with index $\alpha\in (0,2]$. We prove that for every $p > \alpha$, there exists $\gamma = \gamma (\alpha, p)$ and $\k = \k (\alpha, p)\in (0, +\infty)$ such that…

概率论 · 数学 2007-05-23 T. Simon

Let $P(z)=\sum_{n=0}^Na_nz^n$ be a Littlewood polynomial of degree $N$, meaning that $a_n\in\{\pm 1\}$. We say that $P$ is reciprocal if $P(z)=z^NP(1/z)$. Borwein, Erd\'elyi and Littmann posed the question of determining the minimum number…

经典分析与常微分方程 · 数学 2023-12-08 Benjamin Bedert

We prove in particular that for any sufficiently large prime $p$ there is $1\le a<p$ such that all partial quotients of $a/p$ are bounded by $O(\log p/\log \log p)$. For composite denominators a similar result is obtained. This improves the…

数论 · 数学 2023-01-02 Nikolay Moshchevitin , Brendan Murphy , Ilya Shkredov

We investigate, using the weighted linear sieve, the distribution of almost-primes among the residue classes (mod p) that generate the multiplicative group of reduced residue classes. We are concerned with finding an upper bound for the…

数论 · 数学 2007-05-23 Greg Martin

We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…

数论 · 数学 2013-09-09 Thai Hoang Le , Jeffrey D. Vaaler

Let $f$ be a completely multiplicative function that assumes values inside the unit disc. We show that if $\sum_{n<x} f(n) \ll x/(\log x)^A$, $x>2$, for some $A>2$, then either $f(p)$ is small on average or $f$ pretends to be $\mu(n)n^{it}$…

数论 · 数学 2017-06-12 Dimitris Koukoulopoulos

For an odd prime $p$, we say $f(X) \in {\mathbb F}_p[X]$ computes square roots in $\mathbb F_p$ if, for all nonzero perfect squares $a \in \mathbb F_p$, we have $f(a)^2 = a$. When $p \equiv 3 \mod 4$, it is well known that $f(X) =…

数论 · 数学 2024-01-24 Kiran Kedlaya , Swastik Kopparty

Let L(s) = L(s, \pi) be the standard L-function of a cuspidal representation \pi of GL(m,A) where A denotes the ad\`eles of the field of rationals. We consider the integral, on the real line Re(s)= 1/2, of the squared absolute value of…

数论 · 数学 2023-01-04 Laurent Clozel

Let $n$ be an arbitrary integer, let $p$ be a prime factor of $n$. Denote by $\omega_1$ the $p^{th}$ primitive unity root, $\omega_1:=e^{\frac{2\pi i}{p}}$. Define $\omega_i:=\omega_1^i$ for $0\leq i\leq p-1$ and…

组合数学 · 数学 2016-10-10 Gábor Hegedüs

The Hardy-Littlewood majorant problem asks whether L^p norms of functions on the circle grow if one replaces their Fourier coefficients with their absolute values. This is clear if p is an even integer, but false if p is any other number.…

经典分析与常微分方程 · 数学 2007-05-23 G. Mockenhaupt , W. Schlag

We show that if a locally compact group $G$ is non-abelian then the amenability constant of its Fourier algebra is $\geq 3/2$, extending a result of Johnson (JLMS, 1994) who proved that this holds for finite non-abelian groups. Our lower…

泛函分析 · 数学 2023-11-22 Y. Choi

Let $t \in \mathbb{N}$, $\eta >0$. Suppose that $x$ is a sufficiently large real number and $q$ is a natural number with $q \leq x^{5/12-\eta}$, $q$ not a multiple of the conductor of the exceptional character $\chi^*$ (if it exists).…

数论 · 数学 2016-01-27 Roger C. Baker , Liangyi Zhao

Let $F_p$ be the field of a prime order $p.$ For a subset $A\subset F_p$ we consider the product set $A(A+1).$ This set is an image of $A\times A$ under the polynomial mapping $f(x,y)=xy+x:F_p\times F_p\to F_p.$ In the present paper we show…

数论 · 数学 2008-12-16 M. Z. Garaev , Chun-Yen Shen

This paper is motivated by the following question in sieve theory. Given a subset $X\subset [N]$ and $\alpha\in (0,1/2)$. Suppose that $|X\pmod p|\leq (\alpha+o(1))p$ for every prime $p$. How large can $X$ be? On the one hand, we have the…

数论 · 数学 2014-09-26 Xuancheng Shao

We show how to improve the efficiency of the computation of fast Fourier transforms over F_p where p is a word-sized prime. Our main technique is optimisation of the basic arithmetic, in effect decreasing the total number of reductions…

符号计算 · 计算机科学 2013-09-26 David Harvey

We prove several results which imply the following consequences. For any $\varepsilon>0$ and any sufficiently large prime $p$, if $\cI_1,\ldots, \cI_{13}$ are intervals of cardinalities $|\cI_j|>p^{1/4+\varepsilon}$ and $abc\not\equiv…

数论 · 数学 2017-01-26 M. Z. Garaev