All Questions

For $S\subset [n]:=\{1,2,\dotsc,n\}$, define $\delta(S)$ to be the number of $m\in S$ such that $m+1\notin S$. Let $\pi$ be a permutation of $[n]$. For simplicity, assume that $\pi$ is an $n$-cycle. ...

I would like to implement a form of consistent hashing using a set of permutations. The rules are as follows: I have Y=~32 buckets and X items. Buckets may be "alive" or "dead". Items are to be ...

I have been studying a polynomial-size set of permutations from one of my lectures. The below image, taken from the lecture notes PDF, illustrates how to construct min-3-wise permutations. My ...