UNIFORMLY BOUNDED REPRESENTATIONS OF GROUPS
نویسندگان
چکیده
منابع مشابه
Uniformly Bounded Representations and Exact Groups
We characterize groups with Guoliang Yu’s property A (i.e., exact groups) by the existence of a family of uniformly bounded representations which approximate the trivial representation. Property A is a large scale geometric property that can be viewed as a weak counterpart of amenability. It was shown in [12], that for a finitely generated group property A implies the Novikov conjecture. It was...
متن کاملThe Cayley Transform and Uniformly Bounded Representations
Let G be a simple Lie group of real rank one, with Iwasawa decomposition KAN̄ and Bruhat big cell NMAN̄ . Then the space G/MAN̄ may be (almost) identified with N and with K/M , and these identifications induce the (generalised) Cayley transform C : N → K/M . We show that C is a conformal map of Carnot–Caratheodory manifolds, and that composition with the Cayley transform, combined with multiplicat...
متن کاملUniformly Bounded Representations and Completely Bounded Multipliers of Sl(2,r)
We estimate the norms of many matrix coefficients of irreducible uniformly bounded representations of SL(2, R) as completely bounded multipliers of the Fourier algebra. Our results suggest that the known inequality relating the uniformly bounded norm of a representation and the completely bounded norm of its coefficients may not be optimal.
متن کاملQUASI-PERMUTATION REPRESENTATIONS OF METACYCLIC 2-GROUPS
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus, every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fa...
متن کاملUniformly bounded duplication codes
Duplication is the replacement of a factor w within a word by ww. This operation can be used iteratively to generate languages starting from words or sets of words. By undoing duplications, one can eventually reach a square-free word, the original word’s duplication root. The duplication root is unique, if the length of duplications is fixed. Based on these unique roots we define the concept of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 1955
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.41.4.231