104 research outputs found
A capacity approach to the Poincaré inequality and Sobolev imbeddings in variable exponent Sobolev spaces.
We study the Poincaré inequality in Sobolev spaces with variable exponent. Under a rather mild and sharp condition on the exponent p we show that the inequality holds. This condition is satisfied e. g. if the exponent p is continuous in the closure of a convex domain. We also give an essentially sharp condition for the exponent p as to when there exists an imbedding from the Sobolev space to the space of bounded functions
Sobolev inequalities with variable exponent attaining the values 1 and n
We study Sobolev embeddings in the Sobolev space W1,p(·) (Ω) with variable exponent satisfying 1 6 p(x) 6 n. Since the exponent is allowed to reach the values 1 and n, we need to introduce new techniques, combining weak- and strong-type estimates, and a new variable exponent target space scale which features a space of exponential type integrability instead of L∞ at the upper end
Regularity theory for non-autonomous problems with a priori assumptions
We study weak solutions and minimizers of the non-autonomous problems
and with
quasi-isotropic -growth. We consider the case that is bounded,
H\"older continuous or lies in a Lebesgue space and establish a sharp
connection between assumptions on or and the corresponding norm of .
We prove a Sobolev--Poincar\'e inequality, higher integrability and the
H\"older continuity of and . Our proofs are optimized and streamlined
versions of earlier research that can more readily be further extended to other
settings.
Connections between assumptions on or and assumptions on are
known for the double phase energy . We obtain
slightly better results even in this special case. Furthermore, we also cover
perturbed variable exponent, Orlicz variable exponent, degenerate double phase,
Orlicz double phase, triple phase, double variable exponent as well as variable
exponent double phase energies and the results are new in most of these special
cases
Packing sets of patterns
AbstractPacking density is a permutation occurrence statistic which describes the maximal number of permutations of a given type that can occur in another permutation. In this article we focus on containment of sets of permutations. Although this question has been tangentially considered previously, this is the first article focusing exclusively on it. We find the packing density for various special sets of permutations and study permutation and pattern co-occurrence
- …