A Harnack Inequality for Kolmogorov Equations
✍ Scribed by Q. Zhang
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 411 KB
- Volume
- 190
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
It was mentioned by Kolmogorov (1968, IEEE Trans. Inform. Theory 14, 662 664) that the properties of algorithmic complexity and Shannon entropy are similar. We investigate one aspect of this similarity. Namely, we are interested in linear inequalities that are valid for Shannon entropy and for Kolmo
In this paper, essentially developing the Stein method, we prove the Kol-Ž . mogorov᎐Stein inequality for any Orlicz norm with the same constants . ᮊ 1996 Academic Press, Inc. p Kolmogorov᎐Stein inequality and its variants are a problem of interest for
## Abstract In this note, we prove a Harnack inequality for two‐weight subelliptic __p__ ‐Laplace operators together with an upper bound of the Harnack constant associated with such inequality. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)