![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Hajime Tanaka 0001
Person information
- affiliation: Tohoku University, Research Center for Pure and Applied Mathematics, Sendai, Japan
Other persons with the same name
- Hajime Tanaka — disambiguation page
- Hajime Tanaka 0002 — Sumitomo Electric Industries, Ltd., Yokohama, Kanagawa, Japan
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j18]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) - 2020
- [j17]Hajime Tanaka, Tao Wang:
The Terwilliger Algebra of the Twisted Grassmann Graph: the Thin Case. Electron. J. Comb. 27(4): 4 (2020)
2010 – 2019
- 2019
- [j16]Ferdinand Ihringer, Hajime Tanaka:
The Independence Number of the Orthogonality Graph in Dimension 2k. Comb. 39(6): 1425-1428 (2019) - 2018
- [j15]John Vincent S. Morales, Hajime Tanaka
:
An Assmus-Mattson theorem for codes over commutative association schemes. Des. Codes Cryptogr. 86(5): 1039-1062 (2018) - 2017
- [j14]Eiichi Bannai, Etsuko Bannai, Hajime Tanaka
, Yan Zhu:
Design Theory from the Viewpoint of Algebraic Combinatorics. Graphs Comb. 33(1): 1-41 (2017) - [j13]Sho Suda, Hajime Tanaka
, Norihide Tokushige
:
A semidefinite programming approach to a cross-intersection problem with measures. Math. Program. 166(1-2): 113-130 (2017) - 2016
- [j12]Jacobus H. Koolen, Woo-Sun Lee, William J. Martin, Hajime Tanaka:
Arithmetic completely regular codes. Discret. Math. Theor. Comput. Sci. 17(3): 59-76 (2016) - 2015
- [j11]Eiichi Bannai, Etsuko Bannai, Sho Suda, Hajime Tanaka:
On Relative $t$-Designs in Polynomial Association Schemes. Electron. J. Comb. 22(4): 4 (2015) - 2013
- [j10]Hajime Tanaka:
The Erdős-Ko-Rado basis for a Leonard system. Contributions Discret. Math. 8(2) (2013) - 2012
- [j9]Hajime Tanaka:
The Erdös-Ko-Rado theorem for twisted Grassmann graphs. Comb. 32(6): 735-740 (2012) - 2011
- [j8]Hajime Tanaka:
Vertex Subsets with Minimal Width and Dual Width in Q-Polynomial Distance-Regular Graphs. Electron. J. Comb. 18(1) (2011) - [j7]Hajime Tanaka, Rie Tanaka:
Nonexistence of exceptional imprimitive Q-polynomial association schemes with six classes. Eur. J. Comb. 32(2): 155-161 (2011)
2000 – 2009
- 2009
- [j6]Eiichi Bannai, Osamu Shimabukuro, Hajime Tanaka:
Finite Euclidean graphs and Ramanujan graphs. Discret. Math. 309(20): 6126-6134 (2009) - [j5]William J. Martin, Hajime Tanaka:
Commutative association schemes. Eur. J. Comb. 30(6): 1497-1525 (2009) - 2006
- [j4]Hajime Tanaka:
Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs. J. Comb. Theory A 113(5): 903-910 (2006) - [j3]Dion Gijswijt
, Alexander Schrijver, Hajime Tanaka:
New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming. J. Comb. Theory A 113(8): 1719-1731 (2006) - 2004
- [j2]Eiichi Bannai, Osamu Shimabukuro, Hajime Tanaka:
Finite analogues of non-Euclidean spaces and Ramanujan graphs. Eur. J. Comb. 25(2): 243-259 (2004) - 2002
- [j1]Hajime Tanaka:
A Four-Class Subscheme of the Association Scheme Coming from the Action ofPGL(2, 4f). Eur. J. Comb. 23(1): 121-129 (2002)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint