Dual Ore's theorem on distributive intervals of finite groups
Sebastien Palcoux

TL;DR
This paper presents a self-contained group-theoretic proof of a dual Ore's theorem, establishing a link between combinatorics and representation theory in finite groups.
Contribution
It introduces a new dual version of Ore's theorem and provides a self-contained proof connecting combinatorics and finite group representations.
Findings
Established a dual Ore's theorem for distributive intervals
Connected combinatorial properties with representation theory in finite groups
Provided a self-contained proof enhancing understanding of group intervals
Abstract
This paper gives a self-contained group-theoretic proof of a dual version of a theorem of Ore on distributive intervals of finite groups. We deduce a bridge between combinatorics and representations in finite group theory.
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.
