Professor Nicholas N Govorun, corresponding member of the USSR Academy of Sciences, was the principal organizer of the precedent meetings held at Dubna (1979, 1983, 1985). Unfortunately, he passed away in 1989. This volume is to honor his support in Computer Algebra.This is perhaps the only meeting of the entire soviet union computer algebra community and foreign scientists. The meeting presented scientific results, plans for research facilities, and status reports of the basic areas of investigations. The fields covered include computer algebra systems and general algorithms as well as applied algorithms, programs and results in computer algebra applications (mainly in physics).
Professor Nicholas N Govorun, corresponding member of the USSR Academy of Sciences, was the principal organizer of the precedent meetings held at Dubna (1979, 1983, 1985). Unfortunately, he passed away in 1989. This volume is to honor his support in Computer Algebra.This is perhaps the only meeting of the entire soviet union computer algebra community and foreign scientists. The meeting presented scientific results, plans for research facilities, and status reports of the basic areas of investigations. The fields covered include computer algebra systems and general algorithms as well as applied algorithms, programs and results in computer algebra applications (mainly in physics).
In 1913, Russian imperial marines stormed an Orthodox monastery at Mt. Athos, Greece, to haul off monks engaged in a dangerously heretical practice known as Name Worshipping. Exiled to remote Russian outposts, the monks and their mystical movement went underground. Ultimately, they came across Russian intellectuals who embraced Name Worshipping—and who would achieve one of the biggest mathematical breakthroughs of the twentieth century, going beyond recent French achievements. Loren Graham and Jean-Michel Kantor take us on an exciting mathematical mystery tour as they unravel a bizarre tale of political struggles, psychological crises, sexual complexities, and ethical dilemmas. At the core of this book is the contest between French and Russian mathematicians who sought new answers to one of the oldest puzzles in math: the nature of infinity. The French school chased rationalist solutions. The Russian mathematicians, notably Dmitri Egorov and Nikolai Luzin—who founded the famous Moscow School of Mathematics—were inspired by mystical insights attained during Name Worshipping. Their religious practice appears to have opened to them visions into the infinite—and led to the founding of descriptive set theory. The men and women of the leading French and Russian mathematical schools are central characters in this absorbing tale that could not be told until now. Naming Infinity is a poignant human interest story that raises provocative questions about science and religion, intuition and creativity.
This book contains a collection of thoroughly refereed papers derived from the First IFIP WG 9.7 Conference on Soviet and Russian Computing, held in Petrozavodsk, Russia, in July 2006. The 32 revised papers were carefully selected from numerous submissions; many of them were translated from Russian. They reflect much of the shining history of computing activities within the former Soviet Union from its origins in the 1950s with the first computers used for military decision-making problems up to the modern period where Russian ICT grew substantially, especially in the field of custom-made programming.
The 1988 Nobel Prize winner establishes the subject's mathematical background, reviews the principles of electrostatics, then introduces Einstein's special theory of relativity and applies it to topics throughout the book.
this gap. In sixteen survey articles the most important theoretical results, algorithms and software methods of computer algebra are covered, together with systematic references to literature. In addition, some new results are presented. Thus the volume should be a valuable source for obtaining a first impression of computer algebra, as well as for preparing a computer algebra course or for complementary reading. The preparation of some papers contained in this volume has been supported by grants from the Austrian "Fonds zur Forderung der wissenschaftlichen For schung" (Project No. 3877), the Austrian Ministry of Science and Research (Department 12, Dr. S. Hollinger), the United States National Science Foundation (Grant MCS-8009357) and the Deutsche Forschungsgemeinschaft (Lo-23 1-2). The work on the volume was greatly facilitated by the opportunity for the editors to stay as visitors at the Department of Computer and Information Sciences, University of Delaware, at the General Electric Company Research and Development Center, Schenectady, N. Y. , and at the Mathematical Sciences Department, Rensselaer Polytechnic Institute, Troy, N. Y. , respectively. Our thanks go to all these institutions. The patient and experienced guidance and collaboration of the Springer-Verlag Wien during all the stages of production are warmly appreciated. The editors of the Cooperative editor of Supplementum Computing B. Buchberger R. Albrecht G. Collins R. Loos Contents Loos, R. : Introduction. . . . . . . . . . . . . . . . . . . . . . . . . . 1 Buchberger, B. , Loos, R. : Algebraic Simplification . . . . . . . . . . 11 Neubiiser, J. : Computing with Groups and Their Character Tables. 45 Norman, A. C. : Integration in Finite Terms. . . . . . . . . . . . . .
This book provides a systematic approach for the algorithmic formulation and implementation of mathematical operations in computer algebra programming languages. The viewpoint is that mathematical expressions, represented by expression trees, are the data objects of computer algebra programs, and by using a few primitive operations that analyze and
This first volume in the series "Algorithms and Computation in Mathematics", is destined to become the standard reference work in the field. Manuel Bronstein is the number-one expert on this topic and his book is the first to treat the subject both comprehensively and in sufficient detail - incorporating new results along the way. The book addresses mathematicians and computer scientists interested in symbolic computation, developers and programmers of computer algebra systems as well as users of symbolic integration methods. Many algorithms are given in pseudocode ready for immediate implementation, making the book equally suitable as a textbook for lecture courses on symbolic integration.
