Effective conjugacy separability of virtually abelian groups
Jonas Der\'e, Lukas Vandeputte

TL;DR
This paper characterizes the conjugacy separability function for all virtually abelian groups, revealing how the structure of associated representations influences the complexity of conjugacy class separation.
Contribution
It provides a complete description of the conjugacy separability function for virtually abelian groups, linking it to the irreducibility of associated representations over .
Findings
Conjugacy separability function matches residual finiteness function for irreducible cases.
Non-irreducible representations can lead to larger conjugacy separability functions.
Examples illustrate the impact of representation irreducibility on conjugacy class separation complexity.
Abstract
A natural question for groups is which data can be detected in its finite quotients. A subset is called separable if for all , there exists an epimorphism to a finite group such that . More specifically, a group is said to be conjugacy separable if every conjugacy class is separable. It is known that many classes of groups are conjugacy separable, including virtually free and polycyclic groups. The minimal order of the quotient , in terms of the complexity of the conjugacy classes under consideration, is captured by the conjugacy separability function . This function is in general ill understood, in fact the only large class of groups for which it is known exactly are the abelian groups. Indeed, in this case is equal to the residual finiteness…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Differential Equations and Dynamical Systems
