How Can Orbits Depend on Each Other in Colored Graph Automorphisms?

  • Thread starter Thread starter matt42
  • Start date Start date
  • Tags Tags
    Orbits
matt42
Messages
1
Reaction score
0
Hi,
I'm struggling with the following:
I have a colored graph, and I used Bliss to find the generators group for the automorphisms. Finding the orbits given the generators is easy.
What I'm trying to find now is dependence between orbits - for each orbit I want to know if it still exist if I"ll stabilize the rest of the graph, and if not, which of the other orbits need to be "free" to move with it. For example, if the generators are (1 2 3), (3 4)(6 7) and (5 8 9) then I have the orbits: (1 2 3 4), (6 7) and (5 8 9), however, (1 2 3 4) and (6 7) have to move together (so they are dependent) and (5 8 9) can move by itself (independently of the others).

I tried searching in the computational group theory literature without success, but I may be missing some terminology here, any help will be appreciated.

Thanks!
 
Physics news on Phys.org
This sounds as if you were in need of possible decomposition series of the automorphism group, i.e. its structure. E.g. if it was simple, then it wouldn't have any normal subgroups, which I assume correspond to subsets of fixed elements, but I'm not sure. Anyway, I would go in this direction.
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Replies
2
Views
2K
Replies
5
Views
2K
Replies
3
Views
1K
Replies
2
Views
1K
Replies
28
Views
3K
Replies
2
Views
200
Replies
8
Views
590
Replies
1
Views
2K
Back
Top