[PDF] Counting With Symmetric Functions eBook

Author : Jeffrey Remmel
Publisher : Birkhäuser
Page : 297 pages
File Size : 45,25 MB
Release : 2015-11-28
Category : Mathematics
ISBN : 3319236180

GET BOOK

This monograph provides a self-contained introduction to symmetric functions and their use in enumerative combinatorics. It is the first book to explore many of the methods and results that the authors present. Numerous exercises are included throughout, along with full solutions, to illustrate concepts and also highlight many interesting mathematical ideas. The text begins by introducing fundamental combinatorial objects such as permutations and integer partitions, as well as generating functions. Symmetric functions are considered in the next chapter, with a unique emphasis on the combinatorics of the transition matrices between bases of symmetric functions. Chapter 3 uses this introductory material to describe how to find an assortment of generating functions for permutation statistics, and then these techniques are extended to find generating functions for a variety of objects in Chapter 4. The next two chapters present the Robinson-Schensted-Knuth algorithm and a method for proving Pólya’s enumeration theorem using symmetric functions. Chapters 7 and 8 are more specialized than the preceding ones, covering consecutive pattern matches in permutations, words, cycles, and alternating permutations and introducing the reciprocity method as a way to define ring homomorphisms with desirable properties. Counting with Symmetric Functions will appeal to graduate students and researchers in mathematics or related subjects who are interested in counting methods, generating functions, or symmetric functions. The unique approach taken and results and exercises explored by the authors make it an important contribution to the mathematical literature.

Author : Ian Grant Macdonald
Publisher : Oxford University Press
Page : 496 pages
File Size : 12,88 MB
Release : 1998
Category : Mathematics
ISBN : 9780198504504

GET BOOK

This reissued classic text is the acclaimed second edition of Professor Ian Macdonald's groundbreaking monograph on symmetric functions and Hall polynomials. The first edition was published in 1979, before being significantly expanded into the present edition in 1995. This text is widely regarded as the best source of information on Hall polynomials and what have come to be known as Macdonald polynomials, central to a number of key developments in mathematics and mathematical physics in the 21st century Macdonald polynomials gave rise to the subject of double affine Hecke algebras (or Cherednik algebras) important in representation theory. String theorists use Macdonald polynomials to attack the so-called AGT conjectures. Macdonald polynomials have been recently used to construct knot invariants. They are also a central tool for a theory of integrable stochastic models that have found a number of applications in probability, such as random matrices, directed polymers in random media, driven lattice gases, and so on. Macdonald polynomials have become a part of basic material that a researcher simply must know if (s)he wants to work in one of the above domains, ensuring this new edition will appeal to a very broad mathematical audience. Featuring a new foreword by Professor Richard Stanley of MIT.

Author : Bruce E. Sagan
Publisher : American Mathematical Soc.
Page : 304 pages
File Size : 22,56 MB
Release : 2020-10-16
Category : Education
ISBN : 1470460327

GET BOOK

This book is a gentle introduction to the enumerative part of combinatorics suitable for study at the advanced undergraduate or beginning graduate level. In addition to covering all the standard techniques for counting combinatorial objects, the text contains material from the research literature which has never before appeared in print, such as the use of quotient posets to study the Möbius function and characteristic polynomial of a partially ordered set, or the connection between quasisymmetric functions and pattern avoidance. The book assumes minimal background, and a first course in abstract algebra should suffice. The exposition is very reader friendly: keeping a moderate pace, using lots of examples, emphasizing recurring themes, and frankly expressing the delight the author takes in mathematics in general and combinatorics in particular.

Author : James Haglund
Publisher : American Mathematical Soc.
Page : 178 pages
File Size : 45,23 MB
Release : 2008
Category : Mathematics
ISBN : 0821844113

GET BOOK

This work contains detailed descriptions of developments in the combinatorics of the space of diagonal harmonics, a topic at the forefront of current research in algebraic combinatorics. These developments have led in turn to some surprising discoveries in the combinatorics of Macdonald polynomials.

Author : Eric S. Egge
Publisher : American Mathematical Soc.
Page : 342 pages
File Size : 22,90 MB
Release : 2019-11-18
Category : Education
ISBN : 1470448998

GET BOOK

This book is a reader-friendly introduction to the theory of symmetric functions, and it includes fundamental topics such as the monomial, elementary, homogeneous, and Schur function bases; the skew Schur functions; the Jacobi–Trudi identities; the involution ω ω; the Hall inner product; Cauchy's formula; the RSK correspondence and how to implement it with both insertion and growth diagrams; the Pieri rules; the Murnaghan–Nakayama rule; Knuth equivalence; jeu de taquin; and the Littlewood–Richardson rule. The book also includes glimpses of recent developments and active areas of research, including Grothendieck polynomials, dual stable Grothendieck polynomials, Stanley's chromatic symmetric function, and Stanley's chromatic tree conjecture. Written in a conversational style, the book contains many motivating and illustrative examples. Whenever possible it takes a combinatorial approach, using bijections, involutions, and combinatorial ideas to prove algebraic results. The prerequisites for this book are minimal—familiarity with linear algebra, partitions, and generating functions is all one needs to get started. This makes the book accessible to a wide array of undergraduates interested in combinatorics.

Author : Alain Lascoux
Publisher : American Mathematical Soc.
Page : 282 pages
File Size : 43,64 MB
Release : 2003
Category : Mathematics
ISBN : 0821828711

GET BOOK

The theory of symmetric functions is an old topic in mathematics, which is used as an algebraic tool in many classical fields. With $\lambda$-rings, one can regard symmetric functions as operators on polynomials and reduce the theory to just a handful of fundamental formulas. One of the main goals of the book is to describe the technique of $\lambda$-rings. The main applications of this technique to the theory of symmetric functions are related to the Euclid algorithm and its occurrence in division, continued fractions, Pade approximants, and orthogonal polynomials. Putting the emphasis on the symmetric group instead of symmetric functions, one can extend the theory to non-symmetric polynomials, with Schur functions being replaced by Schubert polynomials. In two independent chapters, the author describes the main properties of these polynomials, following either the approach of Newton and interpolation methods, or the method of Cauchy and the diagonalization of a kernel generalizing the resultant. The last chapter sketches a non-commutative version of symmetric functions, with the help of Young tableaux and the plactic monoid. The book also contains numerous exercises clarifying and extending many points of the main text.

Author : Diane L. Herrmann
Publisher : CRC Press
Page : 446 pages
File Size : 22,97 MB
Release : 2012-10-18
Category : Mathematics
ISBN : 1466554649

GET BOOK

Through a careful treatment of number theory and geometry, Number, Shape, & Symmetry: An Introduction to Number Theory, Geometry, and Group Theory helps readers understand serious mathematical ideas and proofs. Classroom-tested, the book draws on the authors’ successful work with undergraduate students at the University of Chicago, seventh to tenth grade mathematically talented students in the University of Chicago’s Young Scholars Program, and elementary public school teachers in the Seminars for Endorsement in Science and Mathematics Education (SESAME). The first half of the book focuses on number theory, beginning with the rules of arithmetic (axioms for the integers). The authors then present all the basic ideas and applications of divisibility, primes, and modular arithmetic. They also introduce the abstract notion of a group and include numerous examples. The final topics on number theory consist of rational numbers, real numbers, and ideas about infinity. Moving on to geometry, the text covers polygons and polyhedra, including the construction of regular polygons and regular polyhedra. It studies tessellation by looking at patterns in the plane, especially those made by regular polygons or sets of regular polygons. The text also determines the symmetry groups of these figures and patterns, demonstrating how groups arise in both geometry and number theory. The book is suitable for pre-service or in-service training for elementary school teachers, general education mathematics or math for liberal arts undergraduate-level courses, and enrichment activities for high school students or math clubs.

Author : Peter J. Cameron
Publisher : Cambridge University Press
Page : 235 pages
File Size : 20,44 MB
Release : 2017-06-29
Category : Mathematics
ISBN : 1108417361

GET BOOK

An introduction to enumerative combinatorics, vital to many areas of mathematics. It is suitable as a class text or for individual study.

Author : Martin Aigner
Publisher : Springer Science & Business Media
Page : 568 pages
File Size : 17,29 MB
Release : 2007-06-28
Category : Mathematics
ISBN : 3540390359

GET BOOK

Combinatorial enumeration is a readily accessible subject full of easily stated, but sometimes tantalizingly difficult problems. This book leads the reader in a leisurely way from basic notions of combinatorial enumeration to a variety of topics, ranging from algebra to statistical physics. The book is organized in three parts: Basics, Methods, and Topics. The aim is to introduce readers to a fascinating field, and to offer a sophisticated source of information for professional mathematicians desiring to learn more. There are 666 exercises, and every chapter ends with a highlight section, discussing in detail a particularly beautiful or famous result.

Author : Miklos Bona
Publisher : CRC Press
Page : 1073 pages
File Size : 35,36 MB
Release : 2015-03-24
Category : Mathematics
ISBN : 1482220865

GET BOOK

Presenting the state of the art, the Handbook of Enumerative Combinatorics brings together the work of today's most prominent researchers. The contributors survey the methods of combinatorial enumeration along with the most frequent applications of these methods.This important new work is edited by Miklos Bona of the University of Florida where he