# Permutations with 0 or 1 fixed point in hyperoctahedral groups

 dc.contributor 林延輯 zh_TW dc.contributor.author 周鈺偵 zh_TW dc.contributor.author Chou, Yu-Jen en_US dc.date.accessioned 2019-09-05T01:05:06Z dc.date.available 2019-07-03 dc.date.available 2019-09-05T01:05:06Z dc.date.issued 2019 dc.description.abstract In this thesis, we extend the work of fixed points on the permutations of [n] in two directions: firstly, we discuss the fixed points problems of hyperoctahedral groups Bn; secondly, elements in Bn can be thought the letters are painted by two colors, it can be generalized with r colors. Moreover, we discuss the fixed point problems in the subsets alternating permutations of Bn and strictly decreasing permutations with r colors. After removing all fixed points and standardizing the remaining letters, we focus on colored permutations with 0 or 1 fixed point. We obtain combinatorial correspondence between derangements and elements with exactly one fixed point together with their recursions and generating functions. zh_TW dc.description.sponsorship 數學系 zh_TW dc.identifier G0505401113 dc.identifier.uri http://etds.lib.ntnu.edu.tw/cgi-bin/gs32/gsweb.cgi?o=dstdcdr&s=id=%22G0505401113%22.&%22.id.& dc.identifier.uri http://rportal.lib.ntnu.edu.tw:80/handle/20.500.12235/101500 dc.language 英文 dc.subject derangements zh_TW dc.subject hyperoctahedral groups zh_TW dc.subject alternating permutations zh_TW dc.subject colored permutations zh_TW dc.title Permutations with 0 or 1 fixed point in hyperoctahedral groups zh_TW dc.title Permutations with 0 or 1 fixed point in hyperoctahedral groups en_US

## Files

##### Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
050540111301.pdf
Size:
549.84 KB
Format: