Related papers: String C-group representations of transitive Group…

Let $p$ be a prime and let $L$ be either the intransitive permutation group $C_p\times C_p$ of degree $2p$ or the transitive permutation group $C_p \wr C_2$ of degree $2p$. Let $\Gamma$ be a connected $G$-vertex-transitive and…

Comparability graphs are graphs which have transitive orientations. The dimension of a poset is the least number of linear orders whose intersection gives this poset. The dimension ${\rm dim}(X)$ of a comparability graph $X$ is the…

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,…

We present new algorithms to classify all string C-group representations of a given group $G$. We use these algorithms to classify all string C-group representations of the sporadic groups of Suzuki and Rudvalis.

This paper is an exploration of the faithful transitive permutation representations of the orientation-preserving automorphisms groups of highly symmetric toroidal maps and hypermaps. The main theorems of this paper give a list of all…

Given a permutation group $G$, the derangement graph of $G$ is the Cayley graph with connection set the derangements of $G$. The group $G$ is said to be innately transitive if $G$ has a transitive minimal normal subgroup. Clearly, every…

We give examples of finite string $C$-groups (the automorphism groups of abstract regular polytopes) that have irreducible characters of real Schur index $2$. This answers a problem of Monson concerning these groups.

We explicitly determine all of the transitive groups of degree p-squared, p a prime, whose Sylow p-subgroup is not the wreath product of two cyclic groups of order p. Furthermore, we provide a general description of the transitive groups of…

A transitive permutation group of prime degree is doubly transitive or solvable. We give a direct proof of this theorem by Burnside which uses neither S-ring type arguments, nor representation theory.

Given a permutation group $G$, the derangement graph $\Gamma_G$ of $G$ is the Cayley graph with connection set the set of all derangements of $G$. We prove that, when $G$ is transitive of degree at least $3$, $\Gamma_G$ contains a triangle.…

A cap in PG(r,q) is a set of points, no three of which are collinear. A cap is said to be transitive if its automorphism group in PGammaL(r+1,q) acts transtively on the cap, and co-transitive if the automorphism group acts transtively on…

Let $s$ be a positive integer. A graph is $s$-transitive if its automorphism group is transitive on s-arcs but not on $(s + 1)$-arcs. In this paper, we study all tetravalent s-transitive graphs of order $6p^2$.

Consider a discrete valuation ring $R$ whose residue field is finite of cardinality at least $3$. For a finite torsion module, we consider transitive subsets $O$ under the action of the automorphism group of the module. We prove that the…

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 $\Gamma$ be a finite, undirected, connected, simple graph. We say that a matching $\mathcal{M}$ is a \textit{permutable $m$-matching} if $\mathcal{M}$ contains $m$ edges and the subgroup of $\text{Aut}(\Gamma)$ that fixes the matching…

The motion of a graph is the minimum number of vertices that are moved by a non-trivial automorphism. Equivalently, it can be defined as the minimal degree of its automorphism group (as a permutation group on the vertices). In this paper we…

For all Frobenius groups and a large class of finite multiply transitive permutation groups, we show that the corresponding group-subgroup subfactors are completely characterized by their principal graphs. The class includes all the sharply…

The notion of a $k$-11-representable graph was introduced by Jeff Remmel in 2017 and studied by Cheon et al.\ in 2019 as a natural extension of the extensively studied notion of word-representable graphs, which are precisely…

A graph is said to be {\em vertex-transitive non-Cayley} if its full automorphism group acts transitively on its vertices and contains no subgroups acting regularly on its vertices. In this paper, a complete classification of cubic…

The goal of this paper is to construct and describe certain arithmetic subgroups of the automorphism group of a partially commutative group. More precisely, given an arbitrary finite graph $\Gamma$ we construct an arithmetic subgroup…