Bloch estimates in non-doubling generalized Orlicz spaces

We study minimizers of non-autonomous functionalsinf u circumflex accent cc(x, |Vu|) dx Omega when cc has generalized Orlicz growth. We consider the case where the upper growth rate of cc is unbounded and prove the Harnack inequality for minimizers. Our technique is based on "truncating" the function cc to approximate the minimizer and Harnack estimates with uniform constants via a Bloch estimate for the approximating minimizers.

Authors

Institutions

Publication Details

Published
2025-08-28
DOI
https://doi.org/10.3934/mine.2023052
Citations
3
Primary Topic
Nonlinear Partial Differential Equations
Type
article
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Bloch estimates in non-doubling generalized Orlicz spaces

Jonne Juusti, Petteri Harjulehto, Peter Hästö
3 citations
Nonlinear Partial Differential Equations
article

Bloch estimates in non-doubling generalized Orlicz spaces

Jonne Juusti, Petteri Harjulehto, Peter Hästö
article en
3 citations

Abstract

We study minimizers of non-autonomous functionalsinf u circumflex accent cc(x, |Vu|) dx Omega when cc has generalized Orlicz growth. We consider the case where the upper growth rate of cc is unbounded and prove the Harnack inequality for minimizers. Our technique is based on "truncating" the function cc to approximate the minimizer and Harnack estimates with uniform constants via a Bloch estimate for the approximating minimizers.

Statistics Finland (FI), University of Helsinki (FI), University of Turku (FI)
Nonlinear Partial Differential Equations
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.