2000 character limit reached
Gagliardo-Nirenberg-Sobolev inequalities on planar graphs
Published 14 Oct 2021 in math.DS | (2110.07212v1)
Abstract: In this paper we study a family of interpolation Gagliardo-Nirenberg-Sololev inequalities on planar graphs. We are interested in knowing when the best constants in the inequalities are achieved. We also analyse the set of solutions of the corresponding Euler-Lagrange equations.
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.