Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0708.0477

Optimal Subgroups and Applications to Nilpotent Elements

Michael Bate
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let G be a reductive group acting on an affine variety X, let x in X be a point whose G-orbit is not closed, and let S be a G-stable closed subvariety of X which meets the closure of the G-orbit of x but does not contain x. In this paper, we study G.R. Kempf's optimal class Omega_G(x,S) of cocharacters of G attached to the point x; in particular, we consider how this optimality transfers to subgroups of G. Suppose K is a G-completely reducible subgroup of G which fixes x, and let H = C_G(K)^0. Our main result says that the H-orbit of x is also not closed, and the optimal class Omega_H(x,S) for H simply consists of the cocharacters in Omega_G(x,S) which evaluate in H. We apply this result in the case that G acts on its Lie algebra via the adjoint representation to obtain some new information about cocharacters associated with nilpotent elements in good characteristic.

Explore related subjects

math.GRmath.AG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael Bate. 2008-05-12. Optimal Subgroups and Applications to Nilpotent Elements. https://arxiv.org/abs/0708.0477

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

KEEP EXPLORING

Related papers

arXiv2026

Algebro-Geometric Invariants of Finitely Generated Groups (The Profile of a Representation Variety)

If G is a finitely generated group, and A an algebraic group, then Hom(G,A) is a possibly reducible algebraic variety denoted by R_A(G). Here we define the profile function, P_d(R_A(G)), of the representation variety of G over A to be P_d(R_A(G))=(N_d(R_A(G)),...,N_0(R_A(G))), where N_i(R_A(G)) stands for the number of irreducible components of R_A(G) of dimension i, where 0\leq i\leq d, and d=Dim(R_A(G)). We then use this invariant in the study of fg groups and prove various results. In particular, we show that if G an orientable surface group of genus g\geq 1, then P_d(R_{SL(2,C)}(G))\neq P_d(R_{PSL(2,C)}(G)). We also show that the same holds for G a torus knot group with presentation where both p,t are greater than 2, and that the same also holds when G is a the fundamental group of a compact non-orientable surface of genus g\geq 3. Further, we show that if a group G can be n+1 generated, and presented by , where W is a non-trivial word in F_n= , and A=PSL(2, C), that then Dim(R_{A}(G)) is equal to Max{3n, Dim(R_{A}(G'))+2 \} \leq 3n+1, where G'= . We also give a condition guaranteeing that the resulting algebraic variety is reducible.

math.GR↗
arXiv2026

Exact versus monotone isoperimetric profiles of finitely generated groups

Gromov asked whether the exact isoperimetric profile of an infinite finitely generated group is comparable, at the same cardinality, to its greatest nondecreasing minorant. We compare finite sets with their translates and construct orders for which the first $r$ vertices have boundary bounded by a fixed multiple of that of the whole set. Such orders follow from profile summability or from rays in Schreier graphs with a uniform bound on the number using each edge. Among infinite finitely generated groups, we obtain comparison and nested exhaustions for elementary amenable and branch groups, direct products of at least two infinite groups, restricted wreath products with two nontrivial factors, and certain simple topological full groups, including amenable derived groups of interval exchanges. The exhausting $n$-point sets have boundary comparable to the monotone profile at $n$. The ray condition is quasi-isometry invariant and holds for the Sierpiński-carpet group. For polycyclic groups of exponential growth, we refine Pittet's construction to obtain explicit nested sets with $|F_n|=n$ and $|\partial F_n|\asymp n/\log n$, answering his question with exact rather than comparable cardinalities. We also prove that the normalized $L^1$ profile satisfies $j(v)\le C(v/u)j(u)$ for $1\le u\le v$ on every infinite connected bounded-degree vertex-transitive graph. This yields the separation bound asked for by Gournay--Le Coz and Hume's Dirichlet--Neumann comparison at $p=1$. For groups of exponential growth, the exact-to-monotone comparison ratio is $O(\log\log n)$. We answer the first part of Correia's Question 1.3 positively by proving the required dilation regularity, and the second negatively by constructing elementary amenable examples whose inverse compositions fail this regularity for every choice of equivalent representatives.

math.GR↗
arXiv2026

Gluing diagrams part 1: A constructive solution for the Higman-Thompson group isomorphism problem

This paper introduces gluing diagrams, a combinatorial tool to construct homomorphisms between the shift pseudogroups of directed graphs and thus also their full groups of shifts. We will establish which of these diagrams produce isomorphisms. As an application, using the interpretation of Higman-Thompson groups as full groups of shifts of specific graphs, we will describe a procedure that constructs gluing diagrams that explicitly describe the isomorphisms between Higman-Thompson groups, conjectured by Higman and whose existence was proven by Pardo arXiv:1006.1759. This procedure will follow Euclid's algorithm and will allow us to lift isomorphisms to higher arity.

math.GR↗