Computing derangement probabilities of the symmetric group acting on k-sets
classification
🧮 math.CO
keywords
inftycomputinggroupsymmetricvaluesactingalgorithmcameron
read the original abstract
Let $i(\infty,k)$ be the limiting proportion, as $n \rightarrow \infty$, of permutations in the symmetric group of degree $n$ that fix a $k$-set. We give an algorithm for computing $i(\infty,k)$ and state the values of $i(\infty,k)$ for $k \le 30$. These values are consistent with a conjecture of Peter Cameron that $i(\infty,k)$ is a decreasing function of $k$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.