2011
DOI: 10.1016/j.jalgebra.2010.10.034
|View full text |Cite
|
Sign up to set email alerts
|

Character separation and principal covering

Abstract: We investigate the separation of irreducible characters by blocks at different primes and the covering of irreducible characters by blocks (viewed as sets of characters); these notions are used to prove results on the group structure. The covering of all characters of a group by principal blocks is only possible when already one principal block suffices or the generalized Fitting subgroup has a very special structure.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

1
2
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
2
2

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 17 publications
1
2
0
Order By: Relevance
“…At last, we also obtain some results about nilpotent properties of Frobenius corresponding blocks. These results partly answer some questions in paper [13] [14].…”
Section: Introductionsupporting
confidence: 77%
See 1 more Smart Citation
“…At last, we also obtain some results about nilpotent properties of Frobenius corresponding blocks. These results partly answer some questions in paper [13] [14].…”
Section: Introductionsupporting
confidence: 77%
“…The following result is related to their question. According to results in [15, X, Theorem 1.5, P416] and [14], we are going to prove the following result: Theorem 6.4. Let N G and G/N is solvable.…”
mentioning
confidence: 99%
“…For instance, Bessenrodt, Malle and Olsson [BMO06] introduced the concept of block separability of characters, and Navarro, Turull and Wolf [NTW05] discussed solvable groups that are block separated. In a series of papers, Bessenrodt and Zhang generally investigated block separations, inclusions and coverings of characters of a finite group, see [BZ08] and [BZ11]. Motivated by their work, we investigate block separations of characters from a graph-theoretical point of view.…”
Section: Introductionmentioning
confidence: 99%