Searcharxiv⌕ Search

arXiv · math/0608579

The orbit structure of Dynkin curves

Abstract

Let G be a simple algebraic group over an algebraically closed field k; assume that Char k is zero or good for G. Let \cB be the variety of Borel subgroups of G and let e in Lie G be nilpotent. There is a natural action of the centralizer C_G(e) of e in G on the Springer fibre \cB_e = {B' in \cB | e in Lie B'} associated to e. In this paper we consider the case, where e lies in the subregular nilpotent orbit; in this case \cB_e is a Dynkin curve. We give a complete description of the C_G(e)-orbits in \cB_e. In particular, we classify the irreducible components of \cB_e on which C_G(e) acts with finitely many orbits. In an application we obtain a classification of all subregular orbital varieties admitting a finite number of B-orbits for B a fixed Borel subgroup of G.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Simon M. Goodwin, Lutz Hille, Gerhard Roehrle. 2007-01-17. The orbit structure of Dynkin curves. https://searcharxiv.com/abs/math/0608579

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Algorithms for experimenting with Zariski dense matrix groups over number fields

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to find the set of congruence quotients of $H$ modulo all maximal ideals of a finitely generated subring $R$ of $\mathbb{P}$ such that $H\leq \mathrm{SL}(n,R)$. The algorithms have been implemented in GAP. Potential applications are illustrated by a range of experiments in degree $2$, with a special focus on Bianchi groups.

math.GR↗

Two problems about bases and independent sets in free groups

We will answer a problem of Dotsenko that asks for a tight upper bound on the rank of subgroups given a maximum length for its generators. Then, we will use the same tools to answer a longstanding problem of Grigorchuk in the 10th edition of the Kourovka notebook. We accomplish this using Stallings foldings and simple graph theory.

math.GR↗