A pattern theorem for random sorting networks

Details A pattern theorem for random sorting networks A pattern theorem for random sorting networks

2011-10-02

arxiv.org/abs/1110.0160v1

Mathematics

Probability

21 pages, 9 figures

Scientific paper

A sorting network is a shortest path from 12..n to n..21 in the Cayley graph of the symmetric group S(n) generated by nearest-neighbor swaps. A pattern is a sequence of swaps that forms an initial segment of some sorting network. We prove that in a uniformly random n-element sorting network, any fixed pattern occurs in at least cn^2 disjoint space-time locations, with probability tending to 1 exponentially fast as n tends to infinity. Here c is a positive constant which depends on the choice of pattern. As a consequence, the probability that the uniformly random sorting network is geometrically realizable tends to 0.

Affiliated with

Also associated with

No associations

Rating

A pattern theorem for random sorting networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A pattern theorem for random sorting networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A pattern theorem for random sorting networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-283994