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

This paper deals with sufficiency conditions for irreducibility of certain induced modules. We also construct irreducible representations for a group $G$ over a field ${\mathbb K}$ where the group $G$ is a semidirect product of a normal…

A group $G$ is called subgroup conjugacy separable if for every pair of non-conjugate finitely generated subgroups of $G$, there exists a finite quotient of $G$ where the images of these subgroups are not conjugate. We prove that limit…

The component connectivity is the generalization of connectivity which is an parameter for the reliability evaluation of interconnection networks. The $g$-component connectivity $c\kappa_{g}(G)$ of a non-complete connected graph $G$ is the…

Given a finitely generated subgroup $H$ of a free group $F$, we present an algorithm which computes $g_1,\ldots,g_m\in F$, such that the set of elements $g\in F$, for which there exists a non-trivial $H$-equation having $g$ as a solution,…

We survey group-theoretic algorithms for finding (some or all) subgroups of a finite group and discuss the implementation of these algorithms in the computer algebra system GAP

Let $D$ be a connected component of a possibly disconnected reductive group $G$ over an algebraic closed field. We define a partition of $D$ into finitely many Strata each of which is a union of $G^0$-conjugacy classes of fixed dimension.…

A topological group G is h-complete if every continuous homomorphic image of G is (Raikov-)complete; we say that G is hereditarily h-complete if every closed subgroup of G is h-complete. In this paper, we establish open-map properties of…

We give examples of groups G such that G^00 is different from G^000. We also prove that for groups G definable in an o-minimal structure, G has a "bounded orbit" iff G is definably amenable. These results answer questions of Gismatullin,…

A topological group is locally pseudocompact if it contains a non-empty open set with pseudocompact closure. In this note, we prove that if G is a group with the property that every closed subgroup of G is locally pseudocompact, then G_0 is…

Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…

A group $G$ is said to be cut if, for every $g \in G$, each generator of $< \! g \! >$ is conjugated to either $g$ or $g^{-1}$. It is conjectured that a Sylow 3-subgroup $P$ of a cut group $G$ is cut. We prove that this is true if $|G|$ is…

In this paper we construct $G$-Hilbert schemes for finite group schemes $G$. We find a construction of $G$-Hilbert schemes as relative $G$-Hilbert schemes over the quotient that does not need the Hilbert scheme of $n$ points, works under…

Let G be a complex reductive group and V a G-module. Let \pi: V \to V//G be the quotient morphism and set N(V) = \pi^{-1}(\pi(0)). We consider the following question. Is the null cone N(V) reduced, i.e., is the ideal of N(V) generated by…

We show that the rational subset membership problem in $G$ can be reduced to the submonoid membership problem in $G{\times}H$ where $H$ is virtually Abelian. We use this to show that there is no algorithm reducing submonoid membership to a…

Let G be a simple non-compact linear connected Lie group and H be a closed non-compact semisimple subgroup. We are interested in finding classes of homogeneous spaces G/H admitting proper actions of discrete non virtually abelian subgroups…

There are strong analogies between groups definable in o-minimal structures and real Lie groups. Nevertheless, unlike the real case, not every definable group has maximal definably compact subgroups. We study definable groups G which are…

We present a quantum algorithm which identifies with certainty a hidden subgroup of an arbitrary finite group G in only a polynomial (in log |G|) number of calls to the oracle. This is exponentially better than the best classical algorithm.…

We continue the analysis of definably compact groups definable in a real closed field $\mathcal{R}$. In [3], we proved that for every definably compact definably connected semialgebraic group $G$ over $\mathcal{R}$ there are a connected…

Let G be a connected reductive group over the field of real numbers R. Using results of our previous joint paper, we compute combinatorially the first Galois cohomology set H^1(R,G) in terms of reductive Kac labelings. Moreover, we compute…

Quantum algorithms for factoring and discrete logarithm have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the possibility of extending this general viewpoint to finding hidden…