Add (has_)disjoint_automorphisms, petersen_graph, and clebsch_graph#5708
Merged
fingolfin merged 17 commits intooscar-system:masterfrom Feb 3, 2026
Merged
Add (has_)disjoint_automorphisms, petersen_graph, and clebsch_graph#5708fingolfin merged 17 commits intooscar-system:masterfrom
(has_)disjoint_automorphisms, petersen_graph, and clebsch_graph#5708fingolfin merged 17 commits intooscar-system:masterfrom
Conversation
Sequenzer
changed the title
disjoint_automorphism function as well as functions for petersen and clebsch graph.disjoint_automorphism function as well as functions for petersen_graph and clebsch_graph.
Sequenzer
added
topic: groups
release notes: use title
lgoettgens
reviewed
Jan 16, 2026
lgoettgens
changed the title
disjoint_automorphism function as well as functions for petersen_graph and clebsch_graph.disjoint_automorphism function as well as functions for petersen_graph and clebsch_graph
fingolfin
reviewed
Jan 16, 2026
fingolfin
reviewed
Jan 16, 2026
Collaborator
Author
|
I've implemented all the suggestions, but I've left the conversations for the less trivial comments open for you to respond in the case of me doing something wrong. |
Sequenzer
changed the title
disjoint_automorphism function as well as functions for petersen_graph and clebsch_graphdisjoint_automorphisms function as well as functions for petersen_graph,clebsch_graph and has_disjoint_automorphisms
lgoettgens
reviewed
Jan 19, 2026
Co-authored-by: Lars Göttgens <lars.goettgens@gmail.com>
benlorenz
reviewed
Jan 19, 2026
Co-authored-by: Benjamin Lorenz <benlorenz@users.noreply.github.com>
benlorenz
changed the title
disjoint_automorphisms function as well as functions for petersen_graph,clebsch_graph and has_disjoint_automorphisms(has_)disjoint_automorphisms, petersen_graph, and clebsch_graph
lgoettgens
reviewed
Jan 29, 2026
lgoettgens
changed the title
(has_)disjoint_automorphisms, petersen_graph, and clebsch_graph(has_)disjoint_automorphisms, petersen_graph, and clebsch_graph
fingolfin
reviewed
Jan 31, 2026
Co-authored-by: Max Horn <max@quendi.de>
fingolfin
reviewed
Feb 3, 2026
fingolfin
reviewed
Feb 3, 2026
fingolfin
approved these changes
Feb 3, 2026
fingolfin
changed the title
(has_)disjoint_automorphisms, petersen_graph, and clebsch_graph(has_)disjoint_automorphisms, petersen_graph, and clebsch_graph
benlorenz
referenced
this pull request
Feb 13, 2026
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 join this conversation on GitHub.
Already have an account?
Sign in to comment
4 participants
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.
Title.
Perhaps someone with more knowledge of groups has a better way of computing the disjoint automorphisms. My approach might be a little naive. So, I am open to suggestions. However, the current method should at least work.
I also added the Petersen graph (@danteluber) and the Clebsch graph, as these are good examples of how the function behaves.
FYI: Disjoint automorphisms are important for computing the quantum symmetries of graphs, as their existence is a sufficient but not necessary criterion for a graph to have quantum symmetries.