Consider a finite group acting linearly on a vector space. Each group element can be represented as a linear map whose graph is a subspace and the collection of these graphs gives a subspace arrangement. From an algebraic point of view, the vanishing ideal of the union of the subspaces can be used to find generators for the ring of polynomial invariants under the action of the group. Geometrically, we can also study the intersection lattice of the subspace arrangement, which can give cohomological information about the same ideal.
When one considers permutation actions, new combinatorial perspectives on this intersection lattice arise. In particular, for the regular action of the group on itself, the intersection lattice of the subspace arrangement is isomorphic to the coset poset, a known object of study in geometric and topological combinatorics. For other permutation actions, we establish that stabiliser subgroups of orbit partitions and their cosets can be used to label the vertices of the lattice. We then study these lattices with combinatorial techniques and computational tools to better understand the various algebraic structures associated with them.
