Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the lattice of subracks of the rack of a finite group

Published 4 Dec 2015 in math.CO, math.GR, and math.QA | (1512.01459v1)

Abstract: In this paper we initiate the study of racks from the combined perspective of combinatorics and finite group theory. A rack R is a set with a self-distributive binary operation. We study the combinatorics of the partially ordered set {\cal R}(R) of all subracks of R with inclusion as the order relation. Groups G with the conjugation operation provide an important class of racks. For the case R = G we show that -> the order complex of {\cal R}(R) has the homotopy type of a sphere, -> the isomorphism type of {\cal R}(R) determines if G is abelian, nilpotent, supersolvable, solvable or simple, -> {\cal R}(R) is graded if and only if G is abelian, G = S_3, G = D_8 or G = Q_8. In addition, we provide some examples of subracks R of a group G for which {\cal R}(R) relates to well studied combinatorial structures. In particular, the examples show that the order complex of {\cal R}(R) for general R is more complicated than in the case R = G.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.