Related papers: G-complete reducibility in non-connected groups

We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…

Let G be a reductive algebraic group associated to a self-adjoint homogeneous cone defined over Q, and let G' be an appropriate neat arithmetic subgroup of G. We present two algorithms to compute the action of the Hecke operators on the…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

A closed subgroup of a semisimple algebraic group is called irreducible if it lies in no proper parabolic subgroup. In this paper we classify all irreducible $A_1$ subgroups of exceptional algebraic groups $G$. Consequences are given…

A subgroup $H$ of a finite group $G$ is said to be an $\mathscr{H}C$-subgroup of $G$ if there exists a normal subgroup $T$ of $G$ such that $G=HT$ and $H^g \cap N_T(H)\leq H$ for all $g\in G$. In this paper, we investigate the structure of…

A group G is a vGBS group if it admits a decomposition as a finite graph of groups with all edge and vertex groups finitely generated and free abelian. We describe the compatibility JSJ decomposition over abelian groups. We prove that in…

Let G denote a group and let W be an algebra over a commutative ring R. We will say that W is a G-graded twisted algebra (not necessarily commutative, neither associative) if there exists a G-grading W=\bigoplus_{g \in G}W_{g} where each…

The connectivity of a graph is an important parameter to evaluate its reliability. $k$-restricted connectivity (resp. $R^h$-restricted connectivity) of a graph $G$ is the minimum cardinality of a set $S$ of vertices in $G$, if exists, whose…

A subgroup H of a group G is called inert if for each $g\in G$ the index of $H\cap H^g$ in $H$ is finite. We give a classification of soluble-by-finite groups $G$ in which subnormal subgroups are inert in the cases where $G$ has no…

Let G be a connected reductive algebraic group over an algebraically closed field k. In a recent paper, Bate, Martin, R\"ohrle and Tange show that every (smooth) subgroup of G is separable provided that the characteristic of k is very good…

In this paper, we describe the possible disconnected complex reductive algebraic groups $E$ with component group $\Gamma = E/E_0$. We show that there is a natural bijection between such groups $E$ and algebraic extensions of $\Gamma$ by…

We introduce a family of reductions for removing proper and homogeneous pairs of cliques from a graph G. This family generalizes some routines presented in the literature, mostly in the context of claw-free graphs. These reductions can be…

Let $G$ be a reductive group in the Harish-Chandra class e.g. a connected semisimple Lie group with finite center, or the group of real points of a connected reductive algebraic group defined over $\R$. Let $\sigma$ be an involution of the…

Given a group $G$ and a subset $X \subset G$, an element $g \in G$ is called quasi-positive if it is equal to a product of conjugates of elements in the semigroup generated by $X$. This notion is important in the context of braid groups,…

A graph is called claw-free if it contains no induced subgraph isomorphic to the complete bipartite graph $K_{1, 3}$. The undirected power graph of a group $G$ has vertices the elements of $G$, with an edge between $g_1$ and $g_2$ if one of…

We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the induced map of profinite completions $\hat P\to \hat\G$ is an isomorphism. We prove that there is no algorithm that, given an arbitrary…

Let $G$ be a finite group and $A$ be a subgroup of $G$. Then $A$ is called a $p$-$CAP$-subgroup of $G$, if $A$ covers or avoids every $pd$-chief factor of $G$. A subgroup $H$ of $G$ is said to be an $ICPC$-subgroup of $G$, if $H \cap [H,G]…

Let G be a connected reductive linear algebraic group. The aim of this note is to settle a question of J-P. Serre concerning the behaviour of his notion of G-complete reducibility under separable field extensions. Part of our proof relies…

Let $G$ be a simple algebraic group of type $E_n (n=6,7,8)$ defined over an algebraically closed field $k$ of characteristic $2$. We present examples of triples of closed reductive groups $H<M<G$ such that $H$ is $G$-completely reducible,…

The aim of this paper is to present an explicit reduction algorithm for Hilbert modular groups over arbitrary totally real number fields. An implementation of the algorithm is available to download from [19]. The exposition is…