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.
"synopsis" may belong to another edition of this title.
“This book provides a current survey of techniques and applications of symmetric functions to enumeration theory, with emphasis on the combinatorics of the transition matrices between bases. ... Each chapter ends with a substantial number of exercises along with full solutions, as well as accurate bibliographic notes. The book is definitely a very interesting addition to the literature on the subject.” (Domenico Senato, Mathematical Reviews, February, 2017)
“Though the authors target graduate students, advanced undergraduates will also surely have the necessary prerequisites, easily grasp the book's goals, and find many chapters accessible. ... Summing Up: Recommended. Upper-division undergraduates through professionals/practitioners.” (D. V. Feldman, Choice, Vol. 53 (12), September, 2016)
"About this title" may belong to another edition of this title.
Shipping:
US$ 2.64
Within U.S.A.
Book Description Condition: New. Seller Inventory # 24373994-n
Book Description Hardcover. Condition: new. Seller Inventory # 9783319236179
Book Description Condition: New. Seller Inventory # ABLIING23Mar3113020091424
Book Description Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Seller Inventory # ria9783319236179_lsuk
Book Description Condition: New. Seller Inventory # 24373994-n
Book Description Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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-Knuthalgorithm 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. 304 pp. Englisch. Seller Inventory # 9783319236179
Book Description Condition: New. Seller Inventory # I-9783319236179
Book Description Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. A self-contained introduction to symmetric functions and their use in counting problemsFirst book to consider many of the methods and results presentedUnifies a large number of results in the theory of permutation enumeration Numerou. Seller Inventory # 43799459
Book Description Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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-Knuthalgorithm 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. Seller Inventory # 9783319236179
Book Description Hardcover. Condition: Brand New. 304 pages. French language. 9.25x6.25x0.75 inches. This item is printed on demand. Seller Inventory # zk3319236172