Gert Sabidussi – författare

Visar alla böcker från författaren Gert Sabidussi. Handla med fri frakt och snabb leverans.

10 produkter

Kategorier

10 produkter

Algebras and Orders
AvIvo G. Rosenberg,Gert Sabidussi
Inbunden, Engelska, 1993
5 431 kr
Skickas inom 10-15 vardagar
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 "Algebras and Orders" as its 30th Seminaire de mathematiques superieures (SMS), a summer school with a long tradition and well-established reputation. This book contains the contributions of the invited speakers. Universal algebra- which established itself only in the 1930's- grew from traditional algebra (e.g., groups, modules, rings and lattices) and logic (e.g., propositional calculus, model theory and the theory of relations). It started by extending results from these fields but by now it is a well-established and dynamic discipline in its own right. One of the objectives of the ASI was to cover a broad spectrum of topics in this field, and to put in evidence the natural links to, and interactions with, boolean algebra, lattice theory, topology, graphs, relations, automata, theoretical computer science and (partial) orders. The theory of orders is a relatively young and vigorous discipline sharing certain topics as well as many researchers and meetings with universal algebra and lattice theory. W. Taylor surveyed the abstract clone theory which formalizes the process of compos ing operations (i.e., the formation of term operations) of an algebra as a special category with countably many objects, and leading naturally to the interpretation and equivalence of varieties.
Complex Potential Theory
Proceedings of the NATO Advanced Study Institute and Seminaire de Mathematiques Superieures, Montreal, Canada, July 26-August 6, 1993
AvPaul M. Gauthier,Gert Sabidussi
Inbunden, Engelska, 1994
874 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
AvGena Hahn,Gert Sabidussi
Inbunden, Engelska, 1997
2 177 kr
Skickas inom 10-15 vardagar
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. In the design of large interconnection networks it was realised that many of the most fre quently used models for such networks are Cayley graphs of various well-known groups. This has spawned a considerable amount of activity in the study of the combinatorial properties of such graphs. A number of symposia and congresses (such as the bi-annual IWIN, starting in 1991) bear witness to the interest of the computer science community in this subject. On the mathematical side, and independently of any interest in applications, progress in group theory has made it possible to make a realistic attempt at a complete description of vertex-transitive graphs. The classification of the finite simple groups has played an important role in this respect.
Modern Methods in Scientific Computing and Applications
Proceedings of the NATO Advanced Study Institute and Seminaire De Math Eacute Matiques Superieures on Modern Methods in Scientific Computing and Applications, Montreal, Quebec, Canada, 9-20 July 2001
AvAnne Bourlioux,Anne Bourliouxm. fl.
Inbunden, Engelska, 2002
1 200 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.
Algebras and Orders
AvIvo G. Rosenberg,Gert Sabidussi
Häftad, Engelska, 2010
5 431 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.
Graph Symmetry
Algebraic Methods and Applications
AvGena Hahn,Gert Sabidussi
Häftad, Engelska, 2010
2 177 kr
Skickas inom 10-15 vardagar
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. In the design of large interconnection networks it was realised that many of the most fre quently used models for such networks are Cayley graphs of various well-known groups. This has spawned a considerable amount of activity in the study of the combinatorial properties of such graphs. A number of symposia and congresses (such as the bi-annual IWIN, starting in 1991) bear witness to the interest of the computer science community in this subject. On the mathematical side, and independently of any interest in applications, progress in group theory has made it possible to make a realistic attempt at a complete description of vertex-transitive graphs. The classification of the finite simple groups has played an important role in this respect.
Cycles and Rays
AvR.E. Woodrow,Gert Sabidussim. fl.
E-bok
PDF, Engelska, 2012
710 kr
Läs direkt efter köp
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.
Cycles and Rays
AvGena Hahn,Gert Sabidussim. fl.
Häftad, Engelska, 2011
549 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.
Graph Symmetry
Algebraic Methods and Applications
AvGert Sabidussi,Gena Hahn
E-bok
PDF, Engelska, 2013
2 833 kr
Läs direkt efter köp
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. In the design of large interconnection networks it was realised that many of the most fre quently used models for such networks are Cayley graphs of various well-known groups. This has spawned a considerable amount of activity in the study of the combinatorial properties of such graphs. A number of symposia and congresses (such as the bi-annual IWIN, starting in 1991) bear witness to the interest of the computer science community in this subject. On the mathematical side, and independently of any interest in applications, progress in group theory has made it possible to make a realistic attempt at a complete description of vertex-transitive graphs. The classification of the finite simple groups has played an important role in this respect.
Algebras and Orders
AvGert Sabidussi,Ivo G. Rosenberg
E-bok
PDF, Engelska, 2013
7 092 kr
Läs direkt efter köp
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 "Algebras and Orders" as its 30th Seminaire de mathematiques superieures (SMS), a summer school with a long tradition and well-established reputation. This book contains the contributions of the invited speakers. Universal algebra- which established itself only in the 1930''s- grew from traditional algebra (e.g., groups, modules, rings and lattices) and logic (e.g., propositional calculus, model theory and the theory of relations). It started by extending results from these fields but by now it is a well-established and dynamic discipline in its own right. One of the objectives of the ASI was to cover a broad spectrum of topics in this field, and to put in evidence the natural links to, and interactions with, boolean algebra, lattice theory, topology, graphs, relations, automata, theoretical computer science and (partial) orders. The theory of orders is a relatively young and vigorous discipline sharing certain topics as well as many researchers and meetings with universal algebra and lattice theory. W. Taylor surveyed the abstract clone theory which formalizes the process of compos ing operations (i.e., the formation of term operations) of an algebra as a special category with countably many objects, and leading naturally to the interpretation and equivalence of varieties.

Företag, bibliotek eller offentlig verksamhet?

Gert Sabidussi – författare

Algebras and Orders

Complex Potential Theory

Graph Symmetry

Modern Methods in Scientific Computing and Applications

Algebras and Orders

Graph Symmetry

Cycles and Rays

Cycles and Rays

Graph Symmetry

Algebras and Orders

Mina sidor

Mina sidor

Hjälp

Hjälp

Om Bokus

Om Bokus

Populärt

Populärt

Inspiration

Inspiration