Related papers: The string C-group representations of the Suzuki a…

This survey paper aims at giving the state of the art in the study of string C-group representations of almost simple groups. It also suggest a series of problems and conjectures to the interested reader.

The study of string C-group representations of rank at least $n/2$ for the symmetric group $S_n$ has gained a lot of attention in the last fifteen years. In a recent paper, Cameron et al. gave a list of permutation representation graphs of…

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.

Consider a relatively hyperbolic group G. We prove that if G is finitely presented, so are its parabolic subgroups. Moreover, a presentation of the parabolic subgroups can be found algorithmically from a presentation of G, a solution of its…

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…

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…

We present a new algorithm to compute all the chiral polytopes that have a given group $G$ as full automorphism group. This algorithm uses a new set of generators that characterize the group, all of them except one being involutions. It…

We give the classification of all possible G-graphs for any small binary dihedral subgroup G in GL(2,C) and use this classification to give the combinatorial description of the special representations of G in terms of its maximal cyclic…

We present a new algorithm for constructive recognition of the Suzuki groups in their natural representations. The algorithm runs in Las Vegas polynomial time given a discrete logarithm oracle. An implementation is available in the Magma…

If $\Gamma$ is a string C-group which is isomorphic to a transitive subgroup of the symmetric group Sym(n) (other than Sym(n) and the alternating group Alt(n)), then the rank of $\Gamma$ is at most $n/2+1$, with finitely many exceptions…

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…

We determine the ranks of string C-group representations of the groups ${\rm PSp}(4,\mathbb{F}_q)\cong\Omega(5,\mathbb{F}_q)$, and comment on those of higher-dimensional symplectic and orthogonal groups.

In this paper, we completely determine the irreducible characters of the four families of Suzuki $p$-groups.

In this paper we give new presentations of the braid groups and the pure braid groups of a closed surface. We also give an algorithm to solve the word problem in these groups, using the given presentations.

We show that the only sporadic simple group such that some of its faithful representations or some faithful representations of its stem extensions give rise to exceptional (weakly-exceptional but not exceptional, respectively) quotient…

We suggest a new algorithm for finding a canonical representative of a given braid, and also for the harder problem of finding a $\sigma_1$-consistent representative. We conjecture that the algorithm is quadratic-time. We present numerical…

We investigate the irreducible cuspidal $C$-representations of a reductive $p$-adic group $G$ over a field $C$ of characteristic different from $p$. When $C$ is algebraically closed, for many groups $G$, a list of cuspidal $C$-types…

Cuspidal representations of a reductive p-adic group G over a field of characteristic different from p are relatively injective and projective with respect to extensions that split by a U-equivariant linear map for any subgroup U that is…

Regularities in strings are often related to periods and covers, which have extensively been studied, and algorithms for their efficient computation have broad application. In this paper we concentrate on computing cyclic regularities of…

We describe an algorithm for computing Schur indices of irreducible characters of a finite group $G$, based on computations within $G$ and its subgroups and with their character tables. The algorithm has been implemented within \Magma\ and…