From Combinatorics to Philosophy: The Legacy of G. -C. Rota provides an assessment of G. -C. Rota's legacy to current international research issues in mathematics, philosophy and computer science. This volume includes chapters by leading researchers, as well as a number of invited research papers. Rota's legacy connects European and Italian research communities to the USA by providing inspiration to several generations of researchers in combinatorics, philosophy and computer science. From Combin...
Advances in Combinatorics
This volume, as Andrew M. Odlzyko writes in the foreword, "commemorates and celebrates the life and achievements of an extraordinary person." Originally conceived as an 80th birthday tribute to Herbert Wilf, the well-known combinatorialist, the book has evolved beyond the proceeds of the W80 tribute. Professor Wilf was an award-winning teacher, who was supportive of women mathematicians, and who had an unusually high proportion of women among his PhD candidates. He was Editor-in-chief of the Am...
Asymptotic Combinatorics with Application to Mathematical Physics (NATO Science Series II, #77)
New and striking results obtained in recent years from an intensive study of asymptotic combinatorics have led to a new, higher level of understanding of related problems: the theory of integrable systems, the Riemann-Hilbert problem, asymptotic representation theory, spectra of random matrices, combinatorics of Young diagrams and permutations, and even some aspects of quantum field theory.
Selected Exercises in Algebra (La Matematica per il 3+2, #119) (UNITEXT, #119)
by Rocco Chirivi, Ilaria Del Corso, and Roberto Dvornicich
This book, the first of two volumes, contains over 250 selected exercises in Algebra which have featured as exam questions for the Arithmetic course taught by the authors at the University of Pisa. Each exercise is presented together with one or more solutions, carefully written with consistent language and notation. A distinguishing feature of this book is the fact that each exercise is unique and requires some creative thinking in order to be solved. The themes covered in this volume are: math...
New Trends in Intuitive Geometry (Bolyai Society Mathematical Studies, #27)
This volume contains 17 surveys that cover many recent developments in Discrete Geometry and related fields. Besides presenting the state-of-the-art of classical research subjects like packing and covering, it also offers an introduction to new topological, algebraic and computational methods in this very active research field. The readers will find a variety of modern topics and many fascinating open problems that may serve as starting points for research.
Special Functions 2000: Current Perspective and Future Directions (NATO Science Series II, #30)
The Advanced Study Institute brought together researchers in the main areas of special functions and applications to present recent developments in the theory, review the accomplishments of past decades, and chart directions for future research. Some of the topics covered are orthogonal polynomials and special functions in one and several variables, asymptotic, continued fractions, applications to number theory, combinatorics and mathematical physics, integrable systems, harmonic analysis...
Classification Algorithms for Codes and Designs. Algorithms and Computation in Mathematics
by Petteri Kaski and Patric R J Stergrd
Modern Projective Geometry (Mathematics and Its Applications, #521)
by Claude-Alain Faure and Alfred Froelicher
This monograph develops projective geometries and provides a systematic treatment of morphisms. It introduces a new fundamental theorem and its applications describing morphisms of projective geometries in homogeneous coordinates by semilinear maps. Other topics treated include three equivalent definitions of projective geometries and their correspondence with certain lattices; quotients of projective geometries and isomorphism theorems; and recent results in dimension theory.
Foundations of Discrete Mathematics with Algorithms and Programming
by R. Balakrishnan and Sriraman Sridharan
Discrete Mathematics has permeated the whole of mathematics so much so it has now come to be taught even at the high school level. This book presents the basics of Discrete Mathematics and its applications to day-to-day problems in several areas. This book is intended for undergraduate students of Computer Science, Mathematics and Engineering. A number of examples have been given to enhance the understanding of concepts. The programming languages used are Pascal and C.
From Combinatorics to Dynamical Systems (IRMA Lectures in Mathematics & Theoretical Physics, #3)
This volume contains nine refereed research papers in various areas from combinatorics to dynamical systems, with computer algebra as an underlying and unifying theme. Topics covered include irregular connections, rank reduction and summability of solutions of differential systems, asymptotic behaviour of divergent series, integrability of Hamiltonian systems, multiple zeta values, quasi-polynomial formalism, Pade approximants related to analytic integrability, hybrid systems. The interactio...
Courses on mathematical programming are now part of standard teaching programs of universities and institutes. The aim of this book is to introduce students of mathematics, economics, technology and other related subjects to the qualitative theory of mathematical programming in paired vector spaces. Prerequisite for the study of this book is only a basic knowledge of analysis, of elements of functional analysis and linear algebra. The application of elementary ideas of functional analysis is con...
Formal Properties of Finite Automata and Applications (Lecture Notes in Computer Science, #386)
The volume contains the proceedings of the 16th Spring School on Theoretical Computer Science held in Ramatuelle, France, in May 1988. It is a unique combination of research level articles on various aspects of the theory of finite automata and its applications. Advances made in the last five years on the mathematical foundations form the first part of the book. The second part is devoted to the important problems of the theory including star-height, concatenation hierarchies, and connections wi...
Graphs, Networks and Design: Conclusion
Graph Theory and Sparse Matrix Computation (The IMA Volumes in Mathematics and its Applications, #56)
When reality is modeled by computation, matrices are often the connection between the continuous physical world and the finite algorithmic one. Usually, the more detailed the model, the bigger the matrix, the better the answer, however, efficiency demands that every possible advantage be exploited. The articles in this volume are based on recent research on sparse matrix computations. This volume looks at graph theory as it connects to linear algebra, parallel computing, data structures, geometr...
On March 28~31, 1994 (Farvardin 8~11, 1373 by Iranian calendar), the Twenty fifth Annual Iranian Mathematics Conference (AIMC25) was held at Sharif University of Technology in Tehran, Islamic Republic of Iran. Its sponsors in~ eluded the Iranian Mathematical Society, and the Department of Mathematical Sciences at Sharif University of Technology. Among the keynote speakers were Professor Dr. Andreas Dress and Professor Richard K. Guy. Their plenary lec~ tures on combinatorial themes were complem...
Spanning Tree Results for Graphs and Multigraphs
by John T Saccoman, Charles L Suffel, and Daniel J Gross
Combinatorial Algebra: Syntax and Semantics (Springer Monographs in Mathematics)
by Mark V Sapir
Combinatorial Algebra: Syntax and Semantics provides comprehensive account of many areas of combinatorial algebra. It contains self-contained proofs of more than 20 fundamental results, both classical and modern. This includes Golod-Shafarevich and Olshanskii's solutions of Burnside problems, Shirshov's solution of Kurosh's problem for PI rings, Belov's solution of Specht's problem for varieties of rings, Grigorchuk's solution of Milnor's problem, Bass-Guivarc'h theorem about growth of nilpoten...
Student's Solutions Manual (valuepak) for Algebra and Trigonometry Enhanced with Graphing Utilities
by Michael Sullivan
This IMA Volume in Mathematics and its Applications Applications of Combinatorics and Graph Theory to the Biological and Social Sciences is based on the proceedings of a workshop which was an integral part of the 1987-88 IMA program on APPLIED COMBINATORICS. We are grateful to the Scientific Committee: Victor Klee (Chairman), Daniel Kleitman, Dijen Ray-Chaudhuri and Dennis Stanton for planning and implementing an exciting and stimulating year long program. We especially thank the Workshop Organ...
Intelligent Learning Environments (Nato ASI Subseries F:, #117) (NATO ASI, SER F / v.117)
This book is based on a NATO workshop for researchersconcerned with the design of intelligent learningenvironments for geometry. Geometry cannot bereduced toprocedural knowledge and its complexity makes it of interestfor the development of intelligent tutoring systems. Thecentral theme of the volume is student modeling, which hasthree aspects: modeling the knowledge domain, modelingstudent knowledge, and designing the didactic interactionand learner control. Four main issues runthrough the paper...
Problems and Theorems in Classical Set Theory (Problem Books in Mathematics)
by Peter Komjath and Vilmos Totik
This volume contains a variety of problems from classical set theory and represents the first comprehensive collection of such problems. Many of these problems are also related to other fields of mathematics, including algebra, combinatorics, topology and real analysis. Rather than using drill exercises, most problems are challenging and require work, wit, and inspiration. They vary in difficulty, and are organized in such a way that earlier problems help in the solution of later ones. For many...