default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEtsuko Bannai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Eiichi Bannai, Etsuko Bannai, Chin-Yen Lee, Hajime Tanaka, Wei-Hsuan Yu:
The real equiangular tight frames obtained from rank 3 graphs. Electron. J. Graph Theory Appl. 12(2): 329-341 (2024)- 2022
- [j26]Eiichi Bannai, Etsuko Bannai, Hajime Tanaka, Yan Zhu:
Tight relative t-designs on two shells in hypercubes, and Hahn and Hermite polynomials. Ars Math. Contemp. 22(2): 2 (2022)
2010 – 2019
- 2017
- [j25]Yan Zhu, Eiichi Bannai, Etsuko Bannai, Kyoung-Tark Kim, Wei-Hsuan Yu:
On Spherical Designs of Some Harmonic Indices. Electron. J. Comb. 24(2): 2 (2017) - [j24]Eiichi Bannai, Etsuko Bannai, Yan Zhu:
Relative t-designs in binary Hamming association scheme H(n, 2). Des. Codes Cryptogr. 84(1-2): 23-53 (2017) - [j23]Eiichi Bannai, Etsuko Bannai, Hajime Tanaka
, Yan Zhu:
Design Theory from the Viewpoint of Algebraic Combinatorics. Graphs Comb. 33(1): 1-41 (2017) - [j22]Yan Zhu, Eiichi Bannai, Etsuko Bannai, Takuya Ikuta, Kyoung-Tark Kim:
Harmonic Index Designs in Binary Hamming Schemes. Graphs Comb. 33(6): 1405-1418 (2017) - 2016
- [j21]Yan Zhu, Eiichi Bannai, Etsuko Bannai:
Tight relative 2-designs on two shells in Johnson association schemes. Discret. Math. 339(2): 957-973 (2016) - [j20]Etsuko Bannai, Ryuzaburo Noda:
Some bounds for the number of blocks III. Discret. Math. 339(9): 2313-2328 (2016) - 2015
- [j19]Eiichi Bannai, Etsuko Bannai, Sho Suda, Hajime Tanaka:
On Relative $t$-Designs in Polynomial Association Schemes. Electron. J. Comb. 22(4): 4 (2015) - 2014
- [j18]Eiichi Bannai, Etsuko Bannai, Hideo Bannai:
On the existence of tight relative 2-designs on binary Hamming association schemes. Discret. Math. 314: 17-37 (2014) - [j17]Zengti Li, Eiichi Bannai, Etsuko Bannai:
Tight Relative 2- and 4-Designs on Binary Hamming Association Schemes. Graphs Comb. 30(1): 203-227 (2014) - 2013
- [j16]Eiichi Bannai, Etsuko Bannai:
t-Designs with the number of blocks close to the Fisher type lower bound. J. Comb. Theory A 120(7): 1575-1577 (2013) - 2010
- [j15]Eiichi Bannai, Etsuko Bannai, Masatake Hirao, Masanori Sawa:
Cubature formulas in numerical analysis and Euclidean tight designs. Eur. J. Comb. 31(2): 423-441 (2010)
2000 – 2009
- 2009
- [j14]Etsuko Bannai:
New examples of Euclidean tight 4-designs. Eur. J. Comb. 30(3): 655-667 (2009) - [j13]Eiichi Bannai, Etsuko Bannai:
A survey on spherical designs and algebraic combinatorics on spheres. Eur. J. Comb. 30(6): 1392-1425 (2009) - 2008
- [j12]Eiichi Bannai, Etsuko Bannai, Hideo Bannai:
Uniqueness of certain association schemes. Eur. J. Comb. 29(6): 1379-1395 (2008) - 2007
- [j11]Eiichi Bannai, Etsuko Bannai, Djoko Suprijanto:
On the strong non-rigidity of certain tight Euclidean designs. Eur. J. Comb. 28(6): 1662-1680 (2007) - 2006
- [j10]Eiichi Bannai, Etsuko Bannai:
On primitive symmetric association schemes with m1=3. Contributions Discret. Math. 1(1) (2006) - [j9]Eiichi Bannai, Etsuko Bannai:
On optimal tight 4-designs on 2 concentric spheres. Eur. J. Comb. 27(2): 179-192 (2006) - 2005
- [j8]Eiichi Bannai, Etsuko Bannai:
A note on the spherical embeddings of strongly regular graphs. Eur. J. Comb. 26(8): 1177-1179 (2005) - 2003
- [j7]Etsuko Bannai, Kazuki Kawasaki, Yusuke Nitamizu, Teppei Sato:
An Upper Bound for the Cardinality of an s-Distance Set in Euclidean Space. Comb. 23(4): 535-557 (2003) - 2002
- [j6]Etsuko Bannai, Mitsuhiro Sawano:
Symmetric Designs Attached to Four-Weight Spin Models. Des. Codes Cryptogr. 25(1): 73-90 (2002) - 2001
- [j5]Etsuko Bannai:
Bose-Mesner Algebras Associated with Four-Weight Spin Models. Graphs Comb. 17(4): 589-598 (2001)
1990 – 1999
- 1999
- [j4]Eiichi Bannai, Etsuko Bannai, Michio Ozeki, Yasuo Teranishi:
On the Ring of Simultaneous Invariants for the Gleason-MacWilliams Group. Eur. J. Comb. 20(7): 619-627 (1999)
1980 – 1989
- 1983
- [j3]Eiichi Bannai, Etsuko Bannai, Dennis Stanton:
An upper bound for the cardinality of an s-distance subset in real Euclidean space, II. Comb. 3(2): 147-152 (1983) - 1981
- [j2]Eiichi Bannai, Etsuko Bannai:
An upper bound for the cardinality of an s-distance subset in real Euclidean space. Comb. 1(2): 99-102 (1981) - 1980
- [j1]Eiichi Bannai, Etsuko Bannai:
How many P-polynomial Structures can an Association Scheme have? Eur. J. Comb. 1(4): 289-298 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 23:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
