{"paper":{"title":"Inducing $\\pi$-partial characters with a given vertex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Mark L. Lewis","submitted_at":"2010-08-10T05:11:10Z","abstract_excerpt":"Let $G$ be a solvable group. Let $p$ be a prime and let $Q$ be a $p$-subgroup of a subgroup $V$. Suppose $\\phi \\in \\ibr G$. If either $|G|$ is odd or $p = 2$, we prove that the number of Brauer characters of $H$ inducing $\\phi$ with vertex $Q$ is at most $|\\norm GQ: \\norm VQ|$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1633","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}