Permutations with 0 or 1 fixed point in hyperoctahedral groups

dc.contributor林延輯zh_TW
dc.contributor.author周鈺偵zh_TW
dc.contributor.authorChou, Yu-Jenen_US
dc.date.accessioned2019-09-05T01:05:06Z
dc.date.available2019-07-03
dc.date.available2019-09-05T01:05:06Z
dc.date.issued2019
dc.description.abstractIn 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.identifierG0505401113
dc.identifier.urihttp://etds.lib.ntnu.edu.tw/cgi-bin/gs32/gsweb.cgi?o=dstdcdr&s=id=%22G0505401113%22.&%22.id.&
dc.identifier.urihttp://rportal.lib.ntnu.edu.tw:80/handle/20.500.12235/101500
dc.language英文
dc.subjectderangementszh_TW
dc.subjecthyperoctahedral groupszh_TW
dc.subjectalternating permutationszh_TW
dc.subjectcolored permutationszh_TW
dc.titlePermutations with 0 or 1 fixed point in hyperoctahedral groupszh_TW
dc.titlePermutations with 0 or 1 fixed point in hyperoctahedral groupsen_US

Files

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

Collections