Presentation 2015-06-13
Fast Search Method for Moat Problems on Prime Elements in Imaginary Quadratic Fields
Shinji Kinoshita, Hajime Matsui,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The moat problems on prime elements in imaginary quadratic fields are unsolved problems that ``Can one walk to infinity on prime elements in imaginary quadratic fields taking steps within bounded length?''When one cannot walk to infinity taking steps within k, it is said that there exists a moat of k. The previous researches have aimed to find moats of larger k's. In this research, we have confirmed the existence of moats of larger k's by applying wall follower algorithm.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Gaussian primes / Eisenstein primes / primary test / wall follower algorithm
Paper # COMP2015-10
Date of Issue 2015-06-05 (COMP)

Conference Information
Committee COMP / IPSJ-AL
Conference Date 2015/6/12(2days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair Koichi Wada(Hosei Univ.)
Vice Chair Toshimitsu Masuzawa(Osaka Univ.)
Secretary Toshimitsu Masuzawa(Hiroshima Univ.) / (Univ. of Electro-Comm.)
Assistant

Paper Information
Registration To Technical Committee on Theoretical Foundations of Computing / Special Interest Group on Algorithms
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Fast Search Method for Moat Problems on Prime Elements in Imaginary Quadratic Fields
Sub Title (in English)
Keyword(1) Gaussian primes
Keyword(2) Eisenstein primes
Keyword(3) primary test
Keyword(4) wall follower algorithm
1st Author's Name Shinji Kinoshita
1st Author's Affiliation Toyota Technological Institute(TTI)
2nd Author's Name Hajime Matsui
2nd Author's Affiliation Toyota Technological Institute(TTI)
Date 2015-06-13
Paper # COMP2015-10
Volume (vol) vol.115
Number (no) COMP-84
Page pp.pp.67-74(COMP),
#Pages 8
Date of Issue 2015-06-05 (COMP)