2 citations · 3 across the 3 of their papers we have counts for
3 papers
math.CO2014★ 2 cited
Linear programming bounds for regular graphs
Hiroshi Nozaki
Delsarte, Goethals, and Seidel (1977) used the linear programming method in order to find bounds for the size of spherical codes endowed with prescribed inner products between dist…
math.CO2012
A characterization of skew Hadamard matrices and doubly regular tournaments
Hiroshi Nozaki, Sho Suda
We give a new characterization of skew Hadamard matrices of size in terms of the data of the spectra of tournaments of size .
math.CO2010★ 1 cited
A characterization of Q-polynomial association schemes
Hirotake Kurihara, Hiroshi Nozaki
We prove a necessary and sufficient condition for a symmetric association scheme to be a Q-polynomial scheme.