Computing character tables and Cartan matrices of finite monoids with fixed point counting - Graphes, Algorithmes et Combinatoire Access content directly
Preprints, Working Papers, ... Year : 2023

Computing character tables and Cartan matrices of finite monoids with fixed point counting

Abstract

In this paper we present an algorithm for e ciently counting xed points in a nite monoid M under a conjugacy-like action. We then prove a formula for the character table of M in terms of xed points and radical, which allows for the e ective computation of the character table of M over a eld of null characteristic, as well as its Cartan matrix, using a formula from [Thiéry '12], again in terms of xed points. We discuss the implementation details of the resulting algorithms and provide benchmarks of their performances.
Fichier principal
Vignette du fichier
main.pdf (1.04 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
licence : CC BY - Attribution

Dates and versions

hal-04258708 , version 1 (25-10-2023)

Identifiers

Cite

Balthazar Charles. Computing character tables and Cartan matrices of finite monoids with fixed point counting. 2023. ⟨hal-04258708⟩
30 View
7 Download

Altmetric

Share

Gmail Facebook X LinkedIn More