Some solvable character degree sets
| Autor: | Kamal Aziziheris, Mohammad Hosein Salmani Yengejeh |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Discrete mathematics
Algebra and Number Theory Degree (graph theory) Coprime integers 010102 general mathematics 010103 numerical & computational mathematics 01 natural sciences Combinatorics Set (abstract data type) Character (mathematics) Almost simple group Solvable group 0101 mathematics Mathematics |
| Zdroj: | Communications in Algebra. 45:4283-4291 |
| ISSN: | 1532-4125 0092-7872 |
| Popis: | A set of positive integers Ω containing 1 is called a solvable character degree set if all groups G satisfying cd(G) = Ω are solvable groups, where cd(G) is the set of all irreducible character degrees of G. In this paper, we find solvable character degree subsets of the set Ω = {1,a,b,c,d,ac,ad,bc,bd}, where a,b,c, and d are pairwise relatively prime integers, and we show a character degree subset Φ⊆Ω is a solvable character degree set if {2f−1,2f}⊈Φ for all f≥2. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|