A generalization of amenability and inner amenability of groups
نویسندگان
چکیده
منابع مشابه
amenability of banach algebras
chapters 1 and 2 establish the basic theory of amenability of topological groups and amenability of banach algebras. also we prove that. if g is a topological group, then r (wluc (g)) (resp. r (luc (g))) if and only if there exists a mean m on wluc (g) (resp. luc (g)) such that for every wluc (g) (resp. every luc (g)) and every element d of a dense subset d od g, m (r)m (f) holds. chapter 3 inv...
15 صفحه اولWeak amenability of Coxeter groups
Let (G,S) be a Coxeter group. We construct a continuation, to the open unit disc, of the unitary representations associated to the positive definite functions g 7→ rl(g). (Here 0 < r < 1, and l denotes the length function with respect to the generating set S.) The constructed representations are uniformly bounded and we prove that this implies the weak amenability of the group G. Résumé Soit (G...
متن کاملWeak Amenability of Hyperbolic Groups
We prove that hyperbolic groups are weakly amenable. This partially extends the result of Cowling and Haagerup showing that lattices in simple Lie groups of real rank one are weakly amenable. We take a combinatorial approach in the spirit of Haagerup and prove that for the word length metric d on a hyperbolic group, the Schur multipliers associated with r have uniformly bounded norms for 0 < r ...
متن کاملOn Amenability of Automata Groups
We show that the group of bounded automatic automorphisms of a rooted tree is amenable, which implies amenability of numerous classes of groups generated by finite automata. The proof is based on reducing the problem to showing amenability just of a certain explicit family of groups (“Mother groups”) which is done by analyzing the asymptotic properties of random walks on these groups.
متن کاملAmenability of linear-activity automaton groups
We prove that every linear-activity automaton group is amenable. The proof is based on showing that a sufficiently symmetric random walk on a specially constructed degree 1 automaton group — the mother group — has asymptotic entropy 0. Our result answers an open question by Nekrashevich in the Kourovka notebook, and gives a partial answer to a question of Sidki. Figure 1: A Schreier graph for a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 2012
ISSN: 0011-4642,1572-9141
DOI: 10.1007/s10587-012-0043-4