skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Creators/Authors contains: "Ou, Yumeng"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Free, publicly-accessible full text available January 1, 2026
  2. null (Ed.)
  3. Abstract We derive sparse bounds for the bilinear spherical maximal function in any dimension . When , this immediately recovers the sharp bound of the operator and implies quantitative weighted norm inequalities with respect to bilinear Muckenhoupt weights, which seems to be the first of their kind for the operator. The key innovation is a group of newly developed continuity improving estimates for the single‐scale bilinear spherical averaging operator. 
    more » « less
  4. The article arXiv:1309.0945 by Do and Thiele develops a theory of Carleson embeddings in outer Lp spaces for the wave packet transform of functions in L^p, in the 2≤p≤∞ range referred to as local L^2. In this article, we formulate a suitable extension of this theory to exponents 1<2, answering a question posed in arXiv:1309.0945. The proof of our main embedding theorem involves a refined multi-frequency Calder\'on-Zygmund decomposition. We apply our embedding theorem to recover the full known range of Lp estimates for the bilinear Hilbert transforms without reducing to discrete model sums or appealing to generalized restricted weak-type interpolation. 
    more » « less