Related papers: Hierarchical Complexity of Finite 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…

An unrefinable chain of a finite group $G$ is a chain of subgroups $G = G_0 > G_1 > \cdots > G_t = 1$, where each $G_i$ is a maximal subgroup of $G_{i-1}$. The length (respectively, depth) of $G$ is the maximal (respectively, minimal)…

We initiate a study of algorithms with a focus on the computational complexity of individual elements, and introduce the fragile complexity of comparison-based algorithms as the maximal number of comparisons any individual element takes…

For a finite group $G$, let $d(G)$ denote the minimal number of elements required to generate $G$. In this paper, given a finite almost simple group $G$ and any maximal subgroup $H$ of $G$, we determine a precise upper bound for $d(H)$. In…

When decomposing a finite semigroup into a wreath product of groups and aperiodic semigroups, complexity measures the minimal number of groups that are needed. Determining an algorithm to compute complexity has been an open problem for…

We introduce the depth parameters of a finite semigroup, which measure how hard it is to produce an element in the minimum ideal when we consider generating sets satisfying some minimality conditions. We estimate such parameters for some…

A natural question for groups $H$ is which data can be detected in its finite quotients. A subset $X \subset H$ is called separable if for all $h\in H \setminus X$, there exists an epimorphism $\varphi$ to a finite group $Q$ such that…

By a classical theorem of Jordan, every faithful transitive action of a nontrivial finite group has a derangement (an element with no fixed points). The existence of derangements with additional properties has attracted much attention,…

We define the topological complexity sequence of a group as the sequence of topological complexities of its Milnor constructions. This sequence may be regarded as an intrinsic refinement of the topological complexity of a group and, unlike…

We say that a finite group $G$ satisfies the independence property if, for every pair of distinct elements $x$ and $y$ of $G$, either $\{x,y\}$ is contained in a minimal generating set for $G$ or one of $x$ and $y$ is a power of the other.…

A systematic study is made, for an arbitrary finite relational language with at least one symbol of arity at least 2, of classes of nonrigid finite structures. The well known results that almost all finite structures are rigid and that the…

We construct 2D and 3D finite element de Rham sequences of arbitrary polynomial degrees with extra smoothness. Some of these elements have nodal degrees of freedom (DoFs) and can be considered as generalisations of scalar Hermite and…

We demonstrate the existence of a family of finitely generated subgroups of Richard Thompson's group $F$ which is strictly well-ordered by the embeddability relation in type $\epsilon_0 +1$. All except the maximum element of this family…

Self-assembly of complex and functional materials remains a grand challenge in soft material science. Efficient assembly depends on a delicate balance between thermodynamic and kinetic effects, requiring fine-tuning affinities and…

Composite basis functions for pyramidal elements on the spaces $H^1(\Omega)$, $H(\mathrm{curl},\Omega)$, $H(\mathrm{div},\Omega)$ and $L^2(\Omega)$ are presented. In particular, we construct the lowest-order composite pyramidal elements and…

The structure of transformation semigroups on a finite set is analyzed by introducing a hierarchy of functions mapping subsets to subsets. The resulting hierarchy of semigroups has a corresponding hierarchy of minimal ideals, or kernels.…

In this paper, we prove a series of results on group embeddings in groups with a small number of generators. We show that each finitely generated group $G$ lying in a variety ${\mathcal M}$ can be embedded in a $4$-generated group $H \in…

Groups of finite type (also called finitely constrained groups), introduced by Grigorchuk, are known to be the closure of regular branch groups. This article explores many of their properties. Firstly, we prove that being finitely…

We give a classification of maximal elements of the set of finite groups that can be realized as the full automorphism groups of simple polarized abelian fourfolds over finite fields. As an application, we compute the Jordan constants of…

We first obtain finiteness properties for the collection of closed normal subgroups of a compactly generated locally compact group. Via these properties, every compactly generated locally compact group admits an essentially chief series -…