Re: [math-fun] Sizing permutation graphs (Leo Broukhis)

At what point the diameter will be O(sqrt(N)), O(log(N))? Less than O(log(N))?

--Using my argument last post: None of those things are ever going to happen if your set of primitive moves, is of cardinality <=polynomial(N). [Incidentally my argument last post was slightly wrong. But correct for most practical purposes.]