- ホーム
- > 洋書
- > 英文書
- > Science / Mathematics
Full Description
In this paper, the authors provide a combinatorial/numerical method to establish new hypercontractivity estimates in group von Neumann algebras. They illustrate their method with free groups, triangular groups and finite cyclic groups, for which they obtain optimal time hypercontractive $L_2 \to L_q$ inequalities with respect to the Markov process given by the word length and with $q$ an even integer. Interpolation and differentiation also yield general $L_p \to L_q$ hypercontrativity for $1 < p \le q < \infty$ via logarithmic Sobolev inequalities. The authors' method admits further applications to other discrete groups without small loops as far as the numerical part--which varies from one group to another--is implemented and tested on a computer.
The authors also develop another combinatorial method which does not rely on computational estimates and provides (non-optimal) $L_p \to L_q$ hypercontractive inequalities for a larger class of groups/lengths, including any finitely generated group equipped with a conditionally negative word length, like infinite Coxeter groups. The authors' second method also yields hypercontractivity bounds for groups admitting a finite dimensional proper cocycle. Hypercontractivity fails for conditionally negative lengths in groups satisfying Kazhdan's property (T).
Contents
The combinatorial method
Optimal time estimates
Poisson-like lengths
Appendix A. Logarithmic Sobolev inequalities
Appendix B. The word length in $\mathbb {Z}_n$
Appendix C. Numerical analysis
Appendix D. Technical inequalities
Bibliography.
