Orbital Graphs
classification
🧮 math.GR
cs.SCmath.CO
keywords
graphsgroupsorbitalalgorithmsbasicdiscussfindingfocus
read the original abstract
We introduce orbital graphs and discuss some of their basic properties. Then we focus on their usefulness for search algorithms for permutation groups, including finding the intersection of groups and the stabilizer of sets in a group.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.