Pattern Recognition and the Whitehead Minimization Problem | Exploratory data analysis in abstract algebra: mathematical structure discovery through experiment.

Alexey Miasnikov

ISBN 10: 3838394453 / ISBN 13: 9783838394459

Published by LAP LAMBERT Academic Publishing, 2010

About this Item

Pattern Recognition and the Whitehead Minimization Problem | Exploratory data analysis in abstract algebra: mathematical structure discovery through experiment. | Alexey Miasnikov | Taschenbuch | 152 S. | Englisch | 2010 | LAP LAMBERT Academic Publishing | EAN 9783838394459 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.

Seller Inventory # 107421896

Bibliographic Details

• Title: Pattern Recognition and the Whitehead Minimization Problem | Exploratory data analysis in abstract algebra: mathematical structure discovery through experiment.
• Publisher: LAP LAMBERT Academic Publishing
• Publication Date: 2010
• Language: English
• ISBN 10: 3838394453
• ISBN 13: 9783838394459
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 10D millimeters 220 millimeters width by 150 millimeters height by 10 millimeters depth
• Weight: 244 grams
• Seller catalogs:
  • Bücher

About this title

Synopsis

In the book, "Experimentation in Mathematics," authors J.Borwein and D.Bailey write: "One of the greatest ironies of the information technology evolution is that while the computer was conceived and born in the field of pure mathematics, through the genius of giants such as John von Neumann and Alan Turing, until recently this marvelous technology had only a minor impact within the field that gave it birth." One of the main objectives of this research is to show that computers can be successfully used for analysis of mathematical problems. Our philosophy here that if an irregular or non-random behavior has been observed during an experiment then there must be a pure mathematical reason behind this phenomenon, which can be uncovered by a proper statistical analysis. Using methods of pattern recognition and exploratory data analysis we formulate conjectures and design nearly optimal heuristic algorithms for solving the Whitehead Minimization Problem. Several years later after this work was completed, the conjectures formulated in the book were proven by renowned mathematicians and a deterministic polynomial algorithm for the Whitehead-Minimization Problems was discovered.

About the Author

Alexey D. Myasnikov was born on January 11, 1973, in Kurgan, Russia. He received his PhD in Computer Science from the Graduate Center, CUNY, in 2005. Currently, he is a Research Professor in the Math. Dept. at the Stevens Institute of Technology. His research is centered on computational algebra, pattern recognition and algebraic cryptology.