Inducing $\pi$-partial characters with a given vertex
Group Theory
2010-08-11 v1
Abstract
Let be a solvable group. Let be a prime and let be a -subgroup of a subgroup . Suppose . If either is odd or , we prove that the number of Brauer characters of inducing with vertex is at most .
Cite
@article{arxiv.1008.1633,
title = {Inducing $\pi$-partial characters with a given vertex},
author = {Mark L. Lewis},
journal= {arXiv preprint arXiv:1008.1633},
year = {2010}
}