The Square Variation of Rearranged Fourier Series
Allison Lewko, Mark Lewko

TL;DR
This paper demonstrates that rearranging the Fourier series elements can significantly reduce the square variation operator's norm, improving upon the canonical ordering's bounds.
Contribution
It introduces a novel rearrangement method for Fourier series that achieves a lower bound on the square variation operator's norm.
Findings
Rearranged Fourier series can have a square variation norm of at most O(log^{9/22+ε}(N)).
Improves previous bound of O(log^{1/2}(N)) for the canonical ordering.
Provides a new approach to controlling variation in Fourier analysis.
Abstract
We prove that there exists a rearrangement of the first elements of the trigonometric system such that the -norm of the square variation operator is at most . This is an improvement over from the canonical ordering.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
