## character degree in Gap

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

Let S be a finite set of integers, do I can check with Gap that this set be a set of character degrees of small group?

-

1
No one has mentioned yet: the order of the group must be a multiple of the LCM of the elements of S. – John Wiltshire-Gordon Oct 13 at 19:38

## 2 Answers

Dima is correct that the problem is much easier with multisets. Furthermore, taking direct products with Abelian groups, it is clear that for any given set of irreducible character degrees which actually occurs, there are infinitely many groups for which it occurs, if we allow multiplicities. I had a recollection that Isaacs and Passman proved a kind of converse of this: if a finite group $G$ has all its irreducible character degrees of degree less than $d,$ then $G$ has an Abelian normal subgroup $A$ whose index is bounded in terms of $d.$ I could not locate a reference at the time, though I did not have Isaacs' book to hand. Since my original post, however, Yemon Choi kindly provided a reference in the comments below (see MR0167539). The wording of Isaacs and Passman's result is perhaps mildly ambiguos: they speak of an Abelian subgroup of index bounded in terms of $d$, omitting the word "normal", but of course if $G$ has an Abelian subgroup $A$ with $[G:A] \leq h,$ then the intersection of the $G$-conjugates of $A$ is normal, and has index at most $h!$. Hence, in general, if we know the irreducible character degrees of a finite group $H,$ there is an Abelian normal subgroup $A$ of $H$ such that $|H/A|$ is bounded in terms of the largest degree. So in small cases, it may be possible to use GAP to determine all possibilities for $H/A.$

-

I am out of the office right now so cannot view it, but I think the result of Isaacs and Passman that you refer to is in their paper Groups with representations of bounded degree, Canad. J. Math. 16 (1964) 299--309. ams.org/mathscinet-getitem?mr=167539 – Yemon Choi Oct 13 at 23:58
Thanks, that figures- I put a date range in Mathscinet starting at 1965! – Geoff Robinson Oct 14 at 1:24

### You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.

You most probably mean "the set of degrees of irreducible characters". Indeed, given a finite set of integers, it should not be hard to construct a finite group that has irreducible characters of that degrees (and many more other degrees).

Still, for "the set of degrees" the problem does not look easy, as degrees can repeat, and you don't have a good way to control the order of the group $G$. For "the multiset of degrees" $d_1$,...,$d_t$ things are much better, as then $G$ has order equal to $\sum_{j=1}^t d_j^2$, and so you can just look through GAP's database of small groups for such a group.

-
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 22, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.950592577457428, "perplexity_flag": "head"}