Symmetric and Asymptotically Symmetric Permutations

Details Symmetric and Asymptotically Symmetric Permutations Symmetric and Asymptotically Symmetric Permutations

2008-01-28

arxiv.org/abs/0801.4181v1

Mathematics

Combinatorics

13 pages, 3 tables

Scientific paper

We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S \subset [n]$. First, is it possible for the pattern counts in a permutation to be exactly equal to their expected values under a uniform distribution? Attempts to address this question lead naturally to an interesting number theoretic problem: when does $k!$ divide $\binom{n}{k}$? Second, if the tensor product of a permutation with large random permutations is random-like in its pattern counts, what must the pattern counts of the original permutation be? A recursive formula is proved which uses a certain permutation ``contraction.''

Affiliated with

Also associated with

No associations

Rating

Symmetric and Asymptotically Symmetric Permutations 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 Symmetric and Asymptotically Symmetric Permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Symmetric and Asymptotically Symmetric Permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-156510