Search arXiv⌕ Search

arXiv · math/0312257

On the center of a compact group

Abstract

We prove a conjecture due to Baumgaertel and Lledo according to which for every compact group G one has Z(G)^ \cong C(G), where the `chain group' C(G) is the free abelian group (written multiplicatively) generated by the set G^ of isomorphism classes of irreducible representations of G modulo the relations [Z]=[X]\cdot[Y] whenever Z is contained in X \otimes Y. Thus the center Z(G) depends only on the representation ring of G. Furthermore, we prove that every `t-map' phi: G^ -> A into an abelian group, i.e. every map satisfying phi(Z)=phi(X)phi(Y) whenever X,Y,Z in G^ and Z\prec X\otimes Y, factors through the restriction map G^ -> Z(G)^. All these results also hold for proalgebraic groups over algebraically closed fields of characteristic zero.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael Mueger. 2004-04-20. On the center of a compact group. https://arxiv.org/abs/math/0312257

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Strongly Regular Graphs of Rank Four

Strongly regular graphs are regular graphs with a constant number of common neighbours between adjacent vertices, and a constant number of common neighbours between non-adjacent vertices. These graphs have been of great interest over the last few decades and often give rise to interesting groups of automorphisms. In this paper we take a reverse approach, and leverage strong classification results on rank four permutation groups to classify the strongly regular graphs which yield such groups as a group of automorphisms.

math.GR↗

Every finite group admits a just finite presentation

A finite presentation < X | R > of a finite group is called `just finite' if removing any relation from R results in a presentation for an infinite group. It has been an open question (Kourovka Notebook, Problem 21.10) whether every finite group admits such a presentation. We resolve this conjecture in the affirmative.

math.GR↗

Assouad--Nagata dimension of systolic complexes with almost flat intervals

We introduce the notion of systolic complexes with almost flat intervals. They constitute a subclass of fit systolic complexes and arise naturally in the study of graphical C(3)--T(6) small cancellation complexes. We prove that their Assouad--Nagata dimension is bounded above by a universal constant. As consequences, we obtain universal bounds on the Assouad--Nagata dimension of tame simply connected graphical C(3)--T(6) small cancellation complexes and of finitely generated groups defined by graphical C(3)--T(6) small cancellation presentations. In the appendix, we observe that the proof of finiteness of asymptotic dimension for buildings due to Dymara and Schick also yields finiteness of their asymptotic Assouad--Nagata dimension.

math.GR↗