English

Comparison results for the $p$-torsional rigidity on convex domains

Analysis of PDEs 2026-03-16 v1

Abstract

For each open, bounded and convex domain ΩRD,\Omega \subset \mathbb{R}^{D}, D2D\geq 2, and each real number p>1,p>1, we denote by upu_{p} the pp\emph{-torsion function} on Ω\Omega , i.e. the solution of the \emph{torsional creep problem} Δpu=1\Delta_{p}u=-1 in Ω\Omega , u=0u=0 on Ω\partial \Omega , where Δpu:=div(up2u)\Delta _{p}u:=\operatorname{div}( \left\vert \nabla u\right\vert ^{p-2}\nabla u) is the pp-Laplacian. Let Tp(Ω)T_p(\Omega) be the pp\emph{-torsional rigidity} on Ω\Omega , defined as Tp(Ω):=ΩupdxT_{p}\left( \Omega \right) :=\int_{\Omega }u_{p}dx. Define T(p;Ω):=Ωp1Tp(Ω)1pT\left( p;\Omega \right) :=\left\vert \Omega \right\vert ^{p-1}T_{p}\left( \Omega \right) ^{1-p}, where Ω|\Omega| stands for the Lebesgue measure of Ω\Omega. The main purpose of this paper is to compare the values of T(p;Ω)T(p;\Omega) for bounded convex domains having different inradii. We prove that for any 0<a<b0<a<b there exists a constant γD,p[1/D,1)\gamma_{D,p}\in[1/D,1), depending only on the dimension DD and the parameter pp, such that T(p;Ωb)T(p;Ωa)T(p;\Omega_b)\leq T(p;\Omega_a), for all Ωa\PPD(a) \Omega_a\in\PP^D(a), and Ωb\PPD(b)\Omega_b\in\PP^D(b), if and only if γD,pba\gamma_{D,p}b\geq a, where \PPD(r)\PP^D(r) denotes the family of convex bounded domains in RD\mathbb{R}^D of inradius rr. In addition, we discuss the asymptotic equality case, the limiting regimes p1+p\rightarrow 1^+ and pp\rightarrow\infty, and the sharpness of our bounds on model families such as rectangles, orthotopes, ellipses, and triangles}. We also derive a Saint-Venant type comparison result under additional geometric constraints, as a direct consequence of our main theorem.

Keywords

Cite

@article{arxiv.2603.12921,
  title  = {Comparison results for the $p$-torsional rigidity on convex domains},
  author = {Cristian Enache and Mihai Mihailescu and Denisa Stancu-Dumitru},
  journal= {arXiv preprint arXiv:2603.12921},
  year   = {2026}
}