Search results

This volume contains the proceedings of the CIMPA Research School and Conference on Algebra for Secure and Reliable Communication Modeling, held from October 1-13, 2012, in Morelia, State of Michoacan, Mexico. The papers cover several aspects of the theory of coding theory and are gathered into three categories: general theory of linear codes, algebraic geometry and coding theory, and constacyclic codes over rings. The aim of this volume is to fill the gap between the theoretical part of algeb...

The first volume of Lecture Notes in Quantum Chemistry (Lecture Notes in Chemistry 58, Springer Verlag, Berlin 1992) contained a compilation of selected lectures given at the two first European Summer Schools in Quantum Chemistry (ESQC), held in southern Sweden in August 1989 and 1991, respectively. The notes were written by the teachers at the school and covered a large range of topics in ab initio quantum chemistry. After the third summer school (held in 1993) it was decided to put together a...

Combinatorial Engineering of Decomposable Systems presents a morphological approach to the combinatorial design/synthesis of decomposable systems. Applications involve the following: design (e.g., information systems; user's interfaces; educational courses); planning (e.g., problem-solving strategies; product life cycles; investment); metaheuristics for combinatorial optimization; information retrieval; etc.

The walks on ordinals and analysis of their characteristics is a subject matter started by the author some twenty years ago in order to disprove a particular extension of the Ramsey theorem. A further analysis has shown however that the resulting method is quite useful in detecting critical mathematical objects in contexts where only rough classifications are possible. The book gives a careful and comprehensive account of the method and gathers many of these applications in a unified and compreh...

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.

This book contains Volumes 4 and 5 of the Journal of Graph Algorithms and Applications (JGAA). The first book of this series, Graph Algorithms and Applications 1, published in March 2002, contains Volumes 1-3 of JGAA.JGAA is a peer-reviewed scientific journal devoted to the publication of high-quality research papers on the analysis, design, implementation, and applications of graph algorithms. Areas of interest include computational biology, computational geometry, computer graphics, computer-a...

This is the third, substantially revised edition of this important monograph. The book is concerned with Kac-Moody algebras, a particular class of infinite-dimensional Lie algebras, and their representations. It is based on courses given over a number of years at MIT and in Paris, and is sufficiently self-contained and detailed to be used for graduate courses. Each chapter begins with a motivating discussion and ends with a collection of exercises, with hints to the more challenging problems.

Based on the lectures given at the Seminaire de Theorie des Nombres de Paris in 1990-1991, this collection of papers reflects work in many areas of number theory, including: cubic exponential sums; Riemann's period relations; and Galois representations attached to points on Shimura varieties.

This book is a tribute to Paul Erd\H{o}s, the wandering mathematician once described as the "prince of problem solvers and the absolute monarch of problem posers." It examines -- within the context of his unique personality and lifestyle -- the legacy of open problems he left to the world after his death in 1996. Unwilling to succumb to the temptat

One of the most successful methods for discovering the way mental processes are organized is to observe the effects in experiments of selectively influencing the processes. Selective influence is crucial in techniques such as Sternberg's additive factor method for reaction times and Jacoby's process dissociation procedure for accuracy. The successful uses of selective influence have encouraged application extensions to complex architectures, to dependent variables such as evoked potentials, and...

This volume constitutes the proceedings of the Third International Conference on the Mathematics of Program Construction, held at Kloster Irsee, Germany in July 1995. Besides five invited lectures by distinguished researchers there are presented 19 full revised papers selected from a total of 58 submissions. The general theme is the use of crisp, clear mathematics in the discovery and design of algorithms and in the development of corresponding software and hardware; among the topics addressed a...

This book, now in a thoroughly revised second edition, provides a comprehensive and accessible introduction to modern set theory.Following an overview of basic notions in combinatorics and first-order logic, the author outlines the main topics of classical set theory in the second part, including Ramsey theory and the axiom of choice. The revised edition contains new permutation models and recent results in set theory without the axiom of choice. The third part explains the sophisticated techniq...

This volume composed of twenty four research articles which are selected from the keynote speakers and invited lectures presented in the 3rd International Congress in Algebra and Combinatorics (ICAC2017) held on 25-28 August 2017 in Hong Kong and one additional invited article. This congress was specially dedicated to Professor Leonid Bokut on the occasion of his 80th birthday.

A memorial conference for Leon Ehrenpreis was held at Temple University, November 15-16, 2010. In the spirit of Ehrenpreis's contribution to mathematics, the papers in this volume, written by prominent mathematicians, represent the wide breadth of subjects that Ehrenpreis traversed in his career, including partial differential equations, combinatorics, number theory, complex analysis and a bit of applied mathematics. With the exception of one survey article, the papers in this volume are all...

This textbook illuminates the field of discrete mathematics with examples, theory, and applications of the discrete volume of a polytope. The authors have weaved a unifying thread through basic yet deep ideas in discrete geometry, combinatorics, and number theory. We encounter here a friendly invitation to the field of "counting integer points in polytopes", and its various connections to elementary finite Fourier analysis, generating functions, the Frobenius coin-exchange problem, solid angles,...

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...

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...

Graphentheorie ist eine junge mathematische Disziplin, 1936 erschien das erste Lehrbuch yom ungarischen Mathematiker DENES KONIG. Mit der stiirmischen Ent- wicklung der Operationsforschung erlebte auch die Graphentheorie eine ungeahnte Bliite, so daB die Zahl der Biicher zur Graphentheorie heute schon Legion ist. Das Gros der Autoren setzt jedoch beim Leser einen relativ hohen mathematischen Aus- bildungsgrad sowie ein hohes Abstraktionsvermogen voraus. Wir verlangen yom Leser im allgemeinen nic...

Over the last twenty years, Professor Franco Giannessi, a highly respected researcher, has been working on an approach to optimization theory based on image space analysis. His theory has been elaborated by many other researchers in a wealth of papers. Constrained Optimization and Image Space Analysis unites his results and presents optimization theory and variational inequalities in their light. It presents a new approach to the theory of constrained extremum problems, including Mathematical Pr...

For more than 35 years now, George B. Dantzig's Simplex-Method has been the most efficient mathematical tool for solving linear programming problems. It is proba bly that mathematical algorithm for which the most computation time on computers is spent. This fact explains the great interest of experts and of the public to understand the method and its efficiency. But there are linear programming problems which will not be solved by a given variant of the Simplex-Method in an acceptable time. The...