Ask Your Question

Revision history [back]

click to hide/show revision 1
initial version

Action of symmetric group

Hello,

I am trying to understand of to use group action in sagemath, more specifically the action of symmetric group of size n, in order to count the number of isomorphism classes of simple undirected graphs. They are given by a symmetric unimodal sequence where the elements a_k are given by $a_k = \mathfrack{S}_n \backslash S_k(S_2(V))$, with V the set of vertices and S-k(V) the set of k-element submultiset of V. I have an algorithm that gives me the size of S_2(V) and S_k(S_2(V)) but I'm struggling with how to obtain $\mathfrack{S}_n \backslash S_k(S_2(V))$. Any help welcome ! For more information about it I can send you my paper that contains more definitions, exemples and proofs. Thank you very much !

Action of symmetric group

Hello,

I am trying to understand of to use group action in sagemath, more specifically the action of symmetric group of size n, in order to count the number of isomorphism classes of simple undirected graphs. They are given by a symmetric unimodal sequence where the elements a_k are given by $a_k = \mathfrack{S}_n \backslash S_k(S_2(V))$, with V the set of vertices and S-k(V) the set of k-element submultiset of V. I have an algorithm that gives me the size of S_2(V) and S_k(S_2(V)) but I'm struggling with how to obtain $\mathfrack{S}_n \backslash S_k(S_2(V))$. Any help welcome ! For more information about it I can send you my paper that contains more definitions, exemples and proofs. Thank you very much !

click to hide/show revision 3
None

Action of symmetric group

Hello,

I am trying to understand of to use group action in sagemath, more specifically the action of symmetric group of size n, in order to count the number of isomorphism classes of simple undirected graphs. They are given by a symmetric unimodal sequence where the elements a_k are given by $a_k $$a_k = \mathfrack{S}_n \mathfrak{S}_n \backslash S_k(S_2(V))$, S_k(S_2(V))\ ,$$ with V $V$ the set of vertices and S-k(V) $S_k(V)$ the set of k-element $k$-element submultiset of V. $V$.

I have an algorithm that gives me the size of S_2(V) $S_2(V)$ and S_k(S_2(V)) $S_k(S_2(V))$ but I'm struggling with how to obtain $\mathfrack{S}_n $\mathfrak{S}_n \backslash S_k(S_2(V))$. S_k(S_2(V))$.

Any help welcome ! For more information about it I can send you my paper that contains more definitions, exemples examples and proofs. Thank you very much !