Character degrees, character codegrees and nilpotence class of p-groups
- 9 September 2021
- journal article
- research article
- Published by Taylor & Francis in Communications in Algebra
- Vol. 50 (2) , 803-808
Abstract
Du and Lewis raised in 2016 the question of whether the nilpotence class of a p-group is bounded in terms of the number of character codegrees. In 2020, Croome and Lewis, gave a positive answer to this question for p-groups with four character codegree under some additional hypotheses related, for instance, to the number of character degrees of the group. In this note, we show that in general the nilpotence class of a p-group is bounded in terms of the number of character degrees and the number of character codegrees. In the case of four character codegrees, we extend some of the results of Croome and Lewis.Keywords
Funding Information
- Ministerio de Ciencia e Innovación (PID-2019-103854GB-100)
- CEIE, Generalitat Valenciana
- Ministerio de Ciencia e Innovaci?n
This publication has 12 references indexed in Scilit:
- ON ANALOGUES OF HUPPERT’S CONJECTUREBulletin of the Australian Mathematical Society, 2021
- p-groups with exactly four codegreesJournal of Group Theory, 2020
- Character Codegrees of Maximal Class -groupsCanadian Mathematical Bulletin, 2019
- Groups with few codegrees of irreducible charactersCommunications in Algebra, 2019
- The analog of Huppert's conjecture on character codegreesJournal of Algebra, 2017
- Codegrees and nilpotence class of p-groupsJournal of Group Theory, 2015
- Element orders and character codegreesArchiv der Mathematik, 2011
- A note on element orders and character codegreesArchiv der Mathematik, 2011
- Character Theory of Finite Groups2006
- Minimal characters of p-groupsJournal of Group Theory, 1999