TJHSST Senior Research Project Investigation of Minimal Conjugate Generators for the Symmet.pdfVIP

TJHSST Senior Research Project Investigation of Minimal Conjugate Generators for the Symmet.pdf

  1. 1、本文档共4页,可阅读全部内容。
  2. 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  5. 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  6. 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  7. 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  8. 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
TJHSST Senior Research Project Investigation of Minimal Conjugate Generators for the Symmet

TJHSST Senior Research Project Investigation of Minimal Conjugate Generators for the Symmetric Group and their Cayley Graphs 2007-2008 Jacob Steinhardt September 7, 2007 Abstract We investigate subsets of the symmetric group with structure similar to that of a graph. The “trees” of these subsets then lead to minimal highly symmetric generating sets of the symmetric group. We show that there exist generating sets among these with edge-transitive Cayley graphs and investigate them in relation to the Lovasz conjecture. Keywords: Cayley graph, Lovasz conjecture, Hamiltonian cycle, conjugate generators, sym- metric group, quasi-hamiltonicity. 1 Introduction - Purpose and Scope Note that a graph can be defined as a collection of vertices and edges. Two vertices are adjacent if there exists an edge connecting them, and two vertices v1 and v2 are connected if there exists a sequence of adjacent vertices containing v and v . On the other hand, consider the following 1 2 definition: Given a collection of vertices V and a collection of edges E , we can let each element of E act on V as a transposition swapping the two vertices on which E is incident. If we then let multiplication in E extend through the definitions of a group action, E generates a subgroup of the symmetric group acting on V (we denote this subgroup as E ). Then we say that v1 and v2 are adjacent if (v v ) ∈ E , and that v and v are connected if (v v ) ∈ E . Additionally, connected 1 2 1

文档评论(0)

yaobanwd + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档