Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 88 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 17 tok/s Pro
GPT-5 High 17 tok/s Pro
GPT-4o 73 tok/s Pro
GPT OSS 120B 464 tok/s Pro
Kimi K2 190 tok/s Pro
2000 character limit reached

On the Fourier spectrum of functions on Boolean cubes (1706.03670v1)

Published 12 Jun 2017 in math.FA

Abstract: Let $f$ be a real-valued, degree-$d$ Boolean function defined on the $n$-dimensional Boolean cube ${\pm 1}{n}$, and $f(x) = \sum_{S \subset {1,\ldots,d}} \widehat{f}(S) \prod_{k \in S} x_k$ its Fourier-Walsh expansion. The main result states that there is an absolute constant $C >0$ such that the $\ell_{2d/(d+1)}$-sum of the Fourier coefficients of $f:{\pm 1}{n} \rightarrow [-1,1]$ is bounded by $\leq C{\sqrt{d \log d}}$. It was recently proved that a similar result holds for complex-valued polynomials on the $n$-dimensional poly torus $\mathbb{T}n$, but that in contrast to this a replacement of the $n$-dimensional torus $\mathbb{T}n$ by $n$-dimensional cube $[-1, 1]n$ leads to a substantially weaker estimate. This in the Boolean case forces us to invent novel techniques which differ from the ones used in the complex or real case. We indicate how our result is linked with several questions in quantum information theory.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.