This repository was archived by the owner on Jul 24, 2024. It is now read-only.
feat(combinatorics.quiver): Schreier and Cayley graphs#18693
Draft
feat(combinatorics.quiver): Schreier and Cayley graphs#18693
Conversation
Co-authored-by: Yaël Dillies <[email protected]>
Co-authored-by: Yaël Dillies <[email protected]>
|
This PR/issue depends on: |
5 tasks
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
A tentative definition of Schreier graphs of groups acting on sets and Cayley graphs as a special case.
More precisely:
action_graphis the quiver obtained by an action of a group and a choice of letters.schreier_graphis the action graph of a group acting on its cosets for a subgroupcayley_graphis the schreier graph for the trivial subgroupMore important than just the graphs are the labellings of the arrows, defined as quiver morphism to the single object quiver of letters.
It is then shown that:
orbit_stabilizer_covering_isoessentially shows that the restriction of anaction_graphto the orbit of a vertexs is isomorphic to the Schreier graph given by the stabilizer of the vertex.Thus, transitive
action_graphs are just Schreier graphsas_automlemmas.exists_as_automandas_autom_eq_iff).It's in a messy state, in great part because: