Algorithmic Algebraic Combinatorics and Gröbner Bases

Algorithmic Algebraic Combinatorics and Gröbner Bases
Author: Mikhail Klin
Publisher: Springer Science & Business Media
Total Pages: 315
Release: 2009-12-24
Genre: Mathematics
ISBN: 3642019609

Download Algorithmic Algebraic Combinatorics and Gröbner Bases Book in PDF, Epub and Kindle

This collection of tutorial and research papers introduces readers to diverse areas of modern pure and applied algebraic combinatorics and finite geometries. There is special emphasis on algorithmic aspects and the use of the theory of Gröbner bases.

Recent Results in the Theory of Graph Spectra

Recent Results in the Theory of Graph Spectra
Author: D.M. Cvetkovic
Publisher: Elsevier
Total Pages: 319
Release: 1988-01-01
Genre: Mathematics
ISBN: 0080867766

Download Recent Results in the Theory of Graph Spectra Book in PDF, Epub and Kindle

The purpose of this volume is to review the results in spectral graph theory which have appeared since 1978. The problem of characterizing graphs with least eigenvalue -2 was one of the original problems of spectral graph theory. The techniques used in the investigation of this problem have continued to be useful in other contexts including forbidden subgraph techniques as well as geometric methods involving root systems. In the meantime, the particular problem giving rise to these methods has been solved almost completely. This is indicated in Chapter 1. The study of various combinatorial objects (including distance regular and distance transitive graphs, association schemes, and block designs) have made use of eigenvalue techniques, usually as a method to show the nonexistence of objects with certain parameters. The basic method is to construct a graph which contains the structure of the combinatorial object and then to use the properties of the eigenvalues of the graph. Methods of this type are given in Chapter 2. Several topics have been included in Chapter 3, including the relationships between the spectrum and automorphism group of a graph, the graph isomorphism and the graph reconstruction problem, spectra of random graphs, and the Shannon capacity problem. Some graph polynomials related to the characteristic polynomial are described in Chapter 4. These include the matching, distance, and permanental polynomials. Applications of the theory of graph spectra to Chemistry and other branches of science are described from a mathematical viewpoint in Chapter 5. The last chapter is devoted to the extension of the theory of graph spectra to infinite graphs.

Symmetry in Graphs

Symmetry in Graphs
Author: Ted Dobson
Publisher: Cambridge University Press
Total Pages: 527
Release: 2022-05-12
Genre: Language Arts & Disciplines
ISBN: 1108429068

Download Symmetry in Graphs Book in PDF, Epub and Kindle

The first full-length book on the theme of symmetry in graphs, a fast-growing topic in algebraic graph theory.

Combinatorics and Applications

Combinatorics and Applications
Author: K. S. Vijayan
Publisher:
Total Pages: 418
Release: 1984
Genre: Combinatorial analysis
ISBN:

Download Combinatorics and Applications Book in PDF, Epub and Kindle

Orthogonal Polynomials

Orthogonal Polynomials
Author: Paul Nevai
Publisher: Springer Science & Business Media
Total Pages: 472
Release: 2012-12-06
Genre: Mathematics
ISBN: 9400905017

Download Orthogonal Polynomials Book in PDF, Epub and Kindle

This volume contains the Proceedings of the NATO Advanced Study Institute on "Orthogonal Polynomials and Their Applications" held at The Ohio State University in Columbus, Ohio, U.S.A. between May 22,1989 and June 3,1989. The Advanced Study Institute primarily concentrated on those aspects of the theory and practice of orthogonal polynomials which surfaced in the past decade when the theory of orthogonal polynomials started to experience an unparalleled growth. This progress started with Richard Askey's Regional Confer ence Lectures on "Orthogonal Polynomials and Special Functions" in 1975, and subsequent discoveries led to a substantial revaluation of one's perceptions as to the nature of orthogonal polynomials and their applicability. The recent popularity of orthogonal polynomials is only partially due to Louis de Branges's solution of the Bieberbach conjecture which uses an inequality of Askey and Gasper on Jacobi polynomials. The main reason lies in their wide applicability in areas such as Pade approximations, continued fractions, Tauberian theorems, numerical analysis, probability theory, mathematical statistics, scattering theory, nuclear physics, solid state physics, digital signal processing, electrical engineering, theoretical chemistry and so forth. This was emphasized and convincingly demonstrated during the presentations by both the principal speakers and the invited special lecturers. The main subjects of our Advanced Study Institute included complex orthogonal polynomials, signal processing, the recursion method, combinatorial interpretations of orthogonal polynomials, computational problems, potential theory, Pade approximations, Julia sets, special functions, quantum groups, weighted approximations, orthogonal polynomials associated with root systems, matrix orthogonal polynomials, operator theory and group representations.

Distance-Regular Graphs

Distance-Regular Graphs
Author: Andries E. Brouwer
Publisher: Springer Science & Business Media
Total Pages: 513
Release: 2012-12-06
Genre: Mathematics
ISBN: 3642743412

Download Distance-Regular Graphs Book in PDF, Epub and Kindle

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.

Combinatorics of Symmetric Designs

Combinatorics of Symmetric Designs
Author: Yury J. Ionin
Publisher: Cambridge University Press
Total Pages: 548
Release: 2006-05-25
Genre: Language Arts & Disciplines
ISBN: 9780521818339

Download Combinatorics of Symmetric Designs Book in PDF, Epub and Kindle

The aim of this book is to provide a unified exposition of the theory of symmetric designs with emphasis on recent developments. The authors cover the combinatorial aspects of the theory giving particular attention to the construction of symmetric designs and related objects. All researchers in combinatorial designs, coding theory, and finite geometries will find much of interest here, and this book can also serve as a text for an advanced course in combinatorial designs.

Notices of the American Mathematical Society

Notices of the American Mathematical Society
Author: American Mathematical Society
Publisher:
Total Pages: 488
Release: 1974
Genre: Electronic journals
ISBN:

Download Notices of the American Mathematical Society Book in PDF, Epub and Kindle

Contains articles of significant interest to mathematicians, including reports on current mathematical research.