English
Related papers

Related papers: A bound for Mean values of Fourier transforms

200 papers

In its usual form, Freiman's 3k-4 theorem states that if A and B are subsets of the integers of size k with small sumset (of size close to 2k) then they are very close to arithmetic progressions. Our aim in this paper is to strengthen this…

Combinatorics · Mathematics 2022-04-22 Bela Bollobas , Imre Leader , Marius Tiba

We show that for any constant $\mu>0$ and $k\ge 3$, there exists $\alpha>0$ such that the following holds for sufficiently large $n \in \mathbb{N}$. If $G=(V_{1},\ldots,V_{k},E)$ is a spanning subgraph of the $n$-blow-up of $K_{k}$ with…

Combinatorics · Mathematics 2026-02-12 Xinyu He , Xiangxiang Nie , Donglei Yang

Let a tribonacci sequence be a sequence of integers satisfying $a_k=a_{k-1}+a_{k-2}+a_{k-3}$ for all $k\ge 4$. For any positive integers $k$ and $n$, denote by $f_k(n)$ the number of tribonacci sequences with $a_1, a_2, a_3>0$ and with…

Number Theory · Mathematics 2023-01-31 Luke Pebody

We define a sequence of functions, namely tame cuts, in the Fourier algebra $A(G)$ of a locally compact group $G$, that satisfies certain convergence and growth conditions. This new consideration allows us to give a group admitting a…

Functional Analysis · Mathematics 2021-10-28 Bat-Od Battseren

Let $X$ be a measure space and $T:X\to X$ a measurable transformation. For any measurable $E\subseteq X$ and $x\in E$, the possibly infinite return time is $n_E(x):=\inf\{n>0: T^n x\in E\}$. If $T$ is an ergodic tranformation of the…

Probability · Mathematics 2007-05-23 Luis Baez-Duarte

In our paper we extend some results of the theory of Fourier quasicrystals on the real line to a horizontal strip of finite width. For measures in a strip we use a natural generalization of the usual Fourier transform for measures on the…

Functional Analysis · Mathematics 2026-05-12 Sergii Favorov , Özkan Deǧer

Let $N$ be a fixed positive integer, and let $f\in S_k(N)$ be a primitive cusp form given by the Fourier expansion $f(z)=\sum_{n=1}^{\infty} \lambda_f(n)n^{\frac{k-1}{2}}e(nz)$. We consider the partial sum $S(x,f)=\sum_{n\leq…

Number Theory · Mathematics 2023-08-15 Claire Frechette , Mathilde Gerbelli-Gauthier , Alia Hamieh , Naomi Tanabe

Let $f$ be a smooth real function with strictly monotone first $k$ derivatives. We show that for a finite set $A$, with $|A+A|\leq K|A|$, $|2^kf(A)-(2^k-1)f(A)|\gg_k |A|^{k+1-o(1)}/K^{O_k(1)}$. We deduce several new sum-product type…

Number Theory · Mathematics 2020-05-04 Brandon Hanson , Oliver Roche-Newton , Misha Rudnev

We study the limiting behavior of multiple ergodic averages involving sequences of integers that satisfy some regularity conditions and have polynomial growth. We show that for "typical" choices of Hardy field functions $a(t)$ with…

Dynamical Systems · Mathematics 2012-12-24 Nikos Frantzikinakis

Let $\phi$ be a smooth function on a compact interval $I$. Let $$\gamma(t)=\left (t,t^2,\cdots,t^{n-1},\phi(t)\right).$$ In this paper, we show that $$\left(\int_I \big|\hat f(\gamma(t))\big|^q \big|\phi^{(n)}(t)\big|^{\frac{2}{n(n+1)}}…

Classical Analysis and ODEs · Mathematics 2017-01-03 Xianghong Chen , Dashan Fan , Lifeng Wang

Write $f_k({\boldsymbol \alpha};X)=\sum_{x\le X}e(\alpha_1x+\ldots +\alpha_kx^k)$ $(k\ge 3)$. We show that there is a set ${\mathfrak B}\subseteq [0,1)^{k-2}$ of full measure with the property that whenever $(\alpha_2,\ldots…

Number Theory · Mathematics 2023-09-29 Trevor D. Wooley

Let f(n)=1 if n=1, 2^(2^(n-2)) if n \in {2,3,4,5}, (2+2^(2^(n-4)))^(2^(n-4)) if n \in {6,7,8,...}. We conjecture that if a system T \subseteq {x_i+1=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in positive…

Number Theory · Mathematics 2015-10-14 Apoloniusz Tyszka

We prove that a Kakeya set in a vector space over a finite field of size $q$ always supports a probability measure whose Fourier transform is bounded by $q^{-1}$ for all non-zero frequencies. We show that this bound is sharp in all…

Combinatorics · Mathematics 2025-05-15 Jonathan M. Fraser

The generalized $q$-Kneser graph $K_q(n,k,t)$ for integers $k>t>0$ and $n>2k-t$ is the graph whose vertices are the $k$-dimensional subspaces of an $n$-dimensional $F_q$-vectorspace with two vertices $U_1$ and $U_2$ adjacent if and only if…

Combinatorics · Mathematics 2024-05-21 Klaus Metsch

Let $r_k(N)$ denote the size of the largest subset of $[N] = \{1,\ldots,N\}$ with no $k$-term arithmetic progression. We show that for $k\ge 5$, there exists $c_k>0$ such that \[r_k(N)\ll N\exp(-(\log\log N)^{c_k}).\] Our proof is a…

Combinatorics · Mathematics 2024-03-01 James Leng , Ashwin Sah , Mehtaab Sawhney

Let $f_{s,k}(n)$ be the maximum possible number of $s$-term arithmetic progressions in a sequence $a_1<a_2<\ldots<a_n$ of $n$ integers which contains no $k$-term arithmetic progression. For all integers $k > s \geq 3$, we prove that…

Combinatorics · Mathematics 2020-08-10 Jacob Fox , Cosmin Pohoata

We study modular forms for $\textrm{SL}_2(\mathbb{Z})$ with no negative Fourier coefficients. Let $A(k)$ be the positive integer where if the first $A(k)$ Fourier coefficients of a modular form of weight $k$ for $\textrm{SL}_2(\mathbb{Z})$…

Number Theory · Mathematics 2026-04-01 Paul Jenkins , Jeremy Rouse

We study the Fourier spectrum of functions $f\colon \{0,1\}^{mk} \to \{-1,0,1\}$ which can be written as a product of $k$ Boolean functions $f_i$ on disjoint $m$-bit inputs. We prove that for every positive integer $d$, \[ \sum_{S \subseteq…

Computational Complexity · Computer Science 2019-02-08 Chin Ho Lee

The main results of this paper concern growth in sums of a $k$-convex function $f$. Firstly, we streamline the proof of a growth result for $f(A)$ where $A$ has small additive doubling, and improve the bound by removing logarithmic factors.…

Number Theory · Mathematics 2021-11-08 Peter J. Bradshaw

A function defined on the Boolean hypercube is $k$-Fourier-sparse if it has at most $k$ nonzero Fourier coefficients. For a function $f: \mathbb{F}_2^n \rightarrow \mathbb{R}$ and parameters $k$ and $d$, we prove a strong upper bound on the…

Data Structures and Algorithms · Computer Science 2015-04-08 Ishay Haviv , Oded Regev