Izumi Miyamoto - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 11 from 11

2010

A construction of designs on n+1 points from multiply homogeneous permutation groups of degree nIzumi Miyamoto. JCT, 117(4):430-439, 2010. [doi]

An Improvement of a Function Computing Normalizers for Permutation GroupsIzumi Miyamoto. icms 2010: 62-68 [doi]

Computation of isomorphisms of coherent configurationsIzumi Miyamoto. arsmc, 3(1):59-67, 2010. [doi]

2009

q+2 PointsIzumi Miyamoto. In Mikhail H. Klin, Gareth A. Jones, Aleksandar Jurisic, Mikhail E. Muzychuk, Ilia Ponomarenko, editors, Algorithmic Algebraic Combinatorics and Gröbner Bases. pages 279-284, Springer, 2009. [doi]

2008

A combinatorial approach to doubly transitive permutation groupsIzumi Miyamoto. DM, 308(14):3073-3081, 2008. [doi]

2007

A computation of some multiply homogeneous superschemes from transitive permutation groupsIzumi Miyamoto. issac 2007: 293-298 [doi]

2006

An improvement of GAP normalizer function for permutation groupsIzumi Miyamoto. issac 2006: 234-238 [doi]

2003

Classification of Association Schemes of Small OrderAkihide Hanaki, Izumi Miyamoto. DM, 264(1-3):75-80, 2003. [doi]

2001

Computing Isomorphisms of Association Schemes and its ApplicationIzumi Miyamoto. JSC, 32(1/2):133-141, 2001.

2000

Computing normalizers of permutation groups efficiently using isomorphisms of association schemesIzumi Miyamoto. issac 2000: 220-224 [doi]

1988

Computation of some Cayley diagramsIzumi Miyamoto. DM, 72(1-3):291-293, 1988. [doi]

Sign in or sign up to see more results.

runs on WebDSL