2000 character limit reached
On the critical Caffarelli-Kohn-Nirenberg type inequalities involving super-logarithms (2306.08282v2)
Published 14 Jun 2023 in math.AP
Abstract: We establish the Caffarelli-Kohn-Nirenberg type inequalities involving{ super-logarithms (infinitely iterated logarithms).} As a result the critical Caffarelli-Kohn-Nirenberg type inequalities will be improved, and in certain cases the best constants will be discovered.
Sponsor
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.