How many P-polynomial Structures can an Association Scheme have? - Eiichi Bannai; Etsuko Bannai (Eur. J. Comb., 1980)

An upper bound for the cardinality of an s-distance subset in real Euclidean space. - Eiichi Bannai; Etsuko Bannai (Comb., 1981)

An upper bound for the cardinality of an s-distance subset in real Euclidean space, II. - Eiichi Bannai; Etsuko Bannai; Dennis Stanton (Comb., 1983)

On the Ring of Simultaneous Invariants for the Gleason-MacWilliams Group. - Eiichi Bannai; Etsuko Bannai; Michio Ozeki; Yasuo Teranishi (Eur. J. Comb., 1999)

Bose-Mesner Algebras Associated with Four-Weight Spin Models. - Etsuko Bannai (Graphs Comb., 2001)

Symmetric Designs Attached to Four-Weight Spin Models. - Etsuko Bannai; Mitsuhiro Sawano (Des. Codes Cryptogr., 2002)

An Upper Bound for the Cardinality of an s-Distance Set in Euclidean Space. - Etsuko Bannai; Kazuki Kawasaki; Yusuke Nitamizu; Teppei Sato (Comb., 2003)

A note on the spherical embeddings of strongly regular graphs. - Eiichi Bannai; Etsuko Bannai (Eur. J. Comb., 2005)

On primitive symmetric association schemes with m1=3. - Eiichi Bannai; Etsuko Bannai (Contributions Discret. Math., 2006)

On optimal tight 4-designs on 2 concentric spheres. - Eiichi Bannai; Etsuko Bannai (Eur. J. Comb., 2006)

On the strong non-rigidity of certain tight Euclidean designs. - Eiichi Bannai; Etsuko Bannai; Djoko Suprijanto (Eur. J. Comb., 2007)

Uniqueness of certain association schemes. - Eiichi Bannai; Etsuko Bannai; Hideo Bannai (Eur. J. Comb., 2008)

New examples of Euclidean tight 4-designs. - Etsuko Bannai (Eur. J. Comb., 2009)

A survey on spherical designs and algebraic combinatorics on spheres. - Eiichi Bannai; Etsuko Bannai (Eur. J. Comb., 2009)

Cubature formulas in numerical analysis and Euclidean tight designs. - Eiichi Bannai; Etsuko Bannai; Masatake Hirao; Masanori Sawa (Eur. J. Comb., 2010)

t-Designs with the number of blocks close to the Fisher type lower bound. - Eiichi Bannai; Etsuko Bannai (J. Comb. Theory A, 2013)

On the existence of tight relative 2-designs on binary Hamming association schemes. - Eiichi Bannai; Etsuko Bannai; Hideo Bannai (Discret. Math., 2014)

Tight Relative 2- and 4-Designs on Binary Hamming Association Schemes. - Zengti Li; Eiichi Bannai; Etsuko Bannai (Graphs Comb., 2014)

On Relative $t$-Designs in Polynomial Association Schemes. - Eiichi Bannai; Etsuko Bannai; Sho Suda; Hajime Tanaka 001 (Electron. J. Comb., 2015)

Some bounds for the number of blocks III. - Etsuko Bannai; Ryuzaburo Noda (Discret. Math., 2016)

Tight relative 2-designs on two shells in Johnson association schemes. - Yan Zhu 015; Eiichi Bannai; Etsuko Bannai (Discret. Math., 2016)

On Spherical Designs of Some Harmonic Indices. - Yan Zhu 015; Eiichi Bannai; Etsuko Bannai; Kyoung-Tark Kim; Wei-Hsuan Yu (Electron. J. Comb., 2017)

Relative t-designs in binary Hamming association scheme H(n, 2). - Eiichi Bannai; Etsuko Bannai; Yan Zhu 015 (Des. Codes Cryptogr., 2017)

Design Theory from the Viewpoint of Algebraic Combinatorics. - Eiichi Bannai; Etsuko Bannai; Hajime Tanaka 001; Yan Zhu 015 (Graphs Comb., 2017)

Harmonic Index Designs in Binary Hamming Schemes. - Yan Zhu 015; Eiichi Bannai; Etsuko Bannai; Takuya Ikuta; Kyoung-Tark Kim (Graphs Comb., 2017)

Tight relative t-designs on two shells in hypercubes, and Hahn and Hermite polynomials. - Eiichi Bannai; Etsuko Bannai; Hajime Tanaka 001; Yan Zhu 015 (Ars Math. Contemp., 2022)

The real equiangular tight frames obtained from rank 3 graphs. - Eiichi Bannai; Etsuko Bannai; Chin-Yen Lee; Hajime Tanaka 001; Wei-Hsuan Yu (Electron. J. Graph Theory Appl., 2024)

On the two-distance embedding in real Euclidean space of coherent configuration of type (2,2;3). - Eiichi Bannai; Etsuko Bannai; Chin-Yen Lee; Ziqing Xiang; Wei-Hsuan Yu (Discret. Math., 2025)