Non-nudgable subgroups of permutations

DOI10.1007/S00013-017-1086-4MaRDI QIDQ1674877zbMATH OpenOpenAlexWikidataFDO

Authors Tim Netzer

Publication date 26 October 2017

Published in Archiv der Mathematik (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1706.06929

zbMATH Keywords

inversionnudgingpermutation groups

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Symmetric groups (20B30) Subgroups of symmetric groups (20B35)

Abstract: Motivated by a problem from behavioral economics, we study subgroups of permutation groups that have a certain strong symmetry. Given a fixed permutation, consider the set of all permutations with disjoint inversion sets. The group is called non-nudgable, if the cardinality of this set always remains the same when replacing the initial permutation with its inverse. It is called nudgable otherwise. We show that all full permutation groups, standard dihedral groups, half of the alternating groups, and any abelian subgroup are non-nudgable. In the right probabilistic sense, it is thus quite likely that a randomly generated subgroup is non-nudgable. However, the other half of the alternating groups are nudgable. We also construct a smallest possible nudgable group, a 6-element subgroup of the permutation group on 4 elements.

Review text

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. \]

Recommendations

• scientific article; zbMATH DE number 20334
• scientific article; zbMATH DE number 5073440
• Generating Symmetric Groups
• Some subgroups of symmetric groups determined using signed Brauer diagrams
• On the existence of \(G\)-permutable subgroups in alternating groups

Cites work

• Eliciting welfare preferences from behavioural data sets
• scientific article; zbMATH DE number 854561 (Why is no real title available?)
• scientific article; zbMATH DE number 894528 (Why is no real title available?)
• The probability of generating the symmetric group

This page was built for publication: Non-nudgable subgroups of permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1674877)