2000 character limit reached
An information-theoretic proof of Nash's inequality
Published 11 Jun 2012 in cs.IT, math-ph, math.FA, math.IT, and math.MP | (1206.2130v2)
Abstract: We show that an information-theoretic property of Shannon's entropy power, known as concavity of entropy power, can be fruitfully employed to prove inequalities in sharp form. In particular, the concavity of entropy power implies the logarithmic Sobolev inequality, and Nash's inequality with the sharp constant.
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.
