default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHiroshi Nozaki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j20]Sebastian M. Cioaba, Jack H. Koolen, Masato Mimura, Hiroshi Nozaki, Takayuki Okuda:
On the spectrum and linear programming bound for hypergraphs. Eur. J. Comb. 104: 103535 (2022)- 2021
- [j19]Hiroshi Nozaki, Masashi Shinohara
:
A Proof of a Dodecahedron Conjecture for Distance Sets. Graphs Comb. 37(5): 1585-1603 (2021) - 2020
- [j18]Hiroshi Nozaki, Masashi Shinohara:
Maximal 2-distance sets containing the regular simplex. Discret. Math. 343(11): 112071 (2020) - [i3]Sebastian M. Cioaba, Jack H. Koolen, Masato Mimura, Hiroshi Nozaki, Takayuki Okuda:
On the spectrum and linear programming bound for hypergraphs. CoRR abs/2009.03022 (2020)
2010 – 2019
- 2019
- [j17]Hiroshi Nozaki:
Largest regular multigraphs with three distinct eigenvalues. Discret. Math. 342(7): 2134-2138 (2019) - 2018
- [j16]Hiroshi Nozaki, Sho Suda:
Complex Spherical Codes with Three Inner Products. Discret. Comput. Geom. 60(2): 294-317 (2018) - [i2]Sebastian M. Cioaba, Jack H. Koolen, Hiroshi Nozaki:
A spectral version of the Moore problem for bipartite regular graphs. CoRR abs/1805.01056 (2018) - 2017
- [j15]Saori Adachi, Hiroshi Nozaki:
On the largest subsets avoiding the diameter of (0, ±1)-vectors. Ars Math. Contemp. 13(1): 1-13 (2017) - [j14]Saori Adachi, Rina Hayashi, Hiroshi Nozaki, Chika Yamamoto:
Maximal m-distance sets containing the representation of the Hamming graph H(n, m). Discret. Math. 340(3): 430-442 (2017) - 2016
- [j13]Hiroshi Nozaki, Sho Suda:
Complex spherical codes with two inner products. Eur. J. Comb. 51: 511-518 (2016) - [j12]Sebastian M. Cioaba, Jack H. Koolen, Hiroshi Nozaki, Jason R. Vermette:
Maximizing the Order of a Regular Graph of Given Valency and Second Eigenvalue. SIAM J. Discret. Math. 30(3): 1509-1525 (2016) - 2015
- [j11]Hiroshi Nozaki:
Linear Programming Bounds for Regular Graphs. Graphs Comb. 31(6): 1973-1984 (2015) - [i1]Sebastian M. Cioaba, Jack H. Koolen, Hiroshi Nozaki, Jason R. Vermette:
Large regular graphs with given valency and second eigenvalue. CoRR abs/1503.06286 (2015) - 2014
- [j10]Hiroshi Nozaki, Hirotake Kurihara:
A Spectral Equivalent Condition of the P-polynomial Property for Association Schemes. Electron. J. Comb. 21(3): 3 (2014) - 2013
- [j9]Hiroshi Nozaki:
Lower bounds for the minimum diameter of integral point sets. Australas. J Comb. 56: 139-144 (2013) - 2012
- [j8]Hirotake Kurihara, Hiroshi Nozaki:
A characterization of Q-polynomial association schemes. J. Comb. Theory A 119(1): 57-62 (2012) - [j7]Masatake Hirao, Hiroshi Nozaki, Masanori Sawa, Vesselin Vatchev:
A New Approach for the Existence Problem of Minimal Cubature Formulas Based on the Larman-Rogers-Seidel Theorem. SIAM J. Numer. Anal. 50(5): 2716-2728 (2012) - 2011
- [j6]Hiroshi Nozaki:
Inside S-inner product sets and Euclidean designs. Comb. 31(6): 725-737 (2011) - [j5]Hiroshi Nozaki:
A generalization of Larman-Rogers-Seidel's theorem. Discret. Math. 311(10-11): 792-799 (2011) - [j4]Oleg R. Musin, Hiroshi Nozaki:
Bounds on three- and higher-distance sets. Eur. J. Comb. 32(8): 1182-1190 (2011) - [j3]Hiroshi Nozaki, Sho Suda:
Bounds on s-Distance Sets with Strength t. SIAM J. Discret. Math. 25(4): 1699-1713 (2011) - 2010
- [j2]Hiroshi Nozaki, Masashi Shinohara:
On a generalization of distance sets. J. Comb. Theory A 117(7): 810-826 (2010)
2000 – 2009
- 2008
- [j1]Hiroshi Nozaki:
On the rigidity of spherical t-designs that are orbits of reflection groups E8 and H4. Eur. J. Comb. 29(7): 1696-1703 (2008)
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-06-10 21:24 CEST 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:
