Skip to content
Preprint

Extremals for Trudinger-Moser inequalities via polygonal profiles

Oct 2026 · 0 citations · 42 references
Mathematics

Abstract

The aim of this paper is to establish the existence of extremal functions for the Trudinger-Moser inequality with logarithmic weights $(-\log |x|)^{\beta}$ in two dimensions throughout the full range $0\le \beta<1$. We also extend recent results on the existence of local maximizers for the Trudinger-Moser functional beyond the critical threshold. Our approach uses polygonal profiles to establish a lower bound uniform in the weight parameter. An explicit thirty-node profile gives the lower bound $\mathrm{TM}_{4\pi}>4.38421793217\,\pi$ for the classical critical supremum on the unit disk, improving on the value $4.3556\,\pi$ obtained in the computer experiments of Carleson and Chang. This lower bound has a purely analytic proof, which uses only elementary inequalities and exact rational arithmetic. Numerical experiments with polygonal profiles of up to $102400$ nodes suggest that this lower bound can be raised to $4.402732044\,\pi$, which improves the recent computational lower bound by Li and Sun.

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.