Orbital Graphs

03/13/2017
by   Paula Hähndel, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/15/2019

On Cayley graphs of basic algebraic structures

We present simple graph-theoretic characterizations of Cayley graphs for...
research
04/19/2021

A Practical Method for Constructing Equivariant Multilayer Perceptrons for Arbitrary Matrix Groups

Symmetries and equivariance are fundamental to the generalization of neu...
research
01/03/2018

Automorphism groups and Ramsey properties of sparse graphs

We study automorphism groups of sparse graphs from the viewpoint of topo...
research
12/16/2021

Differentially Describing Groups of Graphs

How does neural connectivity in autistic children differ from neural con...
research
04/24/2019

Normalizers and permutational isomorphisms in simply-exponential time

We show that normalizers and permutational isomorphisms of permutation g...
research
06/11/2022

Greedy Relaxations of the Sparsest Permutation Algorithm

There has been an increasing interest in methods that exploit permutatio...
research
03/30/2020

On the Weisfeiler-Leman Dimension of Finite Groups

In comparison to graphs, combinatorial methods for the isomorphism probl...

Please sign up or login with your details

Forgot password? Click here to reset