Hajime Tanaka

Orcid: 0000-0002-5958-0375

Affiliations:
  • Tohoku University, Research Center for Pure and Applied Mathematics, Sendai, Japan


According to our database1, Hajime Tanaka authored at least 18 papers between 2002 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Tight relative t-designs on two shells in hypercubes, and Hahn and Hermite polynomials.
Ars Math. Contemp., 2022

2020
The Terwilliger Algebra of the Twisted Grassmann Graph: the Thin Case.
Electron. J. Comb., 2020

2019
The Independence Number of the Orthogonality Graph in Dimension 2<sup>k</sup>.
Comb., 2019

2018
An Assmus-Mattson theorem for codes over commutative association schemes.
Des. Codes Cryptogr., 2018

2017
A semidefinite programming approach to a cross-intersection problem with measures.
Math. Program., 2017

Design Theory from the Viewpoint of Algebraic Combinatorics.
Graphs Comb., 2017

2016
Arithmetic completely regular codes.
Discret. Math. Theor. Comput. Sci., 2016

2015
On Relative $t$-Designs in Polynomial Association Schemes.
Electron. J. Comb., 2015

2013
The Erdős-Ko-Rado basis for a Leonard system.
Contributions Discret. Math., 2013

2012
The Erdös-Ko-Rado theorem for twisted Grassmann graphs.
Comb., 2012

2011
Nonexistence of exceptional imprimitive Q-polynomial association schemes with six classes.
Eur. J. Comb., 2011

Vertex Subsets with Minimal Width and Dual Width in <i>Q</i>-Polynomial Distance-Regular Graphs.
Electron. J. Comb., 2011

2009
Commutative association schemes.
Eur. J. Comb., 2009

Finite Euclidean graphs and Ramanujan graphs.
Discret. Math., 2009

2006
Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs.
J. Comb. Theory, Ser. A, 2006

New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming.
J. Comb. Theory, Ser. A, 2006

2004
Finite analogues of non-Euclidean spaces and Ramanujan graphs.
Eur. J. Comb., 2004

2002
A Four-Class Subscheme of the Association Scheme Coming from the Action ofPGL(2, 4<sub>f</sub>).
Eur. J. Comb., 2002


  Loading...