Download or read book D bounded Distance regular Graphs written by Chih-wen Weng and published by . This book was released on 1995 with total page 222 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Distance Regular Graphs written by Andries E. Brouwer and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 513 pages. Available in PDF, EPUB and Kindle. Book excerpt: Ever since the discovery of the five platonic solids in ancient times, the study of symmetry and regularity has been one of the most fascinating aspects of mathematics. Quite often the arithmetical regularity properties of an object imply its uniqueness and the existence of many symmetries. This interplay between regularity and symmetry properties of graphs is the theme of this book. Starting from very elementary regularity properties, the concept of a distance-regular graph arises naturally as a common setting for regular graphs which are extremal in one sense or another. Several other important regular combinatorial structures are then shown to be equivalent to special families of distance-regular graphs. Other subjects of more general interest, such as regularity and extremal properties in graphs, association schemes, representations of graphs in euclidean space, groups and geometries of Lie type, groups acting on graphs, and codes are covered independently. Many new results and proofs and more than 750 references increase the encyclopaedic value of this book.
Download or read book Regular Graphs written by Zoran Stanić and published by Walter de Gruyter GmbH & Co KG. This book was released on 2017-04-24 with total page 247 pages. Available in PDF, EPUB and Kindle. Book excerpt: Written for mathematicians working with the theory of graph spectra, this (primarily theoretical) book presents relevant results considering the spectral properties of regular graphs. The book begins with a short introduction including necessary terminology and notation. The author then proceeds with basic properties, specific subclasses of regular graphs (like distance-regular graphs, strongly regular graphs, various designs or expanders) and determining particular regular graphs. Each chapter contains detailed proofs, discussions, comparisons, examples, exercises and also indicates possible applications. Finally, the author also includes some conjectures and open problems to promote further research. Contents Spectral properties Particular types of regular graph Determinations of regular graphs Expanders Distance matrix of regular graphs
Download or read book Algebraic Combinatorics and the Monster Group written by Alexander A. Ivanov and published by Cambridge University Press. This book was released on 2023-08-17 with total page 583 pages. Available in PDF, EPUB and Kindle. Book excerpt: The current state of knowledge on the Monster group, including Majorana theory, Vertex Operator Algebras, Moonshine and maximal subgroups.
Download or read book Finite Generalized Quadrangles written by Stanley E. Payne and published by European Mathematical Society. This book was released on 2009 with total page 304 pages. Available in PDF, EPUB and Kindle. Book excerpt: Generalized quadrangles (GQ) were formally introduced by J. Tits in 1959 to describe geometric properties of simple groups of Lie type of rank 2. The first edition of Finite Generalized Quadrangles (FGQ) quickly became the standard reference for finite GQ. The second edition is essentially a reprint of the first edition. It is a careful rendering into LaTeX of the original, along with an appendix that brings to the attention of the reader those major new results pertaining to GQ, especially in those areas where the authors of this work have made a contribution. The first edition has been out of print for many years. The new edition makes available again this classical reference in the rapidly increasing field of finite geometries.
Download or read book Algebraic Combinatorics written by Chris Godsil and published by Routledge. This book was released on 2017-10-19 with total page 382 pages. Available in PDF, EPUB and Kindle. Book excerpt: This graduate level text is distinguished both by the range of topics and the novelty of the material it treats--more than half of the material in it has previously only appeared in research papers. The first half of this book introduces the characteristic and matchings polynomials of a graph. It is instructive to consider these polynomials together because they have a number of properties in common. The matchings polynomial has links with a number of problems in combinatorial enumeration, particularly some of the current work on the combinatorics of orthogonal polynomials. This connection is discussed at some length, and is also in part the stimulus for the inclusion of chapters on orthogonal polynomials and formal power series. Many of the properties of orthogonal polynomials are derived from properties of characteristic polynomials. The second half of the book introduces the theory of polynomial spaces, which provide easy access to a number of important results in design theory, coding theory and the theory of association schemes. This book should be of interest to second year graduate text/reference in mathematics.
Download or read book written by and published by . This book was released on 1996 with total page 532 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Investigations in Algebraic Theory of Combinatorial Objects written by I.A. Faradzev and published by Springer Science & Business Media. This book was released on 2013-06-29 with total page 513 pages. Available in PDF, EPUB and Kindle. Book excerpt: X Köchendorffer, L.A. Kalu:lnin and their students in the 50s and 60s. Nowadays the most deeply developed is the theory of binary invariant relations and their combinatorial approximations. These combinatorial approximations arose repeatedly during this century under various names (Hecke algebras, centralizer rings, association schemes, coherent configurations, cellular rings, etc.-see the first paper of the collection for details) andin various branches of mathematics, both pure and applied. One of these approximations, the theory of cellular rings (cellular algebras), was developed at the end of the 60s by B. Yu. Weisfeiler and A.A. Leman in the course of the first serious attempt to study the complexity of the graph isomorphism problem, one of the central problems in the modern theory of combinatorial algorithms. At roughly the same time G.M. Adelson-Velskir, V.L. Arlazarov, I.A. Faradtev and their colleagues had developed a rather efficient tool for the constructive enumeration of combinatorial objects based on the branch and bound method. By means of this tool a number of "sports-like" results were obtained. Some of these results are still unsurpassed.
Download or read book A Proof of Alon s Second Eigenvalue Conjecture and Related Problems written by Joel Friedman and published by American Mathematical Soc.. This book was released on 2008 with total page 114 pages. Available in PDF, EPUB and Kindle. Book excerpt: A $d$-regular graph has largest or first (adjacency matrix) eigenvalue $\lambda_1=d$. Consider for an even $d\ge 4$, a random $d$-regular graph model formed from $d/2$ uniform, independent permutations on $\{1,\ldots,n\}$. The author shows that for any $\epsilon>0$ all eigenvalues aside from $\lambda_1=d$ are bounded by $2\sqrt{d-1}\;+\epsilon$ with probability $1-O(n^{-\tau})$, where $\tau=\lceil \bigl(\sqrt{d-1}\;+1\bigr)/2 \rceil-1$. He also shows that this probability is at most $1-c/n^{\tau'}$, for a constant $c$ and a $\tau'$ that is either $\tau$ or $\tau+1$ (``more often'' $\tau$ than $\tau+1$). He proves related theorems for other models of random graphs, including models with $d$ odd.
Download or read book Codes on Euclidean Spheres written by T. Ericson and published by Elsevier. This book was released on 2001-04-27 with total page 565 pages. Available in PDF, EPUB and Kindle. Book excerpt: Codes on Euclidean spheres are often referred to as spherical codes. They are of interest from mathematical, physical and engineering points of view. Mathematically the topic belongs to the realm of algebraic combinatorics, with close connections to number theory, geometry, combinatorial theory, and - of course - to algebraic coding theory. The connections to physics occur within areas like crystallography and nuclear physics. In engineering spherical codes are of central importance in connection with error-control in communication systems. In that context the use of spherical codes is often referred to as "coded modulation." The book offers a first complete treatment of the mathematical theory of codes on Euclidean spheres. Many new results are published here for the first time. Engineering applications are emphasized throughout the text. The theory is illustrated by many examples. The book also contains an extensive table of best known spherical codes in dimensions 3-24, including exact constructions.
Download or read book Mathematical Reviews written by and published by . This book was released on 2008 with total page 984 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Strongly Regular Graphs written by Andries E. Brouwer and published by . This book was released on 2022-01-13 with total page 481 pages. Available in PDF, EPUB and Kindle. Book excerpt: This monograph on strongly regular graphs is an invaluable reference for anybody working in algebraic combinatorics.
Download or read book Introduction to Random Graphs written by Alan Frieze and published by Cambridge University Press. This book was released on 2016 with total page 483 pages. Available in PDF, EPUB and Kindle. Book excerpt: The text covers random graphs from the basic to the advanced, including numerous exercises and recommendations for further reading.
Download or read book Randomization and Approximation Techniques in Computer Science written by Jose D.P. Rolim and published by Springer. This book was released on 2003-08-03 with total page 284 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 6th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2002, held in Cambridge, MA, USA in September 2002. The 21 revised full papers presented were carefully reviewed and selected from 48 submissions. Among the topics addressed are coding, geometric computations, graph colorings, random hypergraphs, graph computations, lattice computations, proof systems, probabilistic algorithms, derandomization, constraint satisfaction, and web graphs analysis.
Download or read book Normal Approximation by Stein s Method written by Louis H.Y. Chen and published by Springer Science & Business Media. This book was released on 2010-10-13 with total page 411 pages. Available in PDF, EPUB and Kindle. Book excerpt: Since its introduction in 1972, Stein’s method has offered a completely novel way of evaluating the quality of normal approximations. Through its characterizing equation approach, it is able to provide approximation error bounds in a wide variety of situations, even in the presence of complicated dependence. Use of the method thus opens the door to the analysis of random phenomena arising in areas including statistics, physics, and molecular biology. Though Stein's method for normal approximation is now mature, the literature has so far lacked a complete self contained treatment. This volume contains thorough coverage of the method’s fundamentals, includes a large number of recent developments in both theory and applications, and will help accelerate the appreciation, understanding, and use of Stein's method by providing the reader with the tools needed to apply it in new situations. It addresses researchers as well as graduate students in Probability, Statistics and Combinatorics.
Download or read book Coding and Cryptology written by Yeow Meng Chee and published by Springer. This book was released on 2011-06-05 with total page 302 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the Third International Workshop on Coding and Cryptology, IWCC 2011, held in Qingdao, China, May 30-June 3, 2011. The 19 revised full technical papers are contributed by the invited speakers of the workshop. The papers were carefully reviewed and cover a broad range of foundational and methodological as well as applicative issues in coding and cryptology, as well as related areas such as combinatorics.
Download or read book Mathematical Adventures in Performance Analysis written by Eitan Bachmat and published by Springer. This book was released on 2014-09-22 with total page 296 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book describes problems in the field of performance analysis, primarily the study of storage systems and the diverse mathematical techniques that are required for solving them. Topics covered include best practices for scheduling I/O requests to a disk drive, how this problem is related to airplane boarding, and how both problems can be modeled using space-time geometry. Also provided is an explanation of how Riemann's proof of the analytic continuation and functional equation of the Riemann zeta function can be used to analyze express line queues in a minimarket. Overall, the book displays the surprising relevance of abstract mathematics that is not usually associated with applied mathematics topics. Advanced undergraduate students or graduate students with an interest in the applications of mathematics will find this book to be a useful resource. It will also be of interest to professional mathematicians who want exposure to the surprising ways that theoretical mathematics may be applied to engineering problems. To encourage further study, each chapter ends with notes pointing to various related topics that the reader may want pursue. This mathematically rigorous work was noted in the news section of the journal Nature, and in popular media such as New Scientist, The Wall Street Journal, The Guardian, and USA Today.
