论文部分内容阅读
Spherical designs and codes on complex unit sphere,by Roy and S.(2014) Journal of Combin.Des.with a connection to association schemes.
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.
【机 构】
：
AichiUniversityofEducation
【出 处】
：
2015 Workshop on Combinatorics(2015组合论学术研讨会)
【发表日期】
：
2015年5期
其他文献
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
会议
Adinkras are graphical tools created for the study of representations in supersymmetry that turn out to contain many connections with graded posets,the Tutt
会议