2000 character limit reached
Entropy flows and functional inequalities in convex sets
Published 8 Jan 2020 in math.AP | (2001.02578v2)
Abstract: We revisit entropy methods to prove new sharp trace logarithmic Sobolev and sharp Gagliardo-Nirenberg-Sobolev inequalities on the half space, with a focus on the entropy inequality itself and not the actual flow, allowing for somewhat robust and self-contained proofs.
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.