代数的組合せ論
計算環論
Algebraic Combinatorics
Computer Algebra
-
4 2023 - PresentProfessor Emeritus
Researcher Profile
Updated on 2024/10/02
代数的組合せ論
計算環論
Algebraic Combinatorics
Computer Algebra
Natural Science / Applied mathematics and statistics
Natural Science / Basic mathematics
Natural Science / Algebra
Country: Japan
Country: Japan
Country: Japan
Committee type:Academic society
On Hilbert-Poincare series of affine semi-regular polynomial sequences and related Groebner bases Invited Peer-reviewed
Momonari Kudo, Kazuhiro Yokoyama
Mathematical Foundations for Post-Quantum Cryptography, Mathematics for Industry 3 2024
On Factorization of Parametric Polynomials Peer-reviewed
Kazuhiro Yokoyama
accepted at Commentarii Mathematici Universitatis Sancti Pauli 2024
Computing endomorphism rings of supersingular elliptic curves by finding cycles in concatenated supersingular isogeny graphs Peer-reviewed
Yuta Kambe, Akira Katayama, Yusuke Aikawa, Yuki Ishihara, Masaya Yasuda, Kazuhiro Yokoyama
accepted at Commentarii Mathematici Universitatis Sancti Pauli 2024
On the feasibility of computing constructive Deuring correspondence Peer-reviewed
Yuta Kambe, Yasushi Takahashi, Masaya Yasuda, Kazuhiro Yokoyama
Banach Center Publications: Post-proceedings of Number-Theoretic Methods in Cryptology (NuTMiC 2021)126 105 - 121 12 2023
Introduction to algebraic approaches for solving isogeny path-finding problems Peer-reviewed
Ryoya Fukasaku, Yasuhiko Ikematsu, Momonari Kudo, Masaya Yasuda, Kazuhiro Yokoyama
RIMS Kˆokyˆuroku BessatsuB90 169 - 184 6 2022
Implementation Report of the Kohel–Lauter–Petit–Tignol Algorithm for the Constructive Deuring Correspondence Peer-reviewed
Yuta Kambe, Yusuke Aikawa, Momonari Kudo, Masaya Yasuda, Katsuyuki Takashima, Kazuhiro Yokoyama
Proceedings of the Seventh International Conference on Mathematics and Computing 953 - 966 2022
Solving the constructive Deuring correspondence via the Kohel-Lauter-Petit-Tignol algorithm Peer-reviewed
Yuta Kambe, Masaya Yasuda, Masayuki Noro, Kazuhiro Yokoyama, Yusuke Aikawa, Katsuyuki Takashima, Momonari Kudo
Mathematical Cryptology (Special Issue of MathCrypt 2021)1 ( 2 ) 10 - 24 8 2021
On affine tropical F5 algorithms Peer-reviewed
Tristan Vaccon, Thibaut Verron, Kazuhiro Yokoyama
Journal of Symbolic Computation102 132 - 152 2021
Symbolic Computation of Isogenies of Elliptic Curves by Vélu’s Formula Peer-reviewed
Masayuki NORO, Masaya YASUDA, Kazuhiro YOKOYAMA
COMMENTARII MATHEMATICI UNIVERSITATIS SANCTI PAULI68 93 - 127 12 2020
Algebraic approaches for solving isogeny problems of prime power degrees Peer-reviewed
Yasushi Takahashi, Momonari Kudo, Ryoya Fukasaku, Yasuhiko Ikematsu, Masaya Yasuda, Kazuhiro Yokoyama
Journal of Mathematical Cryptology15 ( 1 ) 31 - 44 17 11 2020
Complexity bounds on Semaev’s naive index calculus method for ECDLP Peer-reviewed
Kazuhiro Yokoyama, Masaya Yasuda, Yasushi Takahashi, Jun Kogure
Journal of Mathematical Cryptology14 ( 1 ) 460 - 485 30 10 2020
Hybrid Meet-in-the-Middle Attacks for the Isogeny Path-Finding Problem. Peer-reviewed
Yasuhiko Ikematsu, Ryoya Fukasaku, Momonari Kudo, Masaya Yasuda, Katsuyuki Takashima, Kazuhiro Yokoyama
Proceedings of the 7th on ASIA Public-Key Cryptography Workshop(APKC@AsiaCCS) 36 - 44 10 2020
On FGLM algorithms with tropical Gröbner bases Peer-reviewed
Yuki Ishihara, Tristan Vaccon, Kazuhiro Yokoyama
Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation 20 7 2020
On Affine Tropical F5 Algorithms Peer-reviewed
Tristan Vaccon, Thibaut Verron, Kazuhiro Yokoyama
Proceedings of ISSAC 2018 383 - 390 7 2018
Usage of Modular Techniques for Efficient Computation of Ideal Operations Peer-reviewed
Masayuki Noro, Kazuhiro Yokoyama
Mathematics in Computer Science12 ( 1 ) 1 - 32 1 3 2018
Effective Localization Using Double Ideal Quotient and Its Implementation. Peer-reviewed
Yuki Ishihara, Kazuhiro Yokoyama
Proceedings of CASC 2018, Lecture Notes in Computer Science11077 272 - 287 2018
A Tropical F5 algorithm Peer-reviewed
Tristan Vaccon, Kazuhiro Yokoyama
Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC129312 429 - 436 23 7 2017
Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors. Peer-reviewed
Masaya Yasuda, Kazuhiro Yokoyama, Takeshi Shimoyama, Jun Kogure, Takeshi Koshiba
J. Mathematical Cryptology11 ( 1 ) 1 - 24 2017
Secure statistical analysis using RLWE-based homomorphic encryption Peer-reviewed
Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama, Takeshi Koshiba
Lecture Notes in Computer Science (ACISP 2015)9144 471 - 487 6 2015
Secure Data Devolution: Practical Re-encryption with Auxiliary Data in LWE-based Somewhat Homomorphic Encryption. Peer-reviewed
Masaya Yasuda, Array, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama
Proceedings of the 3rd International Workshop on Security in Cloud Computing, SCC@ASIACCS '15, Singapore, Republic of Singapore, April 14, 2015 53 - 61 2015
New packing method in somewhat homomorphic encryption and its applications. Peer-reviewed
Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama, Takeshi Koshiba
Security and Communication Networks8 ( 13 ) 2194 - 2213 2015
Privacy-Preserving Wildcards Pattern Matching Using Symmetric Somewhat Homomorphic Encryption Peer-reviewed
Yasuda Masaya, Shimoyama Takeshi, Kogure Jun, Yokoyama Kazuhiro, Koshiba Takeshi
INFORMATION SECURITY AND PRIVACY, ACISP 20148544 338 - 353 2014
Practical Packing Method in Somewhat Homomorphic Encryption Peer-reviewed
Yasuda Masaya, Shimoyama Takeshi, Kogure Jun, Yokoyama Kazuhiro, Koshiba Takeshi
DATA PRIVACY MANAGEMENT AND AUTONOMOUS SPONTANEOUS SECURITY, DPM 20138247 34 - 50 2014
Verification of Gröbner basis candidates Peer-reviewed
Masayuki Noro, Kazuhiro Yokoyama
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)8592 419 - 424 2014
On the exact decryption range for Gentry-Halevi's implementation of fully homomorphic encryption. Peer-reviewed
Masaya Yasuda, Kazuhiro Yokoyama, Takeshi Shimoyama, Jun Kogure, Takeshi Koshiba
J. Mathematical Cryptology8 ( 3 ) 305 - 329 2014
An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination Peer-reviewed
Hidenao Iwane, Hitoshi Yanami, Hirokazu Anai, Kazuhiro Yokoyama
THEORETICAL COMPUTER SCIENCE479 ( 1 ) 43 - 69 4 2013
Secure pattern matching using somewhat homomorphic encryption. Peer-reviewed
Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama, Takeshi Koshiba
CCSW'13, Proceedings of the 2013 ACM Cloud Computing Security Workshop, Co-located with CCS 2013, Berlin, Germany, November 4, 2013 65 - 76 2013
Packed Homomorphic Encryption Based on Ideal Lattices and Its Application to Biometrics. Peer-reviewed
Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama, Takeshi Koshiba
Proceedings of CD-ARES 2013, Lecture Notes in Computer Science8128 55 - 74 2013
Efficient Arithmetic in Successive Algebraic Extension Fields Using Symmetries Peer-reviewed
Sébastien Orange, Guénaël Renault, Kazuhiro Yokoyama
Mathematics in Computer Science6 ( 3 ) 217 - 233 9 2012
Usage of Modular Techniques for Efficient Computation of Ideal Operations Invited
Kazuhiro Yokoyama
COMPUTER ALGEBRA IN SCIENTIFIC COMPUTING, CASC 20127442 361 - 362 2012
Optimizing a Particular Real Root of a Polynomial by a Special Cylindrical Algebraic Decomposition Peer-reviewed
Silvia Gandy, Masaaki Kanno, Hirokazu Anai, Kazuhiro Yokoyama
Mathematics in Computer Science5 ( 2 ) 209 - 221 6 2011
Development of QC2AS- A computer algebra system for symbolic quantum chemical computations Peer-reviewed
Takeshi Osoekawa, Yuji Mochizuki, Kazuhiro Kyokoyama
Proceedings - 2011 International Conference on Computational Science and Its Applications, ICCSA 2011 102 - 109 2011
Gröbner Basis Technique for Algebraic Formulas in Electron Correlation Theories Peer-reviewed
Takeshi Osoekawa, Yuji Mochizuki, Kazuhiro Yokoyama
Proceedings of ICCSA 2010 17 - 23 2010
Parametric polynomial spectral factorization using the sum of roots and its application to a control design problem Peer-reviewed
Hirokazu Anai, Shinji Hara, Masaaki Kanno, Kazuhiro Yokoyama
JOURNAL OF SYMBOLIC COMPUTATION44 ( 7 ) 703 - 725 7 2009
Computation Schemes for Splitting Fields of Polynomials Peer-reviewed
Sebastien Orange, Guenael Renault, Kazuhiro Yokoyama
ISSAC2009: PROCEEDINGS OF THE 2009 INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION 279 - 286 2009
Solution of Algebraic Riccati Equations Using the Sum of Roots Peer-reviewed
Masaaki Kanno, Kazuhiro Yokoyama, Hirokazu Anai, Shinji Hara
ISSAC2009: PROCEEDINGS OF THE 2009 INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION 215 - 222 2009
An Effective Implementation of a Symbolic-Numeric Cylindrical Algebraic Decomposition for Quantifier Elimination Peer-reviewed
Hidenao Iwane, Hitoshi Yanami, Hirokazu Anai, Kazuhiro Yokoyama
SNC'09: PROCEEDINGS OF THE 2009 INTERNATIONAL WORKSHOP ON SYMBOLIC-NUMERIC COMPUTATION 55 - 64 2009
Symbolic optimization of algebraic function Peer-reviewed
Masaaki Kanno, Kazuhiro Yokoyama, Hirokazu Anai, Shinji Hara
Proceedings of the 2008 International Symposium on Symbolic and Algebraic Computation 247 - 254 7 2008
Solution of the algebraic riccati equation using the sum of roots Peer-reviewed
Masaaki Kanno, Kazuhiro Yokoyama, Hirokazu Anai
ACM Comm. Computer Algebra42 ( 3 ) 144 - 145 2008
Multi-modular algorithm for computing the splitting field of a polynomial Peer-reviewed
Guénaël Renault, Kazuhiro Yokoyama
Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC 247 - 254 2008
Symbolic optimization of algebraic functions Peer-reviewed
Masaaki Kanno, Kazuhiro Yokoyama, Hirokazu Anai, Shinji Hara
Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC 147 - 154 2008
On systems of algebraic equations with parametric exponents II Peer-reviewed
Kazuhiro Yokoyama
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING18 ( 6 ) 603 - 630 12 2007
Sum of roots, polynomial spectral factorization, and control performance limitations Peer-reviewed
Masaaki Kanno, Shinji Hara, Hirokazu Anai, Kazuhiro Yokoyama
Proceedings of the IEEE Conference on Decision and Control 2968 - 2973 2007
On the relationship between the sum of roots with positive real parts and polynomial spectral factorization Peer-reviewed
Masaaki Kanno, Hirokazu Anai, Kazuhiro Yokoyama
Numerical Methods and Applications4310 320 - 328 2007
Parametric Optimization in Control Using the Sum of Roots for Parametric Polynomial Spectral Factorization Peer-reviewed
Masaaki Kanno, Kazuhiro Yokoyama, Hirokazu Anai, Shinji Hara
ISSAC 2007: PROCEEDINGS OF THE 2007 INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION 211 - + 2007
On polynomial curves in the affine plane Peer-reviewed
Mitsushi Fujimoto, Masakazu Suzuki, Kazuhiro Yokoyama
OSAKA JOURNAL OF MATHEMATICS43 ( 3 ) 597 - 608 9 2006
A modular method for computing the splitting field of a polynomial Peer-reviewed
Guenael Renault, Kazuhiro Yokoyama
ALGORITHMIC NUMBER THEORY, PROCEEDINGS4076 124 - 140 2006
Stability of parametric decomposition Peer-reviewed
Kazuhiro Yokoyama
MATHEMATICAL SOFTWARE-ICMS 2006, PROCEEDINGS4151 391 - 402 2006
Sum of roots with positive real parts Peer-reviewed
Hirokazu Anai, Shinji Hara, Kazuhiro Yokoyama
Proceedings of ISSAC 2005 21 - 28 7 2005
Cylindrical algebraic decomposition via numerical computation with validated symbolic reconstruction Peer-reviewed
Hirokazu Anai, Kazuhiro Yokoyama
Algorithmic Algebra and Logic (A3L2005) 25 - 30 2005
Implementation of prime decomposition of polynomial ideals over small finite fields Peer-reviewed
M Noro, K Yokoyama
JOURNAL OF SYMBOLIC COMPUTATION38 ( 4 ) 1227 - 1246 10 2004
On systems algebraic equations with parametric exponents Peer-reviewed
Kazuhiro Yokoyama
Proceedings of ISSAC 2004 312 - 319 7 2004
Z(3) symmetry and W-3 algebra in lattice vertex operator algebras Peer-reviewed
CY Dong, CH Lam, K Tanabe, H Yamada, K Yokoyama
PACIFIC JOURNAL OF MATHEMATICS215 ( 2 ) 245 - 296 6 2004
Yet another practical implementation of polynomial factorization over finite fields Peer-reviewed
Masayuki Noro, Kazuhiro Yokoyama
Proceedings of ISSAC 2002 200 - 206 7 2002
Order counting of elliptic curves defined over finite fields of characteristic 2 Peer-reviewed
T Izu, J Kogure, M Noro, K Yokoyama
ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE85 ( 1 ) 62 - 70 2002
The block cipher SC2000 Peer-reviewed
T Shimoyama, H Yanami, K Yokoyama, M Takenaka, K Itoh, J Yajima, N Torii, H Tanaka
FAST SOFTWARE ENCRYPTION2355 312 - 327 2002
Prime decomposition of polynomial ideals over finite fields Peer-reviewed
K Yokoyama
MATHEMATICAL SOFTWARE, PROCEEDINGS 217 - 227 2002
Radical representation of polynomial roots Peer-reviewed
Hirokazu Anai, Kazuhiro Yokoyama
JSSAC(日本数式処理学会誌)9 ( 1 ) 53 - 79 2002
Elliptic curve cryptosystem
Naoya Torii, Kazuhiro Yokoyama
Fujitsu Scientific and Technical Journal36 ( 2 ) 140 - 146 2000
Efficient implementation of Schoof's algorithm in case of characteristic 2 Peer-reviewed
T Izu, J Kogure, K Yokoyama
PUBLIC KEY CRYTOGRAPHY1751 210 - 222 2000
Order counting of elliptic curves defined over finite fields of characteristic 2 Peer-reviewed
Tetsuya Izu, Jun Kogure, Masayuki Noro, Kazuhiro Yokoyama
The Transactions of the Institute of Electronics,Information and Communication Engineers. A82 ( 8 ) 1253 - 1260 8 1999
A modular method to compute the rational univariate representation of zero-dimensional ideals Peer-reviewed
M Noro, K Yokoyama
JOURNAL OF SYMBOLIC COMPUTATION28 ( 1-2 ) 243 - 263 7 1999
Parameters for secure elliptic curve cryptosystem -improvements on schoof’s algorithm Peer-reviewed
Tetsuya Izu, Jun Kogure, Masayuki Noro, Kazuhiro Yokoyama
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)1431 253 - 257 1998
Efficient implementation of Schoof's algorithm Peer-reviewed
T Izu, J Kogure, M Noro, K Yokoyama
ADVANCES IN CRYPTOLOGY - ASIACRYPT'981514 66 - 79 1998
Factoring polynomials over algebraic extension fields Peer-reviewed
Masayuki Noro, Kazuhiro Yokoyama
城西大学情報科学研究紀要(Josai Information Science Researches)9 ( 1 ) 11 - 33 1 1998
A modular method for computing the Galois groups of polynomials Peer-reviewed
K. Yokoyama
Journal of Pure and Applied Algebra117-118 617 - 636 1997
Computation of the splitting fields and the Galois groups of polynomials Peer-reviewed
H Anai, M Noro, K Yokoyama
ALGORITHMS IN ALGEBRAIC GEOMETRY AND APPLICATIONS143 29 - 50 1996
Localization and primary decomposition of polynomial ideals Peer-reviewed
Takeshi Shimoyama, Kazuhiro Yokoyama
Journal of Symbolic Computation22 ( 3 ) 247 - 277 1996
Finding roots of unity among quotients of the roots of an integral polynomial Peer-reviewed
Kazuhiro Yokoyama, Ziming Li, Istvan Nemes
Proceedings of ISSAC 1995 85 - 89 7 1995
MULTI-MODULAR APPROACH TO POLYNOMIAL-TIME FACTORIZATION OF BIVARIATE INTEGRAL POLYNOMIALS Peer-reviewed
K YOKOYAMA, M NORO, T TAKESHIMA
JOURNAL OF SYMBOLIC COMPUTATION17 ( 6 ) 545 - 563 6 1994
On Hensel construction of eigenvalues and eigenvectors of matrices with polynomial entries Peer-reviewed
Kazuhiro Yokoyama, Taku Takeshima
Proceedings of ISSAC 1993 218 - 224 7 1993
SOLUTIONS OF SYSTEMS OF ALGEBRAIC EQUATIONS AND LINEAR-MAPS ON RESIDUE CLASS RINGS Peer-reviewed
K YOKOYAMA, M NORO, T TAKESHIMA
JOURNAL OF SYMBOLIC COMPUTATION14 ( 4 ) 399 - 417 10 1992
ON DISTANCE TRANSITIVE GRAPHS WHOSE AUTOMORPHISM-GROUPS ARE AFFINE Peer-reviewed
K YOKOYAMA
JOURNAL OF COMBINATORIAL THEORY SERIES B55 ( 2 ) 190 - 235 7 1992
代数制約の処理 Peer-reviewed
竹島 卓, 横山 和弘
コンピューターソフトウェア9 ( 6 ) 16 - 30 1992
ON FACTORING MULTI-VARIATE POLYNOMIALS OVER ALGEBRAICALLY CLOSED FIELDS Peer-reviewed
K YOKOYAMA, M NORO, T TAKESHIMA
ISSAC 90 : PROCEEDINGS OF THE INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION 297 - 297 1990
ON DETERMINING THE SOLVABILITY OF POLYNOMIALS Peer-reviewed
K YOKOYAMA, M NORO, T TAKESHIMA
ISSAC 90 : PROCEEDINGS OF THE INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION 127 - 134 1990
Computing primitive elements of extension fields Peer-reviewed
Kazuhiro Yokoyama, Masayuki Noro, Taku Takeshima
Journal of Symbolic Computation8 ( 6 ) 553 - 580 1989
On Factoring and Computation of GCD over Euclidean Rings : An Application of Lattice Algorithms. Peer-reviewed
Kazuhiro Yokoyama, Taku Takeshima
5 ( 5 ) 42 - 61 1 1 1988
On Distance Transitive Graphs in Which the Stabilizer of a Point Contains an Alternating Group Peer-reviewed
Kazuhiro Yokoyama
European Journal of Combinatorics9 ( 4 ) 379 - 390 1988
DISTANCE TRANSITIVE GRAPHS AND FINITE SIMPLE-GROUPS Peer-reviewed
CE PRAEGER, J SAXL, K YOKOYAMA
PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY55 1 - 21 7 1987
外川拓真, 横山和弘, 岩根秀直, 松崎拓也
RIMS研究集会「数式処理とその周辺分野の研究 — Computer Algebra and Related Topics」 12 2016
楕円曲線の同種写像の公式計算 (数式処理とその周辺分野の研究)
横山 和弘, 野呂 正行
数理解析研究所講究録1955 146 - 157 7 2015
グレブナー基底候補の高速生成法とその検証について (数式処理とその周辺分野の研究)
野呂 正行, 横山 和弘
数理解析研究所講究録1907 122 - 131 7 2014
Computer algebra, its history and current state-with the Gröbner basis and quantifier elimination as the center Invited Peer-reviewed
Masayuki Noro, Kazuhiro Yokoyama
SUGAKU66 ( 3 ) 298 - 309 2014
RL-003 A customer information analysis between enterprises using homomorphic encryption
Yasuda Masaya, Shimoyama Takeshi, Yokoyama Kazuhiro, Kogure Jun
12 ( 4 ) 15 - 22 20 8 2013
グレブナー基底候補の正当性検証について (数式処理 : その研究と目指すもの)
野呂 正行, 横山 和弘
数理解析研究所講究録1843 38 - 50 7 2013
小副川 健, 望月 祐志, 横山 和弘
数理解析研究所講究録1815 152 - 162 10 2012
第二量子化演算子の代数的扱いとその実装
小副川 健, 齋藤 雅明, 望月 祐志, 横山 和弘
数式処理18 ( 2 ) 33 - 36 1 5 2012
小副川 健, 望月 祐志, 横山 和弘
数式処理18 ( 1 ) 16 - 19 1 12 2011
OSOEKAWA TAKESHI, MOCHIZUKI YUJI, YOKOYAMA KAZUHIRO
RIMS Kokyuroku1759 99 - 104 9 2011
Algebraic approach to discrete-time polynomial spectral factorization
Kanno Masaaki, Yokoyama Kazuhiro, Anai Hirokazu, Hara Shinji
JMI1 57 - 68 2009
穴井 宏和, 横山 和弘
数学セミナー47 ( 4 ) 82 - 88 4 2008
穴井 宏和, 横山 和弘
数学セミナー47 ( 3 ) 79 - 85 3 2008
穴井 宏和, 横山 和弘
数学セミナー47 ( 1 ) 76 - 82 1 2008
管野 政明, 穴井 宏和, 横山 和弘
数式処理14 ( 2 ) 18 - 22 1 12 2007
穴井 宏和, 横山 和弘
数学セミナー46 ( 12 ) 75 - 81 12 2007
穴井 宏和, 横山 和弘
数学セミナー46 ( 11 ) 64 - 71 11 2007
real root countingに関する話題 (Computer Algebra : Design of Algorithms, Implementations and Applications)
木村 欣司, 平野 照比古, 荻田 武史, 山澤 宏樹, 曽我部 知広, 横山 和弘
数理解析研究所講究録1456 180 - 187 11 2005
Anai Hirokazu, Yokoyama Kazuhiro
RIMS Kokyuroku1456 65 - 69 11 2005
Anai Hirokazu, Yokoyama Kazuhiro, Hara Shinji
RIMS Kokyuroku1456 49 - 57 11 2005
横山 和弘
数理解析研究所講究録1395 8 - 15 10 2004
Fujimoto Mitsushi, Suzuki Masakazu, Yokoyama Kazuhiro
RIMS Kokyuroku1381 42 - 50 6 2004
頂点作用素代数研究の計算機による証明支援 (Computer Algebra : Algorithms, Implementations and Applications)
横山 和弘
数理解析研究所講究録1335 111 - 118 7 2003
有限体上の多変数多項式の因数分解について (Computer Algebra : Algorithms, Implementations and Applications)
野呂 正行, 横山 和弘
数理解析研究所講究録1295 75 - 79 11 2002
Symmetric Key Block Cipher SC2000
SHIMOYAMA Takeshi, YANAMI Hitoshi, YOKOYAMA Kazuhiro, TAKENAKA Masahiko, ITOH Kouichi, YAJIMA Jun, TORII Naoya, TANAKA Hidema
Technical report of IEICE. ISEC100 ( 324 ) 101 - 130 29 9 2000
A Modular Method to Compute the Rational Univariate Representation of Zero-Dimensional Ideals
NORO Masayuki, YOKOYAMA Kazuhiro
7 ( 3 ) 37 - 38 1 11 1999
Elliptic Curve Crypto System
38 ( 9 ) 587 - 587 10 9 1999
連立代数方程式の種々の解法 (特集 数式処理とその周辺--最新事情からソフトの評価・応用まで)
横山 和弘, 野呂 正行
数理科学36 ( 11 ) 21 - 31 11 1998
Atkin,Elkies らによる Schoof のアルゴリズム改良の実装について(数式処理における理論と応用の研究)
小暮 淳, 伊豆 哲也, 横山 和弘
数理解析研究所講究録1038 230 - 243 4 1998
Implementation of Schoof's Algorithm modified by Atkin-Elkies
KOGURE Jun, IZU Tetsuya, YOKOYAMA Kazuhiro
Technical report of IEICE. ISEC97 ( 461 ) 1 - 12 19 12 1997
Prime Decomposition of Radical Ideals and Algebraic Factorization of Polynomials
NORO Masayuki, YOKOYAMA Kazuhiro
5 ( 1 ) 36 - 37 1 12 1996
多項式環上の素イデアル分解について(数式処理における理論とその応用の研究)
下山 武司, 野呂 正行, 横山 和弘
数理解析研究所講究録941 ( 941 ) 7 - 14 3 1996
Radical Representation of Polynomial Roots
RIMS Kokyuroku920 9 - 24 8 1995
零因子をもつ環上の逆行列計算について(数式処理における理論と応用の研究)
竹島 卓, 横山 和弘
数理解析研究所講究録848 17 - 26 9 1993
TAKESHIMA Taku, YOKOYAMA Kazuhiro, Taku Takeshima, Kazuhiro Yokoyama
9 ( 6 ) 474 - 488 16 11 1992
竹島 卓, 横山 和弘, 野呂 正行
数理解析研究所講究録753 18 - 21 5 1991
横山 和弘
数理解析研究所講究録722 76 - 78 5 1990
Grobner Basis の基礎(数式処理と数学研究への応用)
横山 和弘
数理解析研究所講究録722 64 - 75 5 1990
modular 算法による多項式GCD計算について(数式処理と数学研究への応用)
横山 和弘, 野呂 正行, 竹島 卓
数理解析研究所講究録646 74 - 77 2 1988
多項式と計算機代数
横山, 和弘( Role: Sole author)
朝倉書店 2 2022 ( ISBN:9784254117677 )
Algorithms of Quantifier Elimination and their Applications
Hirokazu Anai, Kazuhiro Yokoyama( Role: Joint author)
8 2011 ( ISBN:9784130614061 )
岩波数学辞典第4版
横山 和弘( Role: Other , 計算機代数)
岩波書店 3 2007
グレブナー基底の計算 基礎篇,計算代数入門
横山 和弘, 野呂正行( Role: Joint author)
東京大学出版会 6 2003
Application of Computer Algebra to Engineering Other
計算機代数の暗号および制御、設計への応用 Other
オーストリア ヨハネスケプラー大学記号計算研究所(RISC-Linz) 文部科学省在外研究員 Other
フランス パリ第6大学 情報研究所(LIP6) 招聘教育研究者 Other
オーストリア ヨハネスケプラー大学記号計算研究所(RISC-Linz) 客員講師 Other
グレブナー基底計算の理論計算量解析とその効率的な実装
日本学術振興会 科学研究費助成事業
横山 和弘, 野呂 正行, 篠原 直行
4 2021 - 3 2024
Grant number:21K03377
Grant amount:\4030000 ( Direct Cost: \3100000 、 Indirect Cost:\930000 )
令和3年度は第1段階の研究を行った。
理論解析では、SBAアルゴリズムの計算量やグレブナー基底の計算の高速化に有効とされる多項式環の特定の項順序に関する文献調査を行い、利用できる数学理論の選別を行った。また、グレブナー基底にはならなくても、求めたい形のイデアル生成元を計算する戦略も検討した。これらは令和4年度中に成果をまとめる予定である。
SBAアルゴリズムの実装とその有効性検証では、多項式環の項順序と整合しない(compatibleでない)加群項順序を用いたSBAアルゴリズムは停止性が保証されないが,
入力イデアルをある項順序に関するグレブナー基底とすることで, Hilbert-Poincare 級数による停止条件を用いて目的項順序に関するグレブナー基底を有限回の手間で計算する方法を考案した。この方法ではsyzygy criterionにより0簡約が生じないため、モジュラー演算を用いなくても効率よく有理数体上のグレブナー基底が求められる。当初は、非0次元イデアルに対してのみ有効であると予想したが, 実際には 0次元でも有効な場合があることがわかった。
応用実験では、連立代数方程式に帰着できるいくつかの問題で、SBAアルゴリズムを直接適用する段階ではないが、既存の方法の実験を行った。実験計画法に関するある数え上げ・分類問題では、この方程式は0次元で解が35200個あるが、Risa/Asir の準素分解機能を用いて効率よく求めることができた。暗号応用では、同種写像暗号の基礎となる数学計算にグレブナー基底計算を利用した改良を雑誌で発表した。多変数公開鍵暗号の安全性評価では、連立2次方程式 (MQ問題) を扱い、S多項式及びreductorの選択方法として,多項式の2番目に大きな項に注目した新たな方法を提案し、効率よく計算できることを数値実験的に立証した。
Further development of algorithms for Groebner basis computation
Japan Society for the Promotion of Science Grants-in-Aid for Scientific Research
YOKOYAMA Kazuhiro
4 2018 - 3 2021
Grant number:18K03432
Grant amount:\4290000 ( Direct Cost: \3300000 、 Indirect Cost:\990000 )
Groebner bases, bases of polynomial ideals, have useful computational properties and used in a various areas such as mathematics and engineering science. However, there still remains a problem on their computational efficiency. In this project, focusing an efficient technique named SBA, we succeeded in completing its theoretical correctness and termination, and an efficient its implementation on a
real computer. As a theoretical result, under a reasonable condition "compatibility" on monomial orders, the correctness and termination of our SBA are theoretically guaranteed. By its implementation on a real computer, we devised several algorithms based on SBA, which have certain superiority to existing algorithms. As application study, we applied Groebner basis computation to analyze the security level of public key cryptosystems.
Efficient methods for Groebner basis computation, verification and thier applications
Japan Society for the Promotion of Science Grants-in-Aid for Scientific Research
NORO Masayuki, AOYAMA Toru
4 2015 - 3 2018
Grant number:15K05008
Grant amount:\4810000 ( Direct Cost: \3700000 、 Indirect Cost:\1110000 )
We published a paper describing various modular methods for efficient Groebner basis computation. We published two papers concerned with the signature based
algorithm (SBA). In these papers we proposed several variants of SBA and showed their correctness and termination. F4 and SBA are main methods for attacking elliptic curve cryptography and post-quantum cryptography. We analyzed the complexity when we applied these methods to cryptanalysis. We studied the system of partial differential equations (PDE) satisfied by the cumulative distribution function (CDF) of Wishart matrices and proposed an efficient method for deriving a system of PDE satisfied by the restriction of the CDF on diagonal regions. This is an application of Groebner basis theory to statistics that is a very active research area.
Developments ofcomputational theory of real algebraic geometry for optimization problem
Japan Society for the Promotion of Science Grants-in-Aid for Scientific Research
ANAI Hirokazu, YOKOYAMA Kazuhiro, YANAMI Hitoshi, IWANE Hidenao
2009 - 2012
Grant number:21340025
Grant amount:\17160000 ( Direct Cost: \13200000 、 Indirect Cost:\3960000 )
In this project we have developed effective and efficient quantifier elimination algorithms for optimization problems. We had many original results on quantifier elimination algorithms and published them in international academic journals. Moreover, we also published textbooks on quantifier elimination and optimization.
記号代数的近似と数値的近似の組合せによる数値数式融合計算の研究
日本学術振興会 科学研究費助成事業
横山 和弘
4 2006 - 3 2009
Grant number:18654025
Grant type:Competitive
数値計算と記号代数計算の双方を組合せる融合計算が「計算の壁を破る」可能性を持つものとして期待されていますが、個々の具体的な問題に対する事例研究の域をでていません。本研究では、有効な数値数式の融合をシステマチックに行える戦略・理論を構築することを最終的な目標とし、そのための第1歩として、『多項式の根、もしくは、連立代数方程式の解の近似を利用した計算の効率化』という枠の下で、2種類の近似値、「数値的な近似値」と「記号代数的な近似値」の組合せの戦略を構築することを試みています。戦略の構築のための具体的な目標とし、以下を設定していました。
(a)2種類の近似の特性を解析し、その用途、効果を明らかにする。
(b)計算対象を豊富に用意し、その融合による適用法を個々に構築しその効果を判定する。
(c)上記結果を総括し、その中から一般的な適応指針、すなわち、戦略法を確立する。
(a)に関しては、記号代数的な近似の構成法であるHensel構成とその実際の数への引き戻しを重点に九州大学のXavier博士ら若手研究者たちと討論を重ねました。(b)では、多項式のガロア群と分解体計算を継続して取り上げ、パリ第6大学のRenault博士との共同研究を行い、異なる複数の近似を用いることで計算の効率化が実現できることを検証し、成果を国際会議で発表しました。また、さらなる結果をまとめ、平成21年度に開催される国際会議に投稿し受理されました。(c)の総括として複数の異なる近似を利用する方式の開発の有効な切り口が本研究を通して得られ、今後より発展させる道筋ができたものと思います。
Research on rationally connected varieties
Japan Society for the Promotion of Science Grants-in-Aid for Scientific Research
SATO Eiichi, FURUSHIMA Mikio, YOKOYAMA Kazuhiro, TAKAYAMA Shigeharu
2007 - 2009
Grant number:19540037
Grant amount:\4420000 ( Direct Cost: \3400000 、 Indirect Cost:\1020000 )
For the study of higher dimensional algebraic varieity X we take a hyperplane section A of X for the use of Lefschetz Theorem and try to find the structure of X by the one of A.This time we studied whether the bundle structure of A is preserved to X and next the structure of blowing-up is also so. Moreover generalizing the method,we investigate the preservation of the extremal ray.As applications we get the following : Theorem. Let us consider a sequence {X_n} of smooth projective varieties so that X_n s an ample divisor in X_{n+1} for each n. Here n runs over each positive integer. Assume X_1 has an elementary contraction f : X_1 -> Y with dim X_1 - dim Y > 1 and dim X_1 > 2.Then for each n there is an inductively extended morphism f_n : X_n -> Y with f_{n-1}=i_{n-1}f_n where i_{n-1} : X_{n-1} -> X_{n} is a natural embedding. For a very general point y of Y a smooth fiber of f_n is a weighted complete intersection for large enough n.The above theorem says that a variety enjoying a sequence {X_n} of smooth projective varieties has the structure of property "symmetry".
The Study of theoretical aspects and practical aspect on Grobner Bases
Japan Society for the Promotion of Science Grants-in-Aid for Scientific Research
HIBI Takayuki, SAITO Mutsumi, TAKEMURA Akimichi, YOKOYAMA Kazuhiro, OHSUGI Hidefumi, OAKU Toshinori, MATSUI Yasuko, SAITO Kyoji, TAKAYAMA Nobuki, AOKI Satoshi
2006 - 2009
Grant number:18340008
Grant amount:\15850000 ( Direct Cost: \13600000 、 Indirect Cost:\2250000 )
With taking the persistence and the internationalization into consideration, in collaboration with many researchers in various field including computational commutative algebra, computational algebraic analysis, computational algebraic statistics as well as algebraic algorithm, this research project strongly developed the study on the theoretical effectivity and practical effectivity of Grobner bases and succeeded in establishing the foundations of the modern theory of Grobner bases. At present, in order for our research group to be one of the strongest international footholds on the theoretical and practical research of Grobner bases, the CREST research project "Harmony of Grobner bases and the modern industry society," whose team leader is Takayuki Hibi, which is supported by JST (Japan Science and Technology Agency) follows this research project.
記号・代数計算に基づく計算技法の一般的適用方法論の確立と適用規模の拡大
(独)科学技術振興機構 受託研究(一般受託研究)
Development of efficient algorithms and software for solving parametric systems
Japan Society for the Promotion of Science Grants-in-Aid for Scientific Research
NORO Masayuki, TAKAYAMA Nobuki, SUZUKI Akira, YOKOYAMA Kazuhiro, SATO Yosuke, OHARA Katsuyoshi
2005 - 2007
Grant number:17340028
Grant amount:\14290000 ( Direct Cost: \13300000 、 Indirect Cost:\990000 )
The purpose of this research is to develop efficient algorithms and software for solving polynomial systems or system of differential equations containing parameters. The research results are as follows:
1. Dynamic evaluation allows us to define algebraic numbers by non-irreducible defining polynomial. We reformulated the dynamic evaluation by using the notion of ideal quotient, and we proposed a modular method to improve the computation. We applied the new method for the computation of discrete comprehensive Groebner basis.
2. We proposed a new method for computing comprehensive Groebner basis (CGB) and comprehensive Groebner system (CGS). This method can be implemented by using Groebner basis computation over usual polynomial ring and it improves the computation of CGB or CGS.
3. We investigated the structures of polynomial ideals with parameters. In particular, we focused on the stability of parametric polynomial ideals and we found a periodicity and asymptotic behavior of such ideals in simple cases.
4. We proposed algorithms for doing division with remainder in rings of differential operators over the field of rational functions or the power series rings. We constructed convergent solutions of A-hypergeometric systems. By using the system of difference equations for Gauss hypergeometric functions, we derived their quadratic relations. For computing these objects we developed a software package named ‘yang' for computing in rings of difference-differential operators over the field of rational functions.
5. All the results above have been implemented in a computer algebra system Risa/Asir, which is available from our web site. In the conferences of Japan Mathematical Society, we held workshops named "Mathematical software and free documents". Furthermore, we constructed a virtual machine on which KNOPPIX/Math runs and we distributed DVDs containing the virtual machine.
数値処理と数式処理の融合による計算機援用解析学の可能性に関する基礎的研究
日本学術振興会 科学研究費助成事業
中尾 充宏, 吉川 敦, 横山 和弘
2005 - 2007
Grant number:17654026
Grant amount:\3300000 ( Direct Cost: \3300000 )
研究分担者がそれぞれの分担課題に関して恒常的に検討を続け、以下のような研究実績を得た。
1.中尾は、前年度に引き続き非線形楕円型境界値問題および定常Navier-Stokes方程式の解に対する数値的検証法の改良・拡張について検討し、特に本年度は、以下の成果を得た。(1)楕円型方程式の検証に関して、double turning pointの検証法を定式化し具体例を与えた。 (2)非凸領域上の定常Navier-Stokes方程式で記述されるStep-flow問題に対してその解の精度保証付きで計算することに成功した。 (3)特異随伴作用素をもつ楕円型問題に対する有限要素解の構成的なL-2誤差評価について、Aubin-Nitscheの技巧を用いない計算機援用的方法により数値的に評価する知見を得た。 (4)空間3次元熱対流問題の精度保証に関して、新たな分岐解の検証定式化とその実例を与えた。
2.吉川は、ソボレフ空間の計算可能構造について、数値解析における有限要素法との関連を見込むために、ソボレフ関数の近似と近似の評価の管理を帰納的関数により行う手法について知見を得た。
3.横山は、制御におけるパラメータ値の決定の最適化問題に対して、記号的代数的手法を適用し、大域的最適値を正確に求めることに成功した。数学研究応用では、逆ガロア問題において数値計算による証明を行い、さらに分解体計算では代数的近似を利用した高速化を実現した。
Realization of decompositions of algebraic structures on real computer
Japan Society for the Promotion of Science Grants-in-Aid for Scientific Research
YOKOYAMA Kazuhiro, NORO Masayuki
4 2003 - 3 2006
Grant number:15340011
Grant type:Competitive
The goal of the project consists of two aims : The first aim is to examine how high/deep mathematical operations on algebraic structures can be executed on real computer by concentrating on decompositions of algebraic structures. Using symbolic and algebraic computation, we try to realize the mathematical operations related to "decomposition". The second one is to utilize realized operations for studies on mathematics as computational tools. The realized mathematical operations on computer shall support mathematicians to investigate unsolved problems and it can produce certain computer-assisted-proofs. Extending the ability of such computations, we apply those to real engineering problems. For those aims, we selected a number of themes, for which we developed effective/efficient algorithms, implemented those, and examined their ability on computational experiments. We have obtained satisfactory results and found promising approaches for realization of more higher/deeper mathematical operations. We list themes and give details for each :
(1)Commutative Algebra :
For prime decomposition of polynomial ideals over finite fields, we obtained an efficient algorithm and its practical implementation. For polynomial ideals with parametric exponents, we defined certain stability of those ideals based on "forms of Groebner bases", and gave a complete algorithm for deciding such stability for simpler cases. We applied "numeric-symbolic computation" to the CAD algorithm for quantifier elimination.
(2)Commutative Algebra with High Symmetry :
We obtained a practical method for computing the splitting field of a polynomial with rational coefficients by using p-adic approximations of its roots and information of its Galois group.
(3)Non-Commutative Algebra :
We obtained a computer-assisted-proof in classification of irreducible modules of the vertex operator algebra derived from a lattice.
(4)Supports for Mathematics and Engineering :
We also obtained a computer-assisted-proof in solving an unsolved conjecture related algebraic curves, and we also applied Groebner bases technique successfully to problems in control theory.
計算可換代数と計算代数幾何についての国際研究集会の企画調査
日本学術振興会 科学研究費助成事業
日比 孝之, 齋藤 睦, 竹村 彰通, 横山 和弘, 大杉 英史, 大阿久 俊則
2006 - 2006
Grant number:18634001
Grant amount:\3200000 ( Direct Cost: \3200000 )
研究代表者らは、従来から、組合せ論と計算可換代数に関する国際研究集会を継続的に開催し、当該分野の国際的な研究活動を円滑に推進させる重要な役割を担ってきた。研究代表者らは、類似の趣旨の国際研究集会「計算可換代数と計算代数幾何」を2008年6月、札幌に於いて開催する準備を進めている。目下の所、当該国際研究集会の根幹となる研究領域は、D加群とアルゴリズム、ジェネリックイニシャルイデアルの理論と実践、シテジーとヒルベルト函数、応用数学・情報数学における計算代数幾何的な展開、グレブナー基底の効率的計算、とするのが有力である。当該企画調査では、それらの研究領域の妥当性を慎重に審議した。具体的には、研究代表者と研究分担者が5回の連絡会議を開催し、会議を担当する分担者が研究領域の調査結果を報告し、海外招待講演者の候補者などを議論した。以下、連絡会議の開催時期、開催場所、審議する研究領域、会議を担当した分担者氏名を記載する。
●第1回(2006年6月、京都)「D加群とアルゴリズム」
齋藤睦 大阿久俊則 高山信毅
●第2回(2006年7月、東京)「ジェネリックイニシャルイデアル」
横山和弘 大杉英史 大阿久俊則
●第3回(2006年9月、札幌)「シチジーとヒルベルト函数」
齋藤睦 大杉英史 高山信毅 (Juergen Herzog)
●第4回(2006年11月、京都)「情報数学における計算代数的な展開」
竹村彰通 阪田省二郎 松井泰子 青木敏
●第5回(2006年1月、京都)「グレブナー基底の効率的計算」
横山和弘 松井泰子 高山信毅
数理モデリングの基礎技術
富士通研究所 受託研究
グレブナー基底の理論的有効性と実践的有効性に関する共同研究の企画調査
日本学術振興会 科学研究費助成事業
日比 孝之, 齋藤 睦, 竹村 彰通, 大阿久 俊則, 横山 和弘, 大杉 英史
2005 - 2005
Grant number:17634001
Grant amount:\2900000 ( Direct Cost: \2900000 )
研究代表者と研究分担者が研究連絡会議を開催し、グレブナー基底の理論的有効性と実践的有効性に関する共同研究の企画調査を実施する旨の研究計画に従い、5月(東京大学)、8月(立教大学)、9月(東京大学)、11月(大阪大学)と研究連絡会議を開催し、それぞれ、竹村彰通が計算代数統計の、大阿久俊則が計算代数解析の、大杉英史が計算可換代数と計算代数幾何の、横山和弘と松井泰子がグレブナー基底の計算の効率化の研究領域に関する調査結果を報告した。なお、8月の研究連絡会議は、日本学術振興会の国際研究集会(立教大学、2005年8月22日〜26日)Theoretical Effectivity and Practical Effectivity of Grobner Basesに付随して開催し、拡大研究連絡会議と称し、Juergen Herzog(ドイツ)、Henry P.Wynn(イギリス)、Uli Walther(米国)を招聘した。海外招聘者は、グレブナー基底の理論的有効性と実践的有効性に関し、それぞれの専門領域における欧米諸国の研究の現状を報告し、組織的な国際共同研究に発展させる際の具体的な指針についての貴重な意見を述べた。
企画調査の結果、今後、我が国において、少なくとも5年以上の長期に亘って継続されるグレブナー基底の理論と実践に関する共同研究を推進するための総括的な方針を擁立することができ、永続的な国際共同研究に発展することを視野に入れ、実際の研究活動を展開する準備が整った。企画調査の結果を踏まえ、その実際の研究活動とし、京都大学数理解析研究所、平成18年度、プロジェクト研究「グレブナー基底の理論的有効性と実践的有効性」が始まる。
記号・代数計算による最適化問題解法と定理自動証明の研究
日本学術振興会 科学研究費助成事業
横山 和弘, 吉川 敦, 鈴木 昌和, 中尾 充弘, 穴井 宏和
4 2002 - 3 2004
Grant number:14654024
Grant type:Competitive
最適化問題に対する新しいアプローチである記号・代数計算を用いたパラメータを含んだまま正確に解く方法の確立を目指し、(1)ベースとなる記号・代数計算理論とその技術の展開と(2)成功事例の発掘とそのためのアルゴルズムの改良と支援ツール構築を行った。
(1)では、上位レベルである限定子除去法、パラメータ付きの多項式イデアル操作、パラメータ無しの多項式イデアル操作、に分け、最下層のパラメータ無し多項式イデアル操作については、正標数の場合の素イデアル分解アルゴリズムの更なる改良とその計算機上の実装を行い、正標数での問題の克服と計算の効率化に成功した。次のレベルであるパラメータ付きの多項式イデアル操作については、海外共同研究者Weipsfenning教授との研究討論を通じ、指数部分にパラメータを持つ場合を世界に先駆けて取り扱い、0次元の場合において、零点の周期性や有限性を発見し、その計算法を得た。この成果は、preprintとし、国際会議に投稿中である。さらに、係数にパラメータを含む場合についての一般的な解法についてもComprehensive Groebner basis計算法の拡張として考え、研究を進めている。
(2)では、研究分担者の穴井と定期的にセミナーおよび研究討論を行い、実際の制御計算への限定子除去法の適用を検討してきた。穴井は独自の支援計算ツールSyNRACの構築を開始し、計算機実験を行った。また、記号・代数計算の啓蒙活動として、グレブナー計算に関する書籍を東京大学出版会より出版し、さらに限定子除去法に関する啓蒙書を準備している。また、研究分担者の鈴木は定理自動証明に関して、より一般的な枠組である「数学知識データの数学研究・教育への活用」の中で、計算機上での実現のためのフォーミュレーションを開始した。
今後、代表者と穴井は、原教授(東京大学)と共同で、萌芽研究での成果を集約し、この経験をベースに、新たなシミュレーション技術の開発と実際のシステムを構築計画を立て、科学技術振興機構・戦略的創造研究推進事業「シミュレーション技術の革新と実用化基盤の構築」の中の「数値/数式ハイブリッド計算に基づくロバスト最適化プラットフォームの構築」として発展させることになった。
Development of high performance computer algebra software
Japan Society for the Promotion of Science Grants-in-Aid for Scientific Research
NORO Masayuki, TAKAYAMA Nobuki, YOKOYAMA Kazuhiro, OHARA Katsuyoshi, SAITO Masahiko
2002 - 2004
Grant number:14340036
Grant amount:\8700000 ( Direct Cost: \8700000 )
We developed the following new algorithms and implemented them in Risa/Asir :
(1)a polynomial-time bivariate polynomial factorization algorithm over small finite fields,
(2)an algorithm for computing minimal prime divisors of a polynomial ideal over small finite fields,
(3)an algorithm for computing the global b-function,
(4)an efficient algorithm for numerical computation of multivariate hypergeometric functions,
(5)a method for deriving quadratic relations for generalized hypergeometric functions,
(6)a tangent cone algorithm in the ring of differential operators over power series ring.
We implemented the following new facilities in Risa/Asir :
(1)a new package for computing Groebner basis with a new data representation,
(2)a new package for efficient computation in algebraic number fields.
We gave the following applications.
(1)We exactly solved a polynomial system concerned with quantum computing.
(2)We proved that W_3 algebra of central charge 6/5 is realized as a subalgebra of a lattice vertex operator algebra and classify its irreducible modules.
Study on Number Theoretic Algorithms and Developments of Systems for Number Theory
Japan Society for the Promotion of Science Grants-in-Aid for Scientific Research
NAKAMULA Ken, OKAMOTO Tatsuaki, KURATA Toshihiko, TSUMURA Hirofumi, NAGAO Koh-ichi, KIDA Masanari
2001 - 2003
Grant number:13440013
Grant amount:\6500000 ( Direct Cost: \6500000 )
As in the references below, many theoretical results were obtained on number theoretic algorithms and their applications related to Scholz's conjecture on addition chains, Iwasawa invariants, elliptic curves, prime ideal decomposition in polynomial rings, hyperplane arrangement, unramified extensions of quadratic fields, several zeta values, class groups and unit groups of number fields, and cryptology, for example.
The 4th to 11th meetings were held each with about 50 participants by our main research organization JANT, and, the details are reported in http://ntw.e-one.uec.ac.jp/jant. As a result, we edited two special issues of Transactions of the JSIAM on the topics of the most advanced results and a general survey on number theoretic algorithms, and held an organized session at the yearly meeting of the JSIAM. To exchange with broader areas of algebra, we organized the 4th and 5th meetings of Algebra and Computation' (AC2001 and AC2003) each with almost 150 participants including those from abroad and published the proceedings at ftp://tnt.math.metro-u.ac.jp/pub/ac0[13]/. For wide international exchange of mathematical software research, we help the international Congress of Mathematical Softwares ICMS2002 at Beijin with about 110participants.
We took over the system for number theory SIMATH, developed in Germany since 1980's with highly efficient functions for elliptic curves, and have been maintaining and supporting via http://simath.info/. We have succeeded in implementing it on 64 bit machines, have released it as Ver.4.6, and packaged and installed the CEM up to cubic fields. After that, restricting ourselves to maintain SIMATH as it is because of the problems of license and development environment, we started to develop a new system NZMATH by the script language Python, released its alpha version at http://tnt.math.metro-u.ac.jp/nzmath/, and we are going to create a system for number theory constructed together by developers and users of the system.
Study on Algebraic Algorithms
Grant type:Competitive
Study on Algebraic Combinatorics
Grant type:Competitive
Study on Application of Algebraic Algorithm to Engineering
Grant type:Competitive
代数的算法に関する研究
Grant type:Competitive
代数的算法の工学(暗号等)への応用に関する研究
Grant type:Competitive
代数的組合せ論に関する研究
Grant type:Competitive
計算機代数国際会議 ISSAC
1 2005 - 12 2005
計算数学国際会議 ASCM
1 2003 - 12 2003
計算数学国際会議 ICMS
1 2002 - 12 2002
計算数学国際会議 ASCM
1 2001 - 12 2001
計算数学国際会議 ASCM
1 2000 - 12 2000
Journal of Symbolic Computation 計算ガロア理論特集号
1 1997 - 12 1997
計算機代数国際会議 ISSAC
1 1997 - 12 1997
計算機代数国際会議 ISSAC
1 1995 - 12 1995
ACM ISSAC Steering Committee
1 1900
計算機代数国際会議 ICPSS
1 1900