2019
DOI: 10.1007/s00209-019-02324-7
|View full text |Cite
|
Sign up to set email alerts
|

The length and depth of compact Lie groups

Abstract: Let G be a connected Lie group. An unrefinable chain of G is a chain of subgroups G = G0 > G1 > · · · > Gt = 1, where each Gi is a maximal connected subgroup of Gi−1. In this paper, we introduce the notion of the length (respectively, depth) of G, defined as the maximal (respectively, minimal) length of such a chain, and we establish several new results for compact groups. In particular, we compute the exact length and depth of every compact simple Lie group, and draw conclusions for arbitrary connected compac… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

2
3
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 21 publications
2
3
0
Order By: Relevance
“…We prove the following result, which refines and extends [3,Lemma 2.1] to not necessarily connected subgroups. Theorem 0.2.…”
supporting
confidence: 60%
See 1 more Smart Citation
“…We prove the following result, which refines and extends [3,Lemma 2.1] to not necessarily connected subgroups. Theorem 0.2.…”
supporting
confidence: 60%
“…In the opposite direction, every ϕ ∈ hom(A(G), C) yields a collection (x i ) of linear operators V i → V i by (3). This extends to an element x = (x V ) ∈ T (G) by using the canonical decompositions using the coefficient vector spaces hom(V i , V )…”
Section: Properties Of Complexificationmentioning
confidence: 99%
“…We prove the following result, which refines and extends [2,Lemma 2.1] to not necessarily connected subgroups.…”
supporting
confidence: 60%
“…Different aspects of word maps are considered in a vast and extended literature; we refer to the papers [7,8,9,20,21,45,46,47,57,72,97,98,99,101] for details, surveys and further explanations. Waring type questions for rings were considered by Matei Brešar [17].…”
Section: Evaluations Of Wordsmentioning
confidence: 99%