Generating pseudo-random permutations and maximum flow algorithms
Information Processing Letters
Journal of Combinatorial Theory Series A
The solution of a conjecture of Stanley and Wilf for all layered patterns
Journal of Combinatorial Theory Series A
On the number of permutations avoiding a given pattern
Journal of Combinatorial Theory Series A
Well-Spaced Labelings of Points in Rectangular Grids
SIAM Journal on Discrete Mathematics
The distributions of the entries of Young tableaux
Journal of Combinatorial Theory Series A
Quasi-random graphs with given degree sequences
Random Structures & Algorithms
Property testing and parameter testing for permutations
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Testing permutation properties through subpermutations
Theoretical Computer Science
A note on permutation regularity
Discrete Applied Mathematics
Limits of permutation sequences
Journal of Combinatorial Theory Series B
| Hi-index | 0.00 |
Chung and Graham (J. Combin. Theory Ser. A 61 (1992) 64) define quasirandom subsets of Zn to be those with any one of a large collection of equivalent random-like properties. We weaken their definition and call a subset of Zn ε-balanced if its discrepancy on each interval is bounded by εn. A quasirandom permutation, then, is one which maps each interval to a highly balanced set. In the spirit of previous studies of quasirandomness, we exhibit several random-like properties which are equivalent to this one, including the property of containing (approximately) the expected number of subsequences of each order-type. We present a construction for a family of strongly quasirandom permutations, and prove that this construction is essentially optimal, using a result of Schmidt on the discrepancy of sequences of real numbers.