### Abstract

A family of permutations in S _{n} is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Efficient constructions of k-wise independent permutations are known for k = 2 and k = 3, but are unknown for k ≥ 4. In fact, it is known that there are no nontrivial subgroups of S _{n} for n ≥ 25 which are 4-wise independent. Faced with this adversity, research has turned towards constructing almost k-wise independent families, where small errors are allowed. Optimal constructions of almost k-wise independent families of permutations were achieved by several authors. Our first result is that any such family with small enough error is statistically close to a distribution which is perfectly k-wise independent. This allows for a simplified analysis of algorithms: an algorithm which uses randomized permutations can be analyzed assuming perfect k-wise independence, and then applied to an almost k-wise independent family. In particular, it allows for an oblivious derandomization of two-sided randomized algorithms which work correctly given any k-wise independent distribution of permutations. Another model is that of weighted families of permutations, or equivalently distributions of small support. We establish two results in this model. First, we show that a small random set of n ^{O(k)} permutations w.h.p supports a k-wise independent distribution. We then derandomize this by showing that any almost 2k-wise independent family supports a k-wise independent distribution. This allows for oblivious derandomization of algorithms for search problems which work correctly given perfect k-wise independent distributions. These results are all in fact special cases of a general framework where a group acts on a set. In the aforementioned case, the group of permutations acts on tuples of k elements. We prove all the above results in the general setting of the action of a finite group on a finite set.

Original language | English (US) |
---|---|

Title of host publication | Approximation, Randomization, and Combinatorial Optimization |

Subtitle of host publication | Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Proceedings |

Pages | 350-361 |

Number of pages | 12 |

DOIs | |

State | Published - Aug 28 2012 |

Externally published | Yes |

Event | 15th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2012 and the 16th International Workshop on Randomization and Computation, RANDOM 2012 - Cambridge, MA, United States Duration: Aug 15 2012 → Aug 17 2012 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 7408 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 15th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2012 and the 16th International Workshop on Randomization and Computation, RANDOM 2012 |
---|---|

Country | United States |

City | Cambridge, MA |

Period | 8/15/12 → 8/17/12 |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions'. Together they form a unique fingerprint.

## Cite this

*Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Proceedings*(pp. 350-361). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7408 LNCS). https://doi.org/10.1007/978-3-642-32512-0_30