A question about the possibility of using min-max methods on the double natural constraint, in spite of its lack of regularity, has been raised in some recent papers. In this note we give an answer by topological arguments which show the equivalence between constrained and unconstrained min-max classes, avoiding in this way any regularity problem.
|Titolo:||Min-max levels on the double natural constraint|
|Data di pubblicazione:||2006|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.12775/TMNA.2006.032|
|Appare nelle tipologie:||1.1 Articolo in rivista|