AdinkrasProgress and Problems

来源 :2015 Workshop on Combinatorics(2015组合论学术研讨会) | 被引量 : 0次 | 上传用户:houhx
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  Adinkras are graphical tools created for the study of representations in supersymmetry that turn out to contain many connections with graded posets,the Tutte polynomial,error-correcting codes,and other objects interesting for combinatorialists.In particular,there are many easy-to-state and seemingly accessible open problems.I will present some pleasant results for 1-D supersymmetry and more recent work-in-progress for 2-D supersymmetry,focusing on the combinatorics.In particular,no specialist physics knowledge is required.
其他文献
Synchronizing automata Definition:A(complete deterministic) automaton is synchronizing if there is a sequence of colors such that all the paths compatible with
会议
  In 1976 Cameron et al.showed that a connected graph with smallest eigenvalue at least-2 is either a generalized line graph or the number of vertices is boun
会议
Spherical t-design on Sn-1 Aninempty finite subset X≤Sn-1 is called a spherical t-design
会议
HOMOMORPHISMS STRUCTURAL RAMSEY THEORY LIMITS JAROSLAV NE(S)ET(R)IL CHARLES UNIVERSITY PRAGVE
会议
  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
会议
Contents Back ground and problem Probability model of range difference Fisher information Optimal ring formation of sensors Numerical result Conclusion
会议
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
会议
FINITE RAMSEY THCOREM FOR EVERY PARTITION THERE EXISTS SUCH THAT
会议
Qnis the n-cube.V(Qn) all binary n-tuples.Two vertices joined by an edge iffdiffer in precisely one coordinate.
会议
Based on joint works with Marianne Akian,LeRoy B.Beasley,Stephane Gaubert,Yaroslav Shitov
会议