This book is mainly devoted to some computational and algorithmic problems in finite fields such as, for example, polynomial factorization, finding irreducible and primitive polynomials, the distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types and new applications of finite fields to other areas of mathematics.
The last decade has seen two parallel developments, one in computer science, the other in mathematics, both dealing with the same kind of combinatorial structures: networks with strong symmetry properties or, in graph-theoretical language, vertex-transitive graphs, in particular their prototypical examples, Cayley graphs.
without a properly developed inconsistent calculus based on infinitesimals, then in- consistent claims from the history of the calculus might well simply be symptoms of confusion.
This volume contains the proceedings of the first ICASE/LaRC Work- shop on Computational Electromagnetics and Its Applications conducted by the Institute for Computer Applications in Science and Engineering and NASA Langley Research Center.
The subject of this book is connected with a new direction in mathematics, which has been actively developed over the last few years, namely the field of polynomial computer algebra, which lies at the intersection point of algebra, mathematical analysis and programming.
This book contains 33 papers from among the 41 papers presented at the Eighth International Conference on Fibonacci Numbers and Their Applications which was held at the Rochester Institute of Technology, Rochester, New York, from June 22 to June 26, 1998.
The explanation of the formal duality of Kerdock and Preparata codes is one of the outstanding results in the field of applied algebra in the last few years.
This volume contains the accounts of papers delivered at the Nato Advanced Study Institute on Finite and Infinite Combinatorics in Sets and Logic held at the Banff Centre, Alberta, Canada from April 21 to May 4, 1991.
The progress in computer technology during the last 10-15 years has enabled the performance of ever more precise quantum mechanical calculations related to structure and interactions of chemical compounds.
The aim of this volume is to reinforce the interaction between the three main branches (abstract, convex and computational) of the theory of polytopes.
We planned this book as a Festschrift for Smitty Stevens because we thought he might be retiring around 1974, although we knew very well that only death or deep illness would stop Smitty from doing science.
This volume contains the courses given at the Sixth Summer School on Complex Systems held at Facultad de Ciencias Fisicas y Maternaticas, Universidad de Chile at Santiago, Chile, from 14th to 18th December 1998.
This book contains the lectures given at the Conference on Dynamics and Randomness held at the Centro de Modelamiento Matematico of the Universidad de Chile from December 11th to 15th, 2000.
From Markov Jump Processes to Spatial Queues aims to develop a unified theory of spatial queues that yields concrete results for the performance analysis of mobile communication networks.
Practical Asymptotics is an effective tool for reducing the complexity of large-scale applied-mathematical models arising in engineering, physics, chemistry, and industry, without compromising their accuracy.
An up-to-date report on the current status of important research topics in algebraic geometry and its applications, such as computational algebra and geometry, singularity theory algorithms, numerical solutions of polynomial systems, coding theory, communication networks, and computer vision.
This volume contains all twenty-three of the principal survey papers presented at the Symposium on Ordered Sets held at Banff, Canada from August 28 to September 12, 1981.
Resolution Proof Systems: An Algebraic Theory presents a new algebraic framework for the design and analysis of resolution- based automated reasoning systems for a range of non-classical logics.
