Orbits of a set $X$ under the action of cyclic permutation $T$

Question

Let $X$ be a set defined as $$X = \{\{\sigma_1, \dots, \sigma_L\} \;|\; \sigma_i = 0,\dots ,n-1\}.$$ Furthermore, let $T:X\longrightarrow X$ be a cyclic permutation $$ T\cdot\{\sigma_1, \dots, \sigma_L\} = \{\sigma_L, \sigma_1, \dots, \sigma_{L-1}\}, $$ generating a cyclic group $G=\{1, T, \dots, T^{L-1}\}$. I am interested in the set of orbits $O = X/G$ under this action. I.e. each element in $O$ is a subset of $X$, corresponding to elements that map into each other under $T$ (or in other words, each element of $O$ is of the form $G\cdot s$ for some $s\in X$).

Is there a fast and efficient way to compute the set of orbits $O$? Or even better, a representative of each orbit together with the orbit size?

Mathematica has the functions Orbits[pg,x] and OrbitRepresentatives[pg,x]. But I am not sure how to use these. Besides, they are part of the Combinatoria package but Mathematica does not like using this as part of the library are built into Mathematica now.

Answer 1

GroupOrbits[CyclicGroup[5], {{1, 1, 2, 3, 3}}, Permute]

 {{{1, 1, 2, 3, 3}, 
  {1, 2, 3, 3, 1}, 
  {2, 3, 3, 1, 1},
  {3, 1, 1, 2, 3}, 
  {3, 3, 1, 1, 2}}}

Answer 2

After some clarification I think an orbit in the sense explained above can be found by repeating a right or left rotation n-1 times where n is the length of the list. This may produce identical lists (e.g. {1,2,1,2} shifted twice), therefore, we must weed out the duplicates, what can be done by DeleteDuplicates:

n = 5;
DeleteDuplicates[NestList[RotateRight, {1, 1, 2, 3, 3}, n - 1]]

(*  {{1, 1, 2, 3, 3}, {3, 1, 1, 2, 3}, {3, 3, 1, 1, 2}, {2, 3, 3, 1, 
  1}, {1, 2, 3, 3, 1}} *)