Lattice theory evolved as part of algebra in the nineteenth century through the work of Boole, Peirce and Schroder, and in the first half of the twentieth century through the work of Dedekind, Birkhoff, Ore, von Neumann, Mac Lane, Wilcox, Dilworth, and others. In Semimodular Lattices, Manfred Stern uses successive generalizations of distributive and modular lattices to outline the development of semimodular lattices from Boolean algebras. He focuses on the important theory of semimodularity, its many ramifications, and its applications in discrete mathematics, combinatorics, and algebra. The...

An integrated approach for new graduate students, emphasising connections with game theory, optimisation, mathematical programming and statistics.

The book is devoted to the study of classical combinatorial structures such as random graphs, permutations, and systems of random linear equations in finite fields. The author shows how the application of the generalized scheme of allocation in the study of random graphs and permutations reduces the combinatorial problems to classical problems of probability theory on the summation of independent random variables. He offers recent research by Russian mathematicians, including a discussion of equations containing an unknown permutation, and the first English-language presentation of techniques...

This is the first volume of a two volume set that provides a modern account of basic Banach algebra theory including all known results on general Banach *-algebras. This account emphasizes the role of *-algebraic structure and explores the algebraic results that underlie the theory of Banach algebras and *-algebras. The first volume, which contains previously unpublished results, is an independent, self-contained reference on Banach algebra theory. Each topic is treated in the maximum interesting generality within the framework of some class of complex algebras rather than topological...

A continuation of The Theory of Matroids, (edited by N. White), this volume consists of a series of related surveys by top authorities on coordinatizations, matching theory, transversal and simplicial matroids, and studies of important matroid variants. An entire chapter is devoted to matroids in combinatorial optimization, a topic of current interest. Care has been taken to ensure a uniform style throughout, and to make a work that can be used as a reference or as a graduate textbook. Excercises are included.

With the advent of computers, theoretical studies and solution methods for polynomial equations have changed dramatically. Many classical results can be more usefully recast within a different framework which in turn lends itself to further theoretical development tuned to computation. This first book in a trilogy is devoted to the new approach. It is a handbook covering the classical theory of finding roots of a univariate polynomial, emphasizing computational aspects, especially the representation and manipulation of algebraic numbers, enlarged by more recent representations like the Duval...

In this treatise, the authors present the general theory of orthogonal polynomials on the complex plane and several of its applications. The assumptions on the measure of orthogonality are general, the only restriction is that it has compact support on the complex plane. In the development of the theory the main emphasis is on asymptotic behavior and the distribution of zeros. In the first two chapters exact upper and lower bounds are given for the orthonormal polynomials and for the location of their zeros. The next three chapters deal with regular n-th root asymptotic behavior, which plays...

The book describes methods for working with elements, subgroups, and quotient groups of a finitely presented group. The author emphasizes the connection with fundamental algorithms from theoretical computer science, particularly the theory of automata and formal languages, from computational number theory, and from computational commutative algebra. The LLL lattice reduction algorithm and various algorithms for Hermite and Smith normal forms are used to study the Abelian quotients of a finitely presented group. The work of Baumslag, Cannonito, and Miller on computing non-Abelian polycyclic...

This second edition is a comprehensive treatment of all straightforward aspects of Pade approximation, and the authors develop some themes to the level of current research. They extensively cover applications to statistical mechanics and critical phenomena, and there are newly extended sections devoted to circuit design, matrix Pade approximation, computational methods, and integral and algebraic approximants. The new edition also contains a chapter on multiseries approximants. The book contains an extensive bibliography of recent monographs on other specialized material. This succinct and...

Stochastic processes with jumps and random measures are gaining importance as drivers in applications like financial mathematics and signal processing. This book develops stochastic integration theory for both integrators (semimartingales) and random measures from a common point of view. Using some novel predictable controlling devices, the author furnishes the theory of stochastic differential equations driven by them, as well as their stability and numerical approximation theories. Highlights feature DCT and Egoroff's Theorem, as well as comprehensive analogs to results from ordinary...