Related papers: Two gluing methods for string C-group representati…

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.

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

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.

This paper introduces gluing diagrams a combinatorial tool to construct homomorphisms between the shift pseudogroups of directed graphs and thus also their full groups of shifts. We will establish which of these diagrams produce…

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 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 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.

We study the representations of the commutator subgroup of the braid group with n strands in the symmetric group of degree r. Motivated by some experimental results, we conjecture that for n>r, every such representation is trivial.

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…

In this paper, we define the notion of a virtually symmetric representation of representations of virtual braid groups and prove that many known representations are equivalent to virtually symmetric. Using one such representation, we define…

An important problem in the field of graph signal processing is developing appropriate overcomplete dictionaries for signals defined on different families of graphs. The Cayley graph of the symmetric group has natural applications in ranked…

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 consider for two based graphs $G$ and $H$ the sequence of graphs $G_k$ given by the wedge sum of $G$ and $k$ copies of $H$. These graphs have an action of the symmetric group $\Sigma_k$ by permuting the $H$-summands. We show that the…

This paper is devoted to the proof of a structural theorem, concerning certain homomorphic images of Artin braid group on $n$ strands in finite symmetric groups. It is shown that any one of these permutation groups is an extension of the…

In this article, given two finite simplicial graphs $\Gamma_1$ and $\Gamma_2$, we state and prove a complete description of the possible morphisms $C(\Gamma_1) \to C(\Gamma_2)$ between the right-angled Coxeter groups $C(\Gamma_1)$ and…

Let S be a principally embedded sl_2 subalgebra in sl_n for n > 2. A special case of results of the third author and Gregg Zuckerman implies that there exists a positive integer b(n) such that for any finite-dimensional irreducible sl_n…

We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…

We glue together two branched spheres by sewing of two Ramond (dual) two-fermion string vertices and present a rigorous analytic derivation of the closed expression for the four-fermion string vertex. This method treats all oscillator…

We describe how the chromatic symmetric function of two graphs glued at a single vertex can be expressed as a matrix multiplication using certain information of the two individual graphs. We then prove new $e$-positivity results by using a…