On the existence of symmetric minimizers
arXiv:1806.02408
Abstract
In this note we revisit a less known symmetrization method for functions with respect to a topological group , which we call -averaging. We note that, although quite non-technical in nature, this method yields -invariant minimizers of functionals satisfying some relaxed convexity properties. We give an abstract theorem and show how it can be applied to the -Laplace and polyharmonic Poisson problem in order to construct symmetric solutions. We also pose some open problems and explore further possibilities where the method of -averaging could be applied to.