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

A semisimple element $s$ of a connected reductive group $G$ is said {\it quasi-isolated} (respectively {\it isolated}) if $C_G(s)$ (respectively $C_G^0(s)$) is not contained in a Levi subgroup of a proper parabolic subgroup of $G$. We study…

A topological group $G$ is {\em sequentially $h$-complete} if all the continuous homomorphic images of $G$ are sequentially complete. In this paper we give necessary and sufficient conditions on a complete group for being compact, using the…

We show that there is no algorithm deciding whether the maximal residually free quotient of a given finitely presented group is finitely presentable or not. Given a finitely generated subgroup G of a finite product of limit groups, we…

Let $G$ be a complex connected reductive algebraic group and let $G_{\mathbb{R}}$ be a real form of $G$. We construct a sequence of functors $L_i\mathcal{R}$ from admissible (resp. finite-length) representations of $G$ to admissible (resp.…

An element $g$ of a finite group $G$ is said to be vanishing in $G$ if there exists an irreducible character $\chi$ of $G$ such that $\chi(g)=0$; in this case, $g$ is also called a zero of $G$. The aim of this paper is to obtain structural…

If $G_1$ and $G_2$ are torsion-free hyperbolic groups and $P<G_1\times G_2$ is a finitely generated subdirect product, then the conjugacy problem in $P$ is solvable if and only if there is a uniform algorithm to decide membership of the…

A graph $G$ is perfectly divisible if every induced subgraph $H$ of $G$ contains a set $X$ of vertices such that $X$ meets all largest cliques of $H$, and $X$ induces a perfect graph. The chromatic number of a perfectly divisible graph $G$…

Reductions of N-wave type equations related to simple Lie algebras and the hierarchy of their Hamiltonian structures are studied. The reduction group G_R is realized as a subgroup of the Weyl group of the corresponding algebra. Some of the…

Let G be a real or complex linear algebraic reductive group. Let H and F be reductive subgroups. We study the natural H action on G/F. The main theorem of this note shows that generic H orbits are closed. This theorem is then applied to…

For a compact Hausdorff abelian group K and its subgroup H, one defines the g-closure g(H) of H in K as the subgroup consisting of $\chi \in K$ such that $\chi(a_n)\longrightarrow 0$ in T=R/Z for every sequence {a_n} in $\hat K$ (the…

In this paper, we work on the pro-nilpotent group topology of a free group. First we investigate the closure of the product of finitely many subgroups of a free group in the pro-nilpotent group topology. We present an algorithm for the…

A graph $G = (V, E)$ is \emph{partitionable} if there exists a partition $\{A, B\}$ of $V$ such that $A$ induces a disjoint union of cliques and $B$ induces a triangle-free graph. In this paper we investigate the computational complexity of…

A group G is (finitely) co-Hopfian if it does not contain any proper (finite-index) subgroups isomorphic to itself. We study finitely generated groups G that admit a descending chain of proper normal finite-index subgroups, each of which is…

We propose a method for solving the hidden subgroup problem in nilpotent groups. The main idea is iteratively transforming the hidden subgroup to its images in the quotient groups by the members of a central series, eventually to its image…

A graph H is a vertex-minor of a graph G if it can be reached from G by the successive application of local complementations and vertex deletions. Vertex-minors have been the subject of intense study in graph theory over the last decades…

Let $G$ be a finite almost simple group with socle $G_0$. A (nontrivial) factorization of $G$ is an expression of the form $G=HK$, where the factors $H$ and $K$ are core-free subgroups. There is an extensive literature on factorizations of…

Let G be a graph embedded on a surface of genus g with b boundary cycles. We describe algorithms to compute multiple types of non-trivial cycles in G, using different techniques depending on whether or not G is an undirected graph. If G is…

Let $G$ be a locally graded group and suppose that every non-nilpotent subgroup of $G$ is permutable. We prove that $G$ is soluble. (In light of previous results of the authors, it suffices to prove that $G$ is soluble if it is periodic.

We prove that if $G$ is a noncompact connected real reductive linear Lie group, then any discrete subgroup of $G$ acting properly discontinuously and cocompactly on some homogeneous space $G/H$ of $G$ is quasi-isometrically embedded and…

In this note we give some new results concerning the subgroup commutativity degree of a finite group $G$. These are obtained by considering the minimum of subgroup commutativity degrees of all sections of $G$.