Separating characters by blocks

Research output: Contribution to journal › Article › Research › peer review

Authors

  • Christine Bessenrodt
  • Gunter Malle
  • Jørn B. Olsson

Research Organisations

External Research Organisations

  • University of Kaiserslautern
  • University of Copenhagen
View graph of relations

Details

Original languageEnglish
Pages (from-to)493-505
Number of pages13
JournalJournal of the London Mathematical Society
Volume73
Issue number2
Publication statusPublished - Apr 2006

Abstract

We investigate the problem of finding a set of prime divisors of the order of a finite group, such that no two irreducible characters are in the same p-block for all primes p in the set. Our main focus is on the simple and quasi-simple groups. For results on the alternating and symmetric groups and their double covers, some combinatorial results on the cores of partitions are proved, which may be of independent interest. We also study the problem for groups of Lie type. The sporadic groups (and their relatives) are checked using GAP.

ASJC Scopus subject areas

Cite this

Separating characters by blocks. / Bessenrodt, Christine; Malle, Gunter; Olsson, Jørn B.
In: Journal of the London Mathematical Society, Vol. 73, No. 2, 04.2006, p. 493-505.

Research output: Contribution to journal › Article › Research › peer review

Bessenrodt, C, Malle, G & Olsson, JB 2006, 'Separating characters by blocks', Journal of the London Mathematical Society, vol. 73, no. 2, pp. 493-505. https://doi.org/10.1112/S0024610705022556
Bessenrodt C, Malle G, Olsson JB. Separating characters by blocks. Journal of the London Mathematical Society. 2006 Apr;73(2):493-505. doi: 10.1112/S0024610705022556
Bessenrodt, Christine ; Malle, Gunter ; Olsson, Jørn B. / Separating characters by blocks. In: Journal of the London Mathematical Society. 2006 ; Vol. 73, No. 2. pp. 493-505.
Download
@article{32e2a3ca483c422482ca836ed24f26e5,
title = "Separating characters by blocks",
abstract = "We investigate the problem of finding a set of prime divisors of the order of a finite group, such that no two irreducible characters are in the same p-block for all primes p in the set. Our main focus is on the simple and quasi-simple groups. For results on the alternating and symmetric groups and their double covers, some combinatorial results on the cores of partitions are proved, which may be of independent interest. We also study the problem for groups of Lie type. The sporadic groups (and their relatives) are checked using GAP.",
author = "Christine Bessenrodt and Gunter Malle and Olsson, {J{\o}rn B.}",
year = "2006",
month = apr,
doi = "10.1112/S0024610705022556",
language = "English",
volume = "73",
pages = "493--505",
journal = "Journal of the London Mathematical Society",
issn = "0024-6107",
publisher = "John Wiley and Sons Ltd",
number = "2",

}

Download

TY - JOUR

T1 - Separating characters by blocks

AU - Bessenrodt, Christine

AU - Malle, Gunter

AU - Olsson, Jørn B.

PY - 2006/4

Y1 - 2006/4

N2 - We investigate the problem of finding a set of prime divisors of the order of a finite group, such that no two irreducible characters are in the same p-block for all primes p in the set. Our main focus is on the simple and quasi-simple groups. For results on the alternating and symmetric groups and their double covers, some combinatorial results on the cores of partitions are proved, which may be of independent interest. We also study the problem for groups of Lie type. The sporadic groups (and their relatives) are checked using GAP.

AB - We investigate the problem of finding a set of prime divisors of the order of a finite group, such that no two irreducible characters are in the same p-block for all primes p in the set. Our main focus is on the simple and quasi-simple groups. For results on the alternating and symmetric groups and their double covers, some combinatorial results on the cores of partitions are proved, which may be of independent interest. We also study the problem for groups of Lie type. The sporadic groups (and their relatives) are checked using GAP.

UR - http://www.scopus.com/inward/record.url?scp=33646353215&partnerID=8YFLogxK

U2 - 10.1112/S0024610705022556

DO - 10.1112/S0024610705022556

M3 - Article

AN - SCOPUS:33646353215

VL - 73

SP - 493

EP - 505

JO - Journal of the London Mathematical Society

JF - Journal of the London Mathematical Society

SN - 0024-6107

IS - 2

ER -