EUVIMEDEUVIMED entdecken
Crossref

Two gluing methods for string C-group representations of the symmetric groups

Dimitri Leemans, Jessica Mulpas

Combinatorial Theory · 20.04.2026 · 6 (1)

DOI: 10.5070/c66165700 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Combinatorial Theory, online erschienen am 20.04.2026. Verfasst von Dimitri Leemans und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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 rank $r\geq n/2$ for $S_n$, having a fracture graph and a non-perfect split. They conjecture that these graphs are permutation representation graphs of string C-groups. In trying to prove this conjecture, we discovered two new techniques to glue two CPR graphs for symmetric groups together. We discuss the cases in which they yield new CPR graphs. By doing so, we invalidate the conjecture of Cameron et al. We believe our gluing techniques will be useful in the study of string C-group representations of high ranks for the symmetric groups.

Zitieren

APA

Leemans, D., & Mulpas, J. (2026). Two gluing methods for string C-group representations of the symmetric groups. Combinatorial Theory, 6(1). https://doi.org/10.5070/c66165700

Vancouver

Leemans D, Mulpas J. Two gluing methods for string C-group representations of the symmetric groups. Combinatorial Theory. 2026;6(1). doi:10.5070/c66165700

BibTeX
@article{Leemans2026,
  author = {Leemans, Dimitri and Mulpas, Jessica},
  title = {Two gluing methods for string C-group representations of the symmetric groups},
  journal = {Combinatorial Theory},
  year = {2026},
  volume = {6},
  number = {1},
  doi = {10.5070/c66165700}
}
Kostenlos starten →