Inducing $\pi$-partial characters with a given vertex
Mark L. Lewis

TL;DR
This paper investigates the induction of $pi$-partial characters in solvable groups, establishing bounds on the number of Brauer characters with a given vertex under specific group order conditions.
Contribution
It provides a new bound on the number of Brauer characters inducing a given character with a specified vertex in solvable groups, under conditions on the group order and prime.
Findings
Bound on the number of Brauer characters with a given vertex
Applicable when group order is odd or prime is 2
Generalizes previous results in character theory
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 .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · semigroups and automata theory · Advanced Algebra and Logic
