SearcharxivSearch

arXiv · 1303.0811

On the dimension datum problem and the linear dependence problem

Abstract

The dimension datum of a closed subgroup of a compact Lie group is the sequence of invariant dimensions of irreducible representations by restriction. In this article we classify closed connected subgroups with equal dimension data or linearly dependent dimension data. This classification should have applications to the isospectral geometry and automorphic form theory. We also study the equality/linear dependence of not necessarily connected subgroups of unitary group acting irreducibly on the natural representation.

Explore related subjects

Keep this discovery

BibTeXRIS

Jun Yu. 2013-03-04. On the dimension datum problem and the linear dependence problem. https://arxiv.org/abs/1303.0811

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

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR