Non-nudgable subgroups of permutations (Q1674877): Difference between revisions

The author, motivated by a problem from behavioral economics, define the non-nudgable subgroups of permutation groups \(S_n\) that have a certain strong symmetry. In the present paper, the author proves that the following subgroups of \(S_n\) are non-nudgable (i) the full group \(S_n\), (ii) the alternating group \(A_n\) if \(\left \lfloor{\frac{n}{2}} \right \rfloor\) is even, (iii) the dihedral group \(D_n\), generated by \(w_0\) and the cycle \((12\cdots n)\), where \[ w_0=\begin{pmatrix} 1 & 2 & \cdots & n\\ n & n-1 & \cdots & 1 \end{pmatrix} \in S_n. \]