Related papers: String C-groups as transitive subgroups of Sym(n)

If $G$ is a transitive group of degree $n$ having a string C-group of rank $r\geq (n+3)/2$, then $G$ is necessarily the symmetric group $S_n$. We prove that if $n$ is large enough, up to isomorphism and duality, the number of string…

In this paper, string C-groups of all ranks $3 \leq r \leq \frac{n}{2}$ are provided for each alternating group $A_n$, $n \geq 12$. As the string C-group representations of $A_n$ have also been classified for $n \leq 11$, and it is known…

We classify C-groups of ranks $n-1$ and $n-2$ for the symmetric group $S_n$. We also show that all these C-groups correspond to hypertopes, that is, thin, residually connected flag-transitive geometries. Therefore we generalise some similar…

In this paper we give a non-computer-assisted proof of the following result: if $G$ is an even transitive group of degree $11$ and has a string C-group representation with rank $r\in\{4,5\}$ then $G\cong\PSL_2(11)$. Moreover this string…

The {\it prime graph} $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of $G$ of order…

We prove that for any integer $n\geq 12$, and for every $r$ in the interval $[3, \ldots, \lfloor (n-1)/2\rfloor]$, the group $A_n$ has a string C-group representation of rank $r$ therefore showing that the only alternating group whose set…

We show that a rank reduction technique for string C-group representations first used for the symmetric groups generalizes to arbitrary settings. The technique permits us, among other things, to prove that orthogonal groups defined on…

Let $\Gamma$ be a discrete group. When $\Gamma$ is nonamenable, the reduced and full group $C$*-algebras differ and it is generally believed that there should be many intermediate $C$*-algebras, however few examples are known. In this paper…

A graph $\Gamma$ is $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of arcs of $\Gamma$, where an arc is an ordered pair of adjacent vertices. Let $\Gamma$ be a $G$-symmetric graph such that its…

A graph $\Gamma$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $G$-symmetric graphs $\Gamma$ with $V(\Gamma)$ admitting…

A string group generated by involutions, or SGGI, is a pair $\Gamma=(G, S)$, where $G$ is a group and $S=\{\rho_0,\ldots, \rho_{r-1}\}$ is an ordered set of involutions generating $G$ and satisfying the commuting property: $$\forall…

Let $G$ be a group. \textit{The permutability graph of cyclic subgroups of $G$}, denoted by $\Gamma_c(G)$, is a graph with all the proper cyclic subgroups of $G$ as its vertices and two distinct vertices in $\Gamma_c(G)$ are adjacent if and…

A graph $\Gamma$ is said to be symmetric if its automorphism group $\rm Aut(\Gamma)$ acts transitively on the arc set of $\Gamma$. In this paper, we show that if $\Gamma$ is a finite connected heptavalent symmetric graph with solvable…

The normal covering number $\gamma(G)$ of a finite, non-cyclic group $G$ is the minimum number of proper subgroups such that each element of $G$ lies in some conjugate of one of these subgroups. We find lower bounds linear in $n$ for…

A regular bipartite graph $\Gamma$ is called semisymmetric if its full automorphism group $\mathrm{Aut}(\Gamma)$ acts transitively on the edge set but not on the vertex set. For a subgroup $G$ of $\mathrm{Aut}(\Gamma)$ that stabilizes 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…

Suppose that $\Gamma$ is a non-empty connected graph, $\mathfrak{G}$ is the fundamental group of a graph of groups over $\Gamma$, and $\mathcal{C}$ is a root class of groups (the last means that $\mathcal{C}$ contains non-trivial groups and…

The cyclic graph $\Gamma(S)$ of a semigroup $S$ is the simple graph whose vertex set is $S$ and two vertices $x, y$ are adjacent if the subsemigroup generated by $x$ and $y$ is monogenic. In this paper, we classify the semigroup $S$ such…

We give a rank augmentation technique for rank 3 string C-group representations of the symmetric group $S_n$ and list the hypotheses under which it yields a valid string C-group representation of rank 4 thereof.

The commuting graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with group elements as a vertex set and two elements $x$ and $y$ are adjacent if and only if $xy=yx$ in $G$. By eliminating the identity element of $G$ and all…