Papers
Topics
Authors
Recent
Search
2000 character limit reached

Hypercontractivity in group von Neumann algebras

Published 21 Apr 2013 in math.OA, math.CA, and math.CO | (1304.5789v1)

Abstract: In this paper, we provide a combinatorial/numerical method to establish new hypercontractivity estimates in group von Neumann algebras. We will illustrate our method with free groups, triangular groups and finite cyclic groups, for which we shall 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. Our 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 in a computer. We 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. Our second method also yields hypercontractivity bounds for groups admitting a finite dimensional proper cocycle. Hypercontractivity fails for conditionally negative lengths in groups satisfying Kazhdan property (T).

Citations (26)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.