2005
DOI: 10.1007/s10711-005-9007-2
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic of Abelian Subgroups of GL(n, $$\mathbb{C}$$ ): A Structure Theorem

Abstract: In this paper, we characterize the dynamic of every Abelian subgroup G of GL(n, K), K = R or C. We show that there exists a G-invariant, dense open set U in K n saturated by minimal orbits with K n − U a union of at most n G-invariant vector subspaces of K n of dimension n − 1 or n − 2 over K. As a consequence, G has height at most n and in particular it admits a minimal set in K n − {0}. (2000). 37C85. Mathematics Subject Classification

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
12
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 10 publications
(12 citation statements)
references
References 3 publications
(3 reference statements)
0
12
0
Order By: Relevance
“…We determine the structure of the open orbits of S. The following theorem will be applied for the group G * = S of theorem 3.1. Parts of these results are in [1]. Exactly the same arguments as above show that Gv = V \ H for every v / ∈ H. In particular H is the only maximal G-invariant (real or complex) vector subspace of V .…”
Section: Orbit Structurementioning
confidence: 61%
See 4 more Smart Citations
“…We determine the structure of the open orbits of S. The following theorem will be applied for the group G * = S of theorem 3.1. Parts of these results are in [1]. Exactly the same arguments as above show that Gv = V \ H for every v / ∈ H. In particular H is the only maximal G-invariant (real or complex) vector subspace of V .…”
Section: Orbit Structurementioning
confidence: 61%
“…We determine the structure of the open orbits of S. The following theorem will be applied for the group G * = S of theorem 3.1. Parts of these results are in [1].…”
Section: Orbit Structurementioning
confidence: 93%
See 3 more Smart Citations