Computing character degrees via a Galois connection

DOI10.22108/IJGT.2015.6212zbMATH Open1456.20005OpenAlexW2096626685MaRDI QIDQ4965883FDOQ4965883

Authors: Mark L. Lewis, John K. McVey 

Publication date: 10 March 2021

Full work available at URL: https://ijgt.ui.ac.ir/article_6212_edb9e19829eb4a1d2264f3c3f26089ed.pdf

Recommendations

• Computing character degrees in p-groups
• On character degrees quotients
• On the character degree sums
• Degrees and fields of values of irreducible characters
• scientific article; zbMATH DE number 3995741
• On sums of degrees of irreducible characters
• Computing modular and projective character degrees of soluble groups
• scientific article; zbMATH DE number 569744
• scientific article; zbMATH DE number 4066963
• scientific article; zbMATH DE number 89738

zbMATH Keywords

latticefinite fieldGalois correspondencecharacter degree

Mathematics Subject Classification ID

Galois correspondences, closure operators (in relation to ordered sets) (06A15) Ordinary representations and characters (20C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On a Galois connection between the subfield lattice and the multiplicative subgroup lattice.
• Prime Divisibility Among Degrees of Solvable Groups
• Character degrees, class sizes, and normal subgroups of a certain class of \(p\)-groups

Cited In (1)

• On a Galois connection between the subfield lattice and the multiplicative subgroup lattice.

This page was built for publication: Computing character degrees via a Galois connection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4965883)