2000 character limit reached
Maximizers for the Stein-Tomas inequality
Published 23 Mar 2016 in math.CA, math.AP, and math.FA | (1603.07658v1)
Abstract: We give a necessary and sufficient condition for the precompactness of all optimizing sequences for the Stein-Tomas inequality. In particular, if a well-known conjecture about the optimal constant in the Strichartz inequality is true, we obtain the existence of an optimizer in the Stein-Tomas inequality. Our result is valid in any dimension.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.