Responsive image
博碩士論文 etd-0619106-170029 詳細資訊
Title page for etd-0619106-170029
論文名稱
Title
群作用的辨識標號
Distinguishing sets of the actions of S_5
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
95
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2006-06-16
繳交日期
Date of Submission
2006-06-19
關鍵字
Keywords
群作用、可辨識標號、辨識數
group action, distinguishing number, distinguishing set
統計
Statistics
本論文已被瀏覽 5762 次,被下載 1532
The thesis/dissertation has been browsed 5762 times, has been downloaded 1532 times.
中文摘要
假設Gamma是一個群,作用在一個集合X上。又假設phi:X 送到 {1, 2, ..., r}是一個對集合X的一個r-標號。若對任意的sigma 屬於 Gamma, sigma 不等於 id_X ,存在一個x在X裡,使得phi(x)不等於phi(sigma(x)),我們稱phi為該群作用的一個可辨識標號。若r是該群作用存在一個可辨識r-標號的最小正整數,則稱r為該群作用的『辨識數』, 記為D_{Gamma}(X)。
當給定一個圖G,G的辨識數D(G)定義成D(G) = D_{Aut(G)}(V(G))。
令S_5表示5-階對稱群。這篇論文討論S_5作用在一個集合上的辨識數。我們確定出所有S_5作用的辨識數。同時,我們也確定出所有Aut(G)=S_5的圖形G的可能的辨識數。所得到的結論證實了Albertson和Collins的一個猜測。
Abstract
Suppose Gamma is a group acting on a set X. An r-labeling phi: X to {1, 2, ..., r} of X is distinguishing (with respect to the action of Gamma) if for any sigma in Gamma, sigma not equal id_X, there exists an element x in X such that phi(x) not equal phi(sigma(x)). The distinguishing number, D_{Gamma}(X), of the action of Gamma on X is the minimum r for which there is an r-labeling which is distinguishing. Given a graph G, the distinguishing number of G, D(G),is defined as D(G) = D_{Aut(G)}(V(G)). This thesis determines the distinguishing numbers of all actions of S_5. As a consequence, we
determine all the possible values of the distinguishing numbers of graphs G with Aut(G)=S_5, confirming a conjecture of Albertson and Collins.
目次 Table of Contents
1 Introduction 5
2 Definitions 8
3 Some useful lemmas 11
4 Actions of S5 with a single orbit 15
5 Actions with more than one orbit 32
6 Graphs G with Aut(G) = S5 40
7 Appendix: Figures illustrating the actions of S5 with one orbit 41
7.1 S5, (S5 : C5) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41
7.2 (S5, (S5 : D4)) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61
7.3 (S5, (S5 : D5)) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71
7.4 (S5, (S5 : D6)) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 81
7.5 (S5, (S5 : K)) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87
References 91
List of Figures
1 The possible orbits of actions of S5 . . . . . . . . . . . . . . . . . 15
2 Symmetry . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23
3 A label-preserving permutation . . . . . . . . . . . . . . . . . . . 24
4 A label-preserving permutation . . . . . . . . . . . . . . . . . . . 24
5 Symmetry . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25
6 Symmetry . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25
7 Symmetry . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
8 A label-preserving permutation . . . . . . . . . . . . . . . . . . . 26
9 A label-preserving permutation . . . . . . . . . . . . . . . . . . . 27
10 A label-preserving permutation . . . . . . . . . . . . . . . . . . . 27
11 Ten permutation of the remaining five cosets . . . . . . . . . . . . 30
12 Three permutation of the remaining four cosets . . . . . . . . . . 30
13 The distinguishing number of all the subgroups of S5 . . . . . . . 31
參考文獻 References
[1] M. O. Albertson and K. L. Collins, Symmetry breaking in graphs, Electron.
J. Combin. 3 (1996) #R18, 17pp.
[2] M. O. Albertson and K. L. Collins, An introduction to symmetry breaking in
graphs, Graph Theory Notes N. Y. 30 (1996), 6–7.
[3] B. Bogstad and L. J. Cowen, The distinguishing number of the hypercube,
Discrete Math. 283 (2004) 29–35.
[4] P. J. Cameron, Permutation groups, Handbook of Combinatorics, Edited
by R. Graham, M. Gr¨otschel and L. Lov´asz, 1995 Elsevier Science B.V.,
612-645.
[5] M. Chan, The maximum distinguishing number of a group, manuscript, September
2004.
[6] K. L. Collins, Symmetry breaking in graphs, Talk at the DIMACS Workshop
on Discrete Mathematical Chemistry, DIMACS, Rutgers University, March
23-25, 1998.
[7] S. Klavˇzar, T. Wong and X. Zhu, Distinguishing labelings of group action on
vector spaces and graphs, manuscript, 2005.
[8] S. Klavˇzar and X. Zhu, Cartesian powers of graphs can be distinguished with
two labels, manuscript, 2005.
[9] F. Rubin, Problem 729 in Journal of Recreational Mathematics, Vol. 11
(1979), 128.
[10] A. Russell and R. Sundaram, A note on the asymptotics and computational
complexity of graph distinguishability, Electron. J. Combin. 5 (1998) #R23,
7pp.
[11] J. Tymoczko, Distinguishing numbers for graphs and groups, Electron. J.
Combin. 11 (2004) #R63, 13pp.
[12] T. Wong and X. Zhu, Distinguishing labelings of the actions of symmetric
group, manuscript, 2005.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內立即公開,校外一年後公開 off campus withheld
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus: 已公開 available


紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code