Structured adaptive mesh refinement (SAMR) methods have matured over the past 20 years and are now the method of choice for certain difficult problems, such as compressible flow. SAMR presents difficult technical challenges, both in terms of the numerical techniques involved and the complexity of the programming effort, especially on parallel computers. In order to gain insight into managing these difficulties, much research effort has been directed at mesh generation, parallel computation, and...
The Lace Expansion and Its Applications (Lecture Notes in Mathematics, #1879)
by Gordon Slade
The lace expansion is a powerful and flexible method for understanding the critical scaling of several models of interest in probability, statistical mechanics, and combinatorics, above their upper critical dimensions. These models include the self-avoiding walk, lattice trees and lattice animals, percolation, oriented percolation, and the contact process. This volume provides a unified and extensive overview of the lace expansion and its applications to these models.
Handbook of Graph Drawing and Visualization (Discrete Mathematics and Its Applications)
Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and ApplicationsThe Handbook of Graph Drawing and Visualization provides a broad, up-to-date survey of the field of graph drawing. It covers topological and geometric foundations, algorithms, software systems, and visualization applications in business, education, scie
Recent Trends in Algebraic Combinatorics (Association for Women in Mathematics, #16)
This edited volume features a curated selection of research in algebraic combinatorics that explores the boundaries of current knowledge in the field. Focusing on topics experiencing broad interest and rapid growth, invited contributors offer survey articles on representation theory, symmetric functions, invariant theory, and the combinatorics of Young tableaux. The volume also addresses subjects at the intersection of algebra, combinatorics, and geometry, including the study of polytopes, latti...
Nearrings arise naturally in various ways, but most nearrings studied today arise as the endomorphisms of a group or cogroup object of a category. These nearrings are rings if the group object is also a cogroup object. During the first half of the twentieth century, nearfields were formalized and applications to sharply transitive groups and to foundations of geometry were utilized. Planar nearrings grew out of the geometric success of the planar nearfields and have found numerous application...
Combinatorial Inference in Geometric Data Analysis (Chapman & Hall/CRC Computer Science & Data Analysis)
by Brigitte Le Roux, Solene Bienaise, and Jean-Luc Durand
Geometric Data Analysis designates the approach of Multivariate Statistics that conceptualizes the set of observations as a Euclidean cloud of points. Combinatorial Inference in Geometric Data Analysis gives an overview of multidimensional statistical inference methods applicable to clouds of points that make no assumption on the process of generating data or distributions, and that are not based on random modelling but on permutation procedures recasting in a combinatorial framework. It focus...
Number Theory (De Gruyter Proceedings in Mathematics)
Three major branches of number theory are included in the volume: namely analytic number theory, algebraic number theory, and transcendental number theory. Original research is presented that discusses modern techniques and survey papers from selected academic scholars.
Weyl Group Multiple Dirichlet Series: Type a Combinatorial Theory (Am-175) (Annals of Mathematics Studies)
by Ben Brubaker, Daniel Bump, and Solomon Friedberg
Secret writing has become the object of extensive scientific studies because of new applications to data security, and, even more so, because of vistas opened by public-key cryptography which allows messages to be sent padlocked with the receiver's personal lock. Covered in this self-contained t
Datenstrukturen in APL2 (Springer-Lehrbuch)
by Hanspeter Bieri and Felix Grimm
Mit dem Erscheinen von PC-Versionen (seit 1988) hat die leistungsfahige Programmiersprache APL2 deutlich an Attraktivitat und Verbreitung gewonnen. Als Entwicklungssystem fur komplexe Anwendungen, die eine schnelle, interaktive Analyse grosser Datenmengen erfordern, hat APL sich einen festen Platz in der Praxis erobert, z.B. bei Banken und Versicherungen. Das vorliegende Buch ist eine hohere Einfuhrung in APL2. Programmierer mit geringen Vorkenntnissen in APL oder APL2 werden anhand sorgfaltig a...
By integrating the use of GAP and Mathematica (R), Abstract Algebra: An Interactive Approach presents a hands-on approach to learning about groups, rings, and fields. Each chapter includes both GAP and Mathematica commands, corresponding Mathematica notebooks, traditional exercises, and several interactive computer problems that utilize GAP and Mathematica to explore groups and rings. Although the book gives the option to use technology in the classroom, it does not sacrifice mathematical rigor...
Graphs, Networks and Design: Introduction
A Brief Introduction to Spectral Graph Theory (EMS Textbooks in Mathematics)
by Bogdan Nica
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...
Graph Theory and Combinatorial Optimization (Studies in Contemporary Economics) (Gerad 25th Anniversary)
by Manfred Stadler
Graph theory is very much tied to the geometric properties of optimization and combinatorial optimization. Moreover, graph theory's geometric properties are at the core of many research interests in operations research and applied mathematics. Its techniques have been used in solving many classical problems including maximum flow problems, independent set problems, and the traveling salesman problem. Graph Theory and Combinatorial Optimization explores the field's classical foundations and its d...
Combinatorial Extremization: In Mathematical Olympiad And Competitions (Mathematical Olympiad, #13)
by Yuefeng Feng
In China, lots of excellent students who are good at maths takes an active part in various maths contests and the best six senior high school students will be selected to form the IMO National Team to compete in the International Mathematical Olympiad. In the past ten years China's IMO Team has achieved outstanding results - they have won the first place almost every year.The author is one of the coaches of China's IMO National Team, whose students have won many gold medals many times in IMO.Thi...
Integer Programming and Combinatorial Optimization (Lecture Notes in Computer Science, #2081)
This volume contains the papers selected for presentation at IPCO VIII, the Eighth Conference on Integer Programming and Combinatorial Optimization, Utrecht, The Netherlands, 2001. This meeting isa forum for researchers and practitioners working on various aspects of integer programming and combi- torial optimization. The aim is to present recent developments in theory, com- tation, and application of integer programming and combinatorial optimization. Topics include, but are not limited to: app...
Combinatorial Designs (De Gruyter Series in Discrete Mathematics and Applications, #3)
by Stelios Georgiou and Christos Koukouvinos
This book indends to cover an area of great current interest, namely the interplay between combinatorics, coding theory, and cryptography. This is a rich field with high relevance for information theory and communication technology.This book therefore appeals to graduate students and researchers in discrete mathematics, information theory, and electrical engineering. The book strikes a good balance between theoretical material and applications. There is a first part devoted to the background...
Graph Drawing (Lecture Notes in Computer Science, #1190)
This book constitutes the strictly refereed post-conference proceedings of the International Symposium on Graph Drawing, GD'96, held in Berkeley, California, in September 1996. The 24 revised full papers and the 8 systems demonstrations presented in the book were carefully selected from a total of 50 papers and 24 demos submitted. Also included is a summary of the annual graph drawing competition. Among the topics covered are planarity, upward and orthogonal drawing, heuristics, experimental res...
An Introduction to Quasigroups and Their Representations (Studies in Advanced Mathematics)
by Jonathan D. H. Smith
Collecting results scattered throughout the literature into one source, An Introduction to Quasigroups and Their Representations shows how representation theories for groups are capable of extending to general quasigroups and illustrates the added depth and richness that result from this extension. To fully understand representation theory, the first three chapters provide a foundation in the theory of quasigroups and loops, covering special classes, the combinatorial multiplication group, univ...
Foundations of Software Technology and Theoretical Computer Science
by Rudrapatna K Shyamasundar