A sieve formula for chains of $p$-subgroups
Elias Schwesig

TL;DR
This paper introduces a sieve formula for chains of p-subgroups in finite groups, generalizing Sylow-Frobenius theorem and inspired by set theory sieve concepts.
Contribution
It establishes a new congruence involving chains of p-subgroups, extending classical results with a novel approach based on Wielandt's methods.
Findings
Derived a congruence involving p-subgroup chains
Generalized Sylow-Frobenius theorem
Connected sieve formula to set theory concepts
Abstract
Given a finite group and a prime , we establish the sieve formula, which is a congruence containing as summands numbers of chains of -subgroups of of certain orders. This generalises the Theorem of Sylow-Frobenius, using Wielandt's approach. Its name stems from the sieve formula from set theory because of formal similarities.
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
TopicsGraph theory and applications · Limits and Structures in Graph Theory · Advanced Algebra and Geometry
