2 citations · 8 across the 9 of their papers we have counts for
7 papers · 1 filter
Complete combinatorial characterization of greedy-drawable trees
Hiroyuki Miyata, Reiya Nosaka
A (Euclidean) greedy drawing of a graph is a drawing in which, for any two vertices (), there is a neighbor vertex of that is closer to than to in the E…
A two-dimensional topological representation theorem for matroid polytopes of rank 4
Hiroyuki Miyata
The Folkman-Lawrence topological representation theorem, which states that every (loop-free) oriented matroid of rank can be represented as a pseudosphere arrangement on the $(…
On Combinatorial Properties of Points and Polynomial Curves
Hiroyuki Miyata
Many combinatorial properties of a point set in the plane are determined by the set of possible partitions of the point set by a line. Their essential combinatorial properties are…
Enumerating neighborly polytopes and oriented matroids
Hiroyuki Miyata, Arnau Padrol
Neighborly polytopes are those that maximize the number of faces in each dimension among all polytopes with the same number of vertices. Despite their extremal properties they form…
Enumeration of PLCP-orientations of the 4-cube
Lorenz Klaus, Hiroyuki Miyata
The linear complementarity problem (LCP) provides a unified approach to many problems such as linear programs, convex quadratic programs, and bimatrix games. The general LCP is kno…
On symmetry groups of oriented matroids
Hiroyuki Miyata
Symmetries of geometric structures such as hyperplane arrangements, point configurations and polytopes have been studied extensively for a long time. However, symmetries of oriente…
Complete enumeration of small realizable oriented matroids
Komei Fukuda, Hiroyuki Miyata, Sonoko Moriyama
Enumeration of all combinatorial types of point configurations and polytopes is a fundamental problem in combinatorial geometry. Although many studies have been done, most of them…