Related papers: Kaleidoscopic groups: permutation groups construct…

Kaleidoscopic groups are a class of permutation groups recently introduced by Duchesne, Monod, and Wesolek. Starting with a permutation group $\Gamma$, the kaleidoscopic construction produces another permutation group $\mathcal{K}(\Gamma)$…

For each finite classical group $G$, we classify the subgroups of $G$ which act transitively on a $G$-invariant set of subspaces of the natural module, where the subspaces are either totally isotropic or nondegenerate. Our proof uses the…

A transitive permutation group is semiprimitive if each of its normal subgroups is transitive or semiregular. Interest in this class of groups is motivated by two sources: problems arising in universal algebra related to collapsing monoids…

Monodromy in analytic families of smooth complex surfaces yields groups of isotopy classes of orientation preserving diffeomorphisms for each family member X. For all deformation classes of minimal elliptic surfaces with p_g>q=0, we…

This paper is dedicated to the problem of infinite transitivity for algebraically generated automorphism groups of the affine plane. We provide a necessary and sufficient condition of infinite transitivity for a large family of subgroups…

An infinite family of association schemes obtained from the general unitary groups acting transitively on the sets of isotropic vectors in the finite unitary spaces are investigated. We compute the parameters and determine the character…

The endomorphism algebras of the permutation modules for transitive permutation groups, known as Hecke algebras, are fundamental objects in representation theory. While group algebras are known to be symmetric over any field, it is natural…

We give a unified description of twisted forms of classical reductive groups schemes. Such group schemes are constructed from algebraic objects of finite rank, excluding some exceptions of small rank. These objects, augmented odd form…

Let G be the homeomorphism group of a dendrite. We study the normal subgroups of G. For instance, there are uncountably many non-isomorphic such groups G that are simple groups. Moreover, these groups can be chosen so that any isometric…

We survey recent results on multiple transitivity of automorphism groups of affine algebraic varieties. We consider the property of infinite transitivity of the special automorphism group, which is equivalent to flexibility of the…

Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…

A finite transitive permutation group is elusive if it contains no derangements of prime order. These groups are closely related to a longstanding open problem in algebraic graph theory known as the Polycirculant Conjecture, which asserts…

This paper introduces a group-theoretic framework to analyze the algebraic structure of the Grover walk on a complete graph with self-loops. We construct a group generated by the Grover matrix and a diagonal matrix whose entries are powers…

Our aim is to describe the theory of Cartesian decompositions preserved by some member of a large family of finite transitive permutation groups called innatelytransitive groups.

The sets of primitive, quasiprimitive, and innately transitive permutation groups may each be regarded as the building blocks of finite transitive permutation groups, and are analogues of composition factors for abstract finite groups. This…

A new construction of naturally reductive spaces is presented. This construction gives a large amount of new families of naturally reductive spaces. First the infinitesimal models of the new naturally reductive spaces are constructed. A…

A hyperfinite $II_1$ subfactor may be obtained from a symmetric commuting square via iteration of the basic construction. For certain commuting squares constructed from Hadamard matrices, we describe this subfactor as a group-type inclusion…

We show how to construct a family of groups with simple commutator subgroups from aperiodic 1-vertex, finitely aligned higher rank graphs (which are, in fact, a class of cancellative monoids). Inverse semigroups form the intermediary…

By a result of Blokh from 1984, every transitive map of a tree has the relative specification property, and so it has finite decomposition ideal, positive entropy and dense periodic points. In this paper we construct a transitive dendrite…

We introduce a new class of transitive permutation groups which properly contains the automorphism groups of vertex-transitive graphs and digraphs. We then give a sufficient condition for a quotient of this family to remain in the family,…