Hiroyuki Miyata (宮田洋行)

Ph. D. candidate
Department of Computer Science, Graduate School of Information Science and Technology,
University of Tokyo, Bunkyo-ku, Tokyo, Japan.
Research Fellow of the Japan Society for the Promotion of Science (DC1)
Email: hmiyata (at) is.s.u-tokyo.ac.jp

Personal History

• Born on November 13, 1984.
• Bachelor of Science, The University of Tokyo, March 2007.
• Master of Information Science and Technology, The University of Tokyo, March 2009.

Research interests

Combinatorial geometry, computational algebra, optimization, ...

I am interested in combinatorial geometry, computational algebra, optimization and their intersection.
Especially, I am now working on the realizability problem of oriented matroids.
Homepage of Classification of Oriented Matroids

Journal papers

• Hiroyuki Miyata, Sonoko Moriyama and Hiroshi Imai, Deciding non-realizability of oriened matroids by semidefinite programming, Pacific Journal of Optimization, vol.5, pp. 211-224, 2009.
• Antoine Deza, Hiroyuki Miyata, Sonoko Moriyama and Feng Xie, Hyperplane Arrangements with Large Average Diameter: a Computational Approach, Advanced Studies in Pure Mathematics, to appear.
• David Avis, Hiroyuki Miyata and Sonoko Moriyama, Families of polytopal digraphs the do not satisfy the shelling property, submitted.
• Hiroyuki Miyata, Sonoko Moriyama and Komei Fukuda, Complete enumeration of small realizable oriented matroids, submitted.

Refereed conference papers

• David Avis, Hiroyuki Miyata and Sonoko Moriyama, A family of polytopal digraphs that do not satisfy the shelling property, Proceedings of the 6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, pp.236-246, 2009.
• Hiroyuki Miyata, Sonoko Moriyama and Komei Fukuda, Complete enumeration of small realizable oriented matroids, Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG 2010), pp.143-146, 2010.

Talks at international conferences

• Hiroyuki Miyata, Sonoko Moriyama and Hiroshi Imai, Determining the non-realizability of oriented matroids by semidefinite programming, Kyoto International Conference on Computational Geometry and Graph Theory (KyotoCGGT2007), Kyoto, Japan, 2007/6/11-15.
• Sonoko Moriyama, Hiroyuki Miyata and Hiroshi Imai, Approach to the realizability problem of oriented matroids by seminidefinite programming, Second Mathematical Programming Society International Conference on Continuous Optimization ICCOPT II & MOPTA-07, Hamilton, Ontario, Canada, 2007/8/13-16.
• Hiroyuki Miyata, Sonoko Moriyama and Hiroshi Imai, Analyzing Geometric Realizability Problems by Semidefinite Programming, Kyoto RIMS Workshop on Computational Geometry and Discrete Mathematics, Kyoto, Japan, 2008/10/16-18.
• David Avis, Hiroyuki Miyata and Sonoko Moriyama, A family of polytopal digraphs that do not satisfy the shelling property, 6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Budapest, Hungary, 2009/5/16-19.
• Hiroyuki Miyata, Sonoko Moriyama and Komei Fukuda, Realizations of oriented matroids by extended solvability sequence method, Canada-Japan Workshop on Discrete and Computational Geometry, Tokyo, Japan, 2009/7/13-15.
• Hiroyuki Miyata, Sonoko Moriyama and Komei Fukuda, Complete enumeration of small realizable oriented matroids, the 22nd Canadian Conference on Computational Geometry (CCCG 2010), Winnipeg, Canada, 2010/8/9-11.
• Hiroyuki Miyata, Sonoko Moriyama and Komei Fukuda, Database of point configurations and polytopes, and classification software, The Third International Congress on Mathematical Software (ICMS 2010), Kobe, Japan, 2010/9/13-17, poster presentation (to be presented).

Talks at domestic meetings (in Japanese)

• 森山園子, 宮田洋行, 今井浩: 有向マトロイドの実現不可能性問題における半正定値計画問題の有用性, 応用数理学会研究部会連合発表会（離散システム研究部会）, 首都大学東京, 2008/3/8-9.
• 宮田洋行, 森山園子, 福田公明: 小さな有向マトロイドの実現可能性の完全な分類, 電子情報通信学コンピュテーション研究会, 立命館大学, 2010/4/22.
  信学技報, vol. 110, no. 12, COMP2010-4, pp. 25-31.