2002
DOI: 10.1090/s0002-9947-02-02992-6
|View full text |Cite
|
Sign up to set email alerts
|

Character degrees and nilpotence class of finite 𝑝-groups: An approach via pro-𝑝 groups

Abstract: Abstract. Let S be a finite set of powers of p containing 1. It is known that for some choices of S, if P is a finite p-group whose set of character degrees is S, then the nilpotence class of P is bounded by some integer that depends on S, while for some other choices of S such an integer does not exist. The sets of the first type are called class bounding sets. The problem of determining the class bounding sets has been studied in several papers whose results made it tempting to conjecture that a set S is cla… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2003
2003
2024
2024

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 23 publications
0
6
0
Order By: Relevance
“…All the class bounding sets S found in that paper have the property that p ∈ S. In [19] Isaacs and Slattery prove that this a necessary condition for a set S to be class bounding. However, an example constructed in [20] shows that this is not a sufficient condition. In [20] Jaikin-Zapirain and the author also find more class bounding sets.…”
Section: Bounding the Derived Length And The Nilpotence Classmentioning
confidence: 98%
See 2 more Smart Citations
“…All the class bounding sets S found in that paper have the property that p ∈ S. In [19] Isaacs and Slattery prove that this a necessary condition for a set S to be class bounding. However, an example constructed in [20] shows that this is not a sufficient condition. In [20] Jaikin-Zapirain and the author also find more class bounding sets.…”
Section: Bounding the Derived Length And The Nilpotence Classmentioning
confidence: 98%
“…However, an example constructed in [20] shows that this is not a sufficient condition. In [20] Jaikin-Zapirain and the author also find more class bounding sets. We refer the reader to [16,19] and [20] for the detailed results and to [20] for some specific questions related to this problem.…”
Section: Bounding the Derived Length And The Nilpotence Classmentioning
confidence: 98%
See 1 more Smart Citation
“…In fact, there has been some research on which sets of character degrees bound the nilpotence class of a p-group. (See [11,12] and [13]. )…”
Section: Theorem a The Group G Is Flat If And Only If It Is A Gvz-grmentioning
confidence: 99%
“…In fact, there has been some research on which sets of character degrees bound the nilpotence class of a p-group. (See [12], [13], and [14]. )…”
Section: Theorem a A Group G Is A Gvz-group If And Only If G Is Flatmentioning
confidence: 99%