Gert Sabidussi – författare
Visar alla böcker från författaren Gert Sabidussi. Handla med fri frakt och snabb leverans.
7 produkter
7 produkter
5 303 kr
Skickas inom 10-15 vardagar
The text consists of the lectures presented at the NATO ASI on "Algebras and Orders" held in 1991 at the Universite de Montreal. The lectures cover a broad spectrum of topics in universal algebra, Boolean algebras, lattices and orders, and their links with graphs, relations, topology and theoretical computer science. More specifically, the topics covered include: abstract clone theory; hyperidentities and hypervarieties; arithmetical algebras and varieties; Boolean algebras with operators; algebraic duality; model-theoretic aspects of partial algebras; free lattices; algebraic ordered sets; diagrams of orders; essentially minimal groupoids, and formalization of predicate calculus. Most of the papers are up-to-date surveys written by leading researchers, or topics that are either new or have witnessed recent substantial progress. The text is suitable for graduate students and researchers.
Complex Potential Theory
Proceedings of the NATO Advanced Study Institute and Seminaire de Mathematiques Superieures, Montreal, Canada, July 26-August 6, 1993
Inbunden, Engelska, 1994
854 kr
Skickas inom 10-15 vardagar
This conference allowed specialists in several complex variables to meet with specialists in potential theory to demonstrate the interface and interconnections between their two fields. The following topics were discussed: 1. Real and complex potential theory - capacity and approximation, basic properties of plurisubharmonic functions and methods to manipulate their singularities and study theory growth, Green functions, Chebyshev-like quadratures, electrostatic fields and potentials, and the propagation of smallness. 2. Complex dynamics - review of complex dynamics in one variable, Julia sets, Fatou sets, background in several variables, Henon maps, ergodicity use of potential theory and multifunctions. 3. Banach algebras and infinite dimensional holomorphy - analytic multifunctions, spectral theory, analytic functions on a Banach space, semigroups of holomorphic isometries, Pick interpolation on uniform algebras and von Neumann inequalities for operators on a Hilbert space.
Del 497 - Nato Science Series C:
Graph Symmetry
Algebraic Methods and Applications
Inbunden, Engelska, 1997
2 126 kr
Skickas inom 10-15 vardagar
The last decade has seen parallel developments in computer science and combinatorics, both dealing with networks having strong symmetry properties. Both developments are centred on Cayley graphs: in the design of large interconnection networks, Cayley graphs arise as one of the most frequently used models; on the mathematical side, they play a central role as the prototypes of vertex-transitive graphs. The surveys published here provide an account of these developments, with emphasis on the interplay of methods from group theory and graph theory that characterizes the subject. Topics covered include: combinatorial properties of various hierarchical families of Cayley graphs (fault tolerance, diameter, routing, forwarding indices, etc.); Laplace eigenvalues of graphs and their relations to forwarding problems, isoperimetric properties, partition problems, and random walks on graphs; vertex-transitive graphs of small orders and of orders having few prime factors; distance transitive graphs; isomorphism problems for Cayley graphs of cyclic groups; infinite vertex-transitive graphs (the random graph and generalizations, actions of the automorphisms on ray ends, relations to the growth rate of the graph).
1 174 kr
Skickas inom 10-15 vardagar
The influence of scientific computing has become very wide over the last few decades: almost every area of science and engineering is greatly influenced by simulations - image processing, thin films, mathematical finance, electrical engineering, moving interfaces and combustion, to name but a few. One half of this book focuses on the techniques of scientific computing: domain decomposition, the absorption of boundary conditions and one-way operators, convergence analysis of multi-grid methods and other multi-grid techniques, dynamical systems, and matrix analysis. The remainder of the book is concerned with combining techniques with concrete applications: stochastic differential equations, image processing, thin films, and asymptotic analysis for combustion problems.
5 311 kr
Skickas inom 10-15 vardagar
The book consists of the lectures presented at the NATO ASI on 'Algebras and Orders' held in 1991 at the Universite de Montreal. The lectures cover a broad spectrum of topics in universal algebra, Boolean algebras, lattices and orders, and their links with graphs, relations, topology and theoretical computer science. More specifically, the contributions deal with the following topics: Abstract clone theory (W. Taylor); Hyperidentities and hypervarieties (D. Schweigert); Arithmetical algebras and varieties (A. Pixley); Boolean algebras with operators (B. Jonsson); Algebraic duality (B. Davey); Model-theoretic aspects of partial algebras (P. Burmeister); Free lattices (R. Freese); Algebraic ordered sets (M. Erne); Diagrams of orders (I. Rival); Essentially minimal groupoids (H. Machida, I.G. Rosenberg); and Formalization of predicate calculus (I. Fleischer). Most of the papers are up-to-date surveys written by leading researchers, or topics that are either new or have witnessed recent substantial progress. In most cases, the surveys are the first available in the literature. The book is accessible to graduate students and researchers.
2 128 kr
Skickas inom 10-15 vardagar
The last decade has seen parallel developments in computer science and combinatorics, both dealing with networks having strong symmetry properties. Both developments are centred on Cayley graphs: in the design of large interconnection networks, Cayley graphs arise as one of the most frequently used models; on the mathematical side, they play a central role as the prototypes of vertex-transitive graphs. The surveys published here provide an account of these developments, with a strong emphasis on the fruitful interplay of methods from group theory and graph theory that characterises the subject. Topics covered include: combinatorial properties of various hierarchical families of Cayley graphs (fault tolerance, diameter, routing, forwarding indices, etc.); Laplace eigenvalues of graphs and their relations to forwarding problems, isoperimetric properties, partition problems, and random walks on graphs; vertex-transitive graphs of small orders and of orders having few prime factors; distance transitive graphs; isomorphism problems for Cayley graphs of cyclic groups; infinite vertex-transitive graphs (the random graph and generalisations, actions of the automorphisms on ray ends, relations to the growth rate of the graph).
537 kr
Skickas inom 10-15 vardagar
What is the "archetypal" image that comes to mind when one thinks of an infinite graph? What with a finite graph - when it is thought of as opposed to an infinite one? What structural elements are typical for either - by their presence or absence - yet provide a common ground for both? In planning the workshop on "Cycles and Rays" it had been intended from the outset to bring infinite graphs to the fore as much as possible. There never had been a graph theoretical meeting in which infinite graphs were more than "also rans", let alone one in which they were a central theme. In part, this is a matter of fashion, inasmuch as they are perceived as not readily lending themselves to applications, in part it is a matter of psychology stemming from the insecurity that many graph theorists feel in the face of set theory - on which infinite graph theory relies to a considerable extent. The result is that by and large, infinite graph theorists know what is happening in finite graphs but not conversely. Lack of knowledge about infinite graph theory can also be found in authoritative l sources. For example, a recent edition (1987) of a major mathematical encyclopaedia proposes to ". . . restrict [itself] to finite graphs, since only they give a typical theory". If anything, the reverse is true, and needless to say, the graph theoretical world knows better. One may wonder, however, by how much.