Haar graphical representations of finite groups and an application to poset representations
Joy Morris, Pablo Spiga

TL;DR
This paper classifies finite groups that can be represented by Haar graphs, showing all but a few small groups admit such representations, and applies this to improve classical results on group actions on posets and lattices.
Contribution
It provides a complete classification of finite groups with Haar graphical representations and enhances Babai's results on group representations on posets and distributive lattices.
Findings
Every finite group admits a Haar graphical representation except for abelian groups and ten small groups.
Haar graphs can be used to improve classical results on group actions on posets.
The work achieves the best possible results in representing groups on posets and lattices.
Abstract
Let be a group and let be a subset of . The Haar graph of with connection set is the graph having vertex set , where two distinct vertices and are declared to be adjacent if and only if . The name Haar graph was coined by Toma\v{z} Pisanski in one of the first investigations on this class of graphs. For every , the mapping , , is an automorphism of . In particular, the set is a subgroup of the automorphism group of isomorphic to . In the case that the automorphism group of equals , the Haar graph is said to be a Haar graphical representation of the group . Answering a…
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
TopicsAdvanced Topics in Algebra · Developmental and Educational Neuropsychology · Homotopy and Cohomology in Algebraic Topology
