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

The Krohn-Rhodes Theorem proves that a finite semigroup divides a wreath product of groups and aperiodic semigroups. Krohn-Rhodes complexity equals the minimal number of groups that are needed. Determining an algorithm to compute complexity…

Suppose that $\tilde{G}$ is a connected reductive group defined over a field $k$, and $\Gamma$ is a finite group acting via $k$-automorphisms of $\tilde{G}$ satisfying a certain quasi-semisimplicity condition. Then the connected part of the…

Let $G$ be a graph that contains an induced subgraph $H$. A retraction from $G$ to $H$ is a homomorphism from $G$ to $H$ that is the identity function on $H$. Retractions are very well-studied: Given $H$, the complexity of deciding whether…

Many results have been established about determining whether or not an element evaluates to zero on an irreducible character of a group. In this note it is shown that if a group $G$ has a normal nilpotent subgroup $N$, and $P$ is a Sylow…

For an arbitrary connected solvable spherical subgroup H of a connected semisimple algebraic group G we compute the group N_G(H), the normalizer of H in G. Thereby we complete a classification of all (not necessarily connected) solvable…

Let $G$ be a semisimple algebraic group over the complex numbers and $K$ be a connected reductive group mapping to $G$ so that the Lie algebra of $K$ gets identified with a symmetric subalgebra of $\mathfrak{g}$. So we can talk about…

In this paper, we present a contraction-guided adaptive partitioning algorithm for improving interval-valued robust reachable set estimates in a nonlinear feedback loop with a neural network controller and disturbances. Based on an estimate…

Let G be an abelian group and let lambda be the smallest rank of any group whose direct sum with a free group is isomorphic to G. If lambda is uncountable, then G has lambda pairwise disjoint, non-free subgroups. There is an example where…

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of nonabelian simple groups. The minimum number of nonsolvable factors attained on all possible such series is called the…

A vertex set $X$ of a graph $G$ is an association set if each component of $G - X$ is a clique, or a dissociation set if each component of $G - X$ is a single vertex or a single edge. Interestingly, $G - X$ is then precisely a graph…

The subgroup pattern of a finite groups $G$ is the table of marks of $G$ together with a list of representatives of the conjugacy classes of subgroups of $G$. In this article we present an algorithm for the computation of the subgroup…

Complex real-world networks commonly reveal characteristic groups of nodes like communities and modules. These are of value in various applications, especially in the case of large social and information networks. However, while numerous…

We investigate a graph probing problem in which an agent has only an incomplete view $G' \subsetneq G$ of the network and wishes to explore the network with least effort. In each step, the agent selects a node $u$ in $G'$ to probe. After…

The discrete cocompact subgroups of the 5-dimensional Lie group G_53 are determined up to isomorphism. Each of their group C*-algebras is studied by determining all of its simple infinite dimensional quotient C*-algebras. The K-groups and…

Let $X=G/\Gamma$ be the quotient of a semisimple Lie group $G$ by its non-cocompact arithmetic lattice. Let $H$ be a reductive algebraic subgroup of $G$ acting on $X$. We give several equivalent algebraic conditions on $H$ for the existence…

A numerical semigroup is irreducible if it cannot be obtained as intersection of two numerical semigroups containing it properly. If we only consider numerical semigroups with the same Frobenius number, that concept is generalized to atomic…

Let $G$ be a simple algebraic group over an algebraically closed field $K$ of characteristic $p\geqslant 0$, let $H$ be a proper closed subgroup of $G$ and let $V$ be a nontrivial irreducible $KG$-module, which is $p$-restricted, tensor…

Let $G$ be the real reductive group and let $G_0$ be the identity component. Let us assume that the unitary dual $\hat{G_0}$ is known. In this paper (in Section 5) the unitary dual $\hat{G}$ is constructed. Automorphisms of $G_0$ generated…

Let $G$ be a finite non-abelian group and $\kappa_1(G)$ the number of conjugate classes of minimal non-abelian subgroups of $G$. The structure of $G$ with $\kappa_1(G)=1$ is determined. In the case of $G$ being the $p$-groups, the structure…

Let $G$ be a connected algebraic group. An unrefinable chain of $G$ is a chain of subgroups $G = G_0 > G_1 > \cdots > G_t = 1$, where each $G_i$ is a maximal connected subgroup of $G_{i-1}$. We introduce the notion of the length…