Regular dessins with nilpotent automorphism groups

来源 :2015 Workshop on Combinatorics(2015组合论学术研讨会) | 被引量 : 0次 | 上传用户：or4108432566

【摘要】

：

What is a dessin?Map an embedding i:Г→ C of a connected graph Г,possibly with multiple edges and loops,into anorientable closed surface C,such that eachcompo

【作者】

：

Hu Kan

【机构】

：

ZhejiangOceanUniversity

【出处】

：

2015 Workshop on Combinatorics(2015组合论学术研讨会)

【发表日期】

：

2015年5期

下载到本地 , 更方便阅读

下载此文赞助VIP

声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架

论文部分内容阅读

What is a dessin?Map an embedding i:Г→ C of a connected graph Г,possibly with multiple edges and loops,into anorientable closed surface C,such that eachcomponent of Ci(Г) is homeomorphic to an open disc.

其他文献

On tight spherical harmonic 38.43-designs

Spherical t-design on Sn-1 Aninempty finite subset X≤Sn-1 is called a spherical t-design

会议

HOMOMORPHISMS STRUCTURAL RAMSEY THEORY LIMITS

HOMOMORPHISMS STRUCTURAL RAMSEY THEORY LIMITS JAROSLAV NE(S)ET(R)IL CHARLES UNIVERSITY PRAGVE

会议

Lines in Metric Spaces and Hypergraphs

　　A classic theorem of Euclidean geometry,often attributed as a De Bruijn-Erd?s theorem,asserts that any noncollinear set of n points in the plane determines

会议

Optimal Formation of Sensors for Statistical Target Tracking

Contents Back ground and problem Probability model of range difference Fisher information Optimal ring formation of sensors Numerical result Conclusion

会议

Zeta functions for two-dimensional shifts of finite type

Jung-Chao Ban,Wen-Guei Hu,Song-Sun Lin and Yin-Heng Lin,Zeta functions for two-dimensional shifts of finite type,Memoirs of the American Mathematical Society,Vo

会议

RAMSEY CLASSES OF GRAPHS AND BEYOND

FINITE RAMSEY THCOREM FOR EVERY PARTITION THERE EXISTS SUCH THAT

会议

Maximum density of copies of a graph in the n-cube

Qnis the n-cube.V(Qn) all binary n-tuples.Two vertices joined by an edge iffdiffer in precisely one coordinate.

会议

Tropical Rank and Beyond

Based on joint works with Marianne Akian,LeRoy B.Beasley,Stephane Gaubert,Yaroslav Shitov

会议

AdinkrasProgress and Problems

　　Adinkras are graphical tools created for the study of representations in supersymmetry that turn out to contain many connections with graded posets,the Tutt

会议

Complex spherical codes and linear programming bounds

Spherical designs and codes on complex unit sphere,by Roy and S.(2014) Journal of Combin.Des.with a connection to association schemes.

会议

Regular dessins with nilpotent automorphism groups

其他学术论文