Averaging on $n$-dimensional rectangles
Emma D'Aniello, Laurent Moonens

TL;DR
This paper studies the differentiation properties of translation invariant bases of rectangles in n-dimensional space, identifying the largest Orlicz space they can differentiate, and improving existing analytical techniques.
Contribution
It advances the understanding of differentiation bases in higher dimensions by refining methods to determine the maximal Orlicz space they differentiate.
Findings
Identifies $L ext{log}^{n-1}L(R^n)$ as the largest Orlicz space differentiated by certain bases.
Improves analytical techniques from previous studies by Stokolos (1988, 2008).
Provides new insights into the structure of translation invariant differentiation bases in $ extbf{R}^n$.
Abstract
In this work we investigate families of translation invariant differentiation bases of rectangles in , for which is the largest Orlicz space that differentiates. In particular, we improve on techniques developed by A.~Stokolos 1988 and 2008.
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.
Taxonomy
TopicsAdvanced Harmonic Analysis Research · Mathematical Approximation and Integration · Mathematical Analysis and Transform Methods
