Related papers: Group-subgroup subfactors revisited
Given a finite transitive permutation group $G\leq \operatorname{Sym}(\Omega)$, with $|\Omega|\geq 2$, the derangement graph $\Gamma_G$ of $G$ is the Cayley graph $\operatorname{Cay}(G,\operatorname{Der}(G))$, where $\operatorname{Der}(G)$…
In this note we give a self-contained proof of the following classification (up to conjugation) of subgroups of the general symplectic group of dimension n over a finite field of characteristic l, for l at least 5, which can be derived from…
We develop an equivariant theory of graphs with respect to quantum symmetries and present a detailed exposition of various examples. We portray unitary tensor categories as a unifying framework encompassing all finite classical simple…
A graph is called {\em half-arc-transitive} if its full automorphism group acts transitively on vertices and edges, but not on arcs. It is well known that for any prime $p$ there is no tetravalent half-arc-transitive graph of order $p$ or…
Commuting involution graphs have been studied for finite Coxeter groups and for affine groups of classical type. The purpose of this short note is to establish some general results for commuting involution graphs in affine Coxeter groups,…
A semiregular permutation group on a set $\Ome$ is called {\em bi-regular} if it has two orbits. A classification is given of quasiprimitive permutation groups with a biregular dihedral subgroup. This is then used to characterize the family…
The transitivity degree of a group $G$ is the supremum of all integers $k$ such that $G$ admits a faithful $k$-transitive action. Few obstructions are known to impose an upper bound on the transitivity degree for infinite groups. The…
Let $R$ be a standard graded finitely generated algebra over an $F$-finite field of prime characteristic, localized at its maximal homogeneous ideal. In this note, we prove that that Frobenius complexity of $R$ is finite. Moreover, we…
The famous Burnside-Schur theorem states that every primitive finite permutation group containing a regular cyclic subgroup is either 2-transitive or isomorphic to a subgroup of a 1-dimensional affine group of prime degree. It is known that…
We introduce the notion of an \emph{$n$-dimensional mixed dihedral group}, a general class of groups for which we give a graph theoretic characterisation. In particular, if $H$ is an $n$-dimensional mixed dihedral group then the we…
We determine the semi-regular subgroups of the 2-transitive permutation groups PGL(2,n), PSL(2,n), PGU(3,n), PSU(3,n), Sz(n) and Ree(n) with n a suitable power of a prime number p.
The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given…
Let (k1,k2,k3,k4) be a quartet of cyclic cubic number fields sharing a common conductor c=pqr divisible by exactly three prime(power)s p,q,r. For those components k of the quartet whose 3-class group Cl(3,k) = Z/3Z x Z/3Z is elementary…
The permutation group $S_N$ has a quantum analogue $S_N^+$, which is infinite at $N\geq4$. We review the known facts regarding $S_N^+$, and notably its easiness property, Weingarten calculus, and the isomorphism $S_4^+=SO_3^{-1}$ and its…
We explore graph theoretical properties of minimal prime graphs of finite solvable groups. In finite group theory studying the prime graph of a group has been an important topic for the past almost half century. Recently prime graphs of…
We improve the upper bounds (in terms of $n$) in [9] and [13] on the minimal number of elements required to generate a minimally transitive permutation group of degree $n$.
In this paper, we study commutative zero-divisor semigroups determined by graphs. We prove a uniqueness theorem for a class of graphs. We show two classes of graphs that have no corresponding semigroups. In particular, any complete graph…
For every graph that is mimimally rigid in the plane, its Galois group is defined as the Galois group generated by the coordinates of its planar realizations, assuming that the edge lengths are transcendental and algebraically independent.…
In this paper, we continue the classification work done in the first paper of the same name. With careful modifications of our previous approach, we are able to deduce (with two notable exceptions) which members of the previously introduced…
In this paper we introduce a Cayley-type graph for group-subgroup pairs and present some elementary properties of such graphs, including connectedness, their degree and partition structure, and vertex-transitivity. We relate these…