Return to search

一個環狀排列的公式 / A Formula for Calculating Circular Permutations

這篇論文的目的,是要詳細解釋用波利亞計數方法來求解環狀排列問
題的基本原理。為了達到這個目的,一開始對循環群的概念做了介紹。
其次是伯恩賽定理的說明。接下來闡述波利亞計數方法的細節,最後
藉由波利亞計數定理,設法建立一個可計算任何環狀排列問題的公式,
並舉出實例,以顯示其實用價值。 / The purpose of this thesis is to explain the basic principle of the circular permutations using the Pólya's enumeration method. Firstly , we introduce the concepts of the cyclic groups. Secondly , we illustrate the Burnside theorem , and then elaborate the Pólya's enumeration method. Finally , we establish a formula that can calculate any type of the circular permutations by the Pólya's enumeration method. And we also give several examples to reveal the results.

Identiferoai:union.ndltd.org:CHENGCHI/G0099972001
Creators孫航同
Publisher國立政治大學
Source SetsNational Chengchi University Libraries
Language中文
Detected LanguageEnglish
Typetext
RightsCopyright © nccu library on behalf of the copyright holders

Page generated in 0.0017 seconds