In the summer of 1991 the Department of Mathematics and Statistics of the Universite de Montreal was fortunate to host the NATO Advanced Study Institute "e;Algebras and Orders"e; as its 30th Seminaire de mathematiques superieures (SMS), a summer school with a long tradition and well-established reputation.
In this book we develop various mathematical models of information dynamics, I -dynamics (including the process of thinking), based on methods of classical and quantum physics.
This book grew out of our lectures given in the Oberseminar on 'Cod- ing Theory and Number Theory' at the Mathematics Institute of the Wiirzburg University in the Summer Semester, 2001.
Algorithmic Principles of Mathematical Programming investigates the mathematical structures and principles underlying the design of efficient algorithms for optimization problems.
It has been stated in psychology that human brain arranges information in a way that improves efficiency in performing common tasks, for example, information about our spatial environment is conveniently structured for efficient route finding.
In the last years, it was observed an increasing interest of computer scientists in the structure of biological molecules and the way how they can be manipulated in vitro in order to define theoretical models of computation based on genetic engineering tools.
Projective geometry is a very classical part of mathematics and one might think that the subject is completely explored and that there is nothing new to be added.
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 present book is the outcome of efforts to introduce topological connectedness as one of the basic tools for the study of necessary conditions for an extremum.
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.
The aim of this volume is to make available to a large audience recent material in nonlinear functional analysis that has not been covered in book format before.
This volume contains both invited lectures and contributed talks presented at the meeting on Total Positivity and its Applications held at the guest house of the University of Zaragoza in Jaca, Spain, during the week of September 26-30, 1994.
Fundamentals of Convex Analysis offers an in-depth look at some of the fundamental themes covered within an area of mathematical analysis called convex analysis.
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.
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 aim of this work is to present in a unified approach a series of results concerning totally convex functions on Banach spaces and their applications to building iterative algorithms for computing common fixed points of mea- surable families of operators and optimization methods in infinite dimen- sional settings.
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.
The main purpose of these lectures is first to briefly survey the fundamental con- nection between the representation theory of the symmetric group Sn and the theory of symmetric functions and second to show how combinatorial methods that arise naturally in the theory of symmetric functions lead to efficient algorithms to express various prod- ucts of representations of Sn in terms of sums of irreducible representations.
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.
