الصفحة 1
الصفحة 1
Notes on Coxeter Transformations and the McKay Correspondence
One of the beautiful results in the representation theory of the finite groups is McKay's theorem on a correspondence between representations of the binary polyhedral group of SU(2) and vertices of an extended simply-laced Dynkin diagram. The Coxeter transformation is the main tool in the proof of the McKay correspondence, and is closely interrelated with the Cartan matrix and Poincaré series. The Coxeter functors constructed by Bernstein, Gelfand and Ponomarev plays a distinguished role in the representation theory of quivers.
Network Analysis : Methodological Foundations
‘Network’ is a heavily overloaded term, so that ‘network analysis’ means different things to different people. Specific forms of network analysis are used in the study of diverse structures such as the Internet, interlocking directorates, transportation systems, epidemic spreading, metabolic pathways, the Web graph, electrical circuits, project plans, and so on. There is, however, a broad methodological foundation which is quickly becoming a prerequisite for researchers and practitioners working with network models. From a computer science perspective, network analysis is applied graph theory. Unlike standard graph theory books, the content of this book is organized according to methods for specific levels of analysis (element, group, network) rather than abstract concepts like paths, matchings, or spanning subgraphs. Its topics therefore range from vertex centrality to graph clustering and the evolution of scale-free networks. In 15 coherent chapters, this monograph-like tutorial book introduces and surveys the concepts and methods that drive network analysis, and is thus the first book to do so from a methodological perspective independent of specific application areas.
Horizons of Combinatorics
Hungarian mathematics has always been known for discrete mathematics, including combinatorial number theory, set theory and recently random structures, combinatorial geometry as well. The recent volume contains high level surveys on these topics with authors mostly being invited speakers for the conference "Horizons of Combinatorics" held in Balatonalmadi, Hungary in 2006. The collection gives a very good overview of recent trends and results in a large part of combinatorics and related topics, and offers an interesting reading for experienced specialists as well as to young researchers and students.
Graph drawing ; 15th International symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers
The 16th International Symposium on Graph Drawing (GD 2008) was held in Hersonissos, near Heraklion, Crete, Greece, September 21-24, 2008, and was attended by 91 participants from 19 countries. In response to the call for papers the Program Committee received 83 s- missions,eachdescribing originalresearchand/or a systemdemonstration.Tamassia showed how graph drawing techniques can be used as an e?ective tool in computer security and pointed to future research directions in this area. Following what is now a tradition, the 15th Annual Graph Drawing Contest was held during the conference, also including a Graph Drawing Challenge to the conference attendees.
Discrete Geometry, Combinatorics and Graph Theory ; 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, and Xi'an, China, November 22-24, 2005, Revised Selected Papers
Theis book includes discrete algorithmic geometry, combinatorics and graph theory
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies ; 1st International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers
This book address practical large data processing problems with different, and eventually converging, methodologies from major important disciplines such as computer science, combinatorics, and statistics. The symposium provides an interdisciplinary forum for researchers across their discipline boundaries to exchange their approaches, to search for ideas, methodologies, and tool boxes, to find better, faster and more accurate solutions thus fostering innovative ideas as well as to develop research agenda of common interest.
Logic Synthesis for Compositional Microprogram Control Units
In this book control algorithms are represented by the linear graph-schemes of algorithms (GSA), where the number of operator vertices is not less than 75% of the total number of all algorithm vertices. A special class of control units named as compositional microprogram control units (CMCU) is proposed as the best way for interpretation of linear control algorithms.
Laplacian Eigenvectors of Graphs : Perron-Frobenius and Faber-Krahn Type Theorems
Eigenvectors of graph Laplacians have not, to date, been the subject of expository articles and thus they may seem a surprising topic for a book. The authors propose two motivations for this new LNM volume: (1) There are fascinating subtle differences between the properties of solutions of Schrödinger equations on manifolds on the one hand, and their discrete analogs on graphs. (2) "Geometric" properties of (cost) functions defined on the vertex sets of graphs are of practical interest for heuristic optimization algorithms. The observation that the cost functions of quite a few of the well-studied combinatorial optimization problems are eigenvectors of associated graph Laplacians has prompted the investigation of such eigenvectors.
