Maz’ya’s Problem 8 on the capacitary-distance Hardy inequality
Let . For every open set , set and, for and , define . Determine the optimal dependence on of the least constant such that, for every such and every , . Equivalently, determine the sharp order of as ; the claimed resolution is .
References
Primary source
Additional references
Progress summary
A new unrefereed preprint claims to settle the problem and determine the best dependence on the capacity parameter, but the result has not been independently checked.
Maz’ya’s Problem 8 asks for a capacitary-distance Hardy inequality with optimal dependence on the capacity parameter. The latest source claims a complete resolution.
August 27, 2026 preprint claims optimal dependence
The preprint Capacitary-Distance Hardy Inequality claims a bound with constant and constructs domains showing that this dependence on is sharp. If correct, this settles the stated problem and identifies the optimal order.
Current status (as of August 2026): An unrefereed preprint claims the problem is solved with sharp dependence, but independent verification is not recorded.
Solutions 0
No solutions have been posted yet.