Izumi Miyamoto

According to our database, Izumi Miyamoto authored at least 11 papers between 1988 and 2010.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2010

A construction of designs on n+1 points from multiply homogeneous permutation groups of degree n.

Izumi Miyamoto

J. Comb. Theory A, 2010

Computation of isomorphisms of coherent configurations.

Izumi Miyamoto

Ars Math. Contemp., 2010

An Improvement of a Function Computing Normalizers for Permutation Groups.

Izumi Miyamoto

Proceedings of the Mathematical Software, 2010

2009

A Construction of Designs from <i>PSL</i>(2, <i>q</i>) and <i>PGL</i>(2, <i>q</i>), <i>q</i>=1 mod 6, on <i>q</i>+2 Points.

Izumi Miyamoto

Proceedings of the Algorithmic Algebraic Combinatorics and Gröbner Bases, 2009

2008

A combinatorial approach to doubly transitive permutation groups.

Izumi Miyamoto

Discret. Math., 2008

2007

A computation of some multiply homogeneous superschemes from transitive permutation groups.

Izumi Miyamoto

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

2006

An improvement of GAP normalizer function for permutation groups.

Izumi Miyamoto

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

2003

Classification of Association Schemes of Small Order.

Akihide Hanaki, Izumi Miyamoto

Discret. Math., 2003

2001

Computing Isomorphisms of Association Schemes and its Application.

Izumi Miyamoto

J. Symb. Comput., 2001

2000

Computing normalizers of permutation groups efficiently using isomorphisms of association schemes.

Izumi Miyamoto

Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

1988

Computation of some Cayley diagrams.

Izumi Miyamoto

Discret. Math., 1988