RPSes are special kinds of directed graphs, and graph theory is not my strong point, but here's a thought I had: construct a degree-pq (p,q odd) RPS as follows: make q cliques of p nodes and connect them with a degree-p RPS. Then make connections among the q cliques according to a degree-q RPS. Now do the same swapping p and q. Can we say anything interesting about the two RPSes? (I think they have to be distinct. The degree-15 RPSes might be interesting examples because 3 and 5 only have 1 possible clique-shape.)
![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png){kind=small}
no subject
Date: 2011-01-23 05:37 am (UTC)