Counting with Symmetric Functions

Counting with Symmetric Functions PDF

Author: Jeffrey Remmel

Publisher: Birkhäuser

Published: 2015-11-28

Total Pages: 292

ISBN-13: 3319236180

DOWNLOAD EBOOK →

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.

Groups, Combinatorics and Geometry

Groups, Combinatorics and Geometry PDF

Author: A A Ivanov

Publisher: World Scientific

Published: 2003-03-19

Total Pages: 348

ISBN-13: 9814486426

DOWNLOAD EBOOK →

Over the past 20 years, the theory of groups — in particular simple groups, finite and algebraic — has influenced a number of diverse areas of mathematics. Such areas include topics where groups have been traditionally applied, such as algebraic combinatorics, finite geometries, Galois theory and permutation groups, as well as several more recent developments. Among the latter are probabilistic and computational group theory, the theory of algebraic groups over number fields, and model theory, in each of which there has been a major recent impetus provided by simple group theory. In addition, there is still great interest in local analysis in finite groups, with substantial new input from methods of geometry and amalgams, and particular emphasis on the revision project for the classification of finite simple groups. This important book contains 20 survey articles covering many of the above developments. It should prove invaluable for those working in the theory of groups and its applications. Contents:Curtis–Phan–Tits Theory (C D Bennett et al.)Derangements in Simple and Primitive Groups (J Fulman & R Guralnick)Computing with Matrix Groups (W M Kantor & Á Seress)Bases of Primitive Permutation Groups (M W Liebeck & A Shalev)Modular Subgroup Arithmetic (T W Müller)Counting Nets in the Monster (S P Norton)Overgroups of Finite Quasiprimitive Permutation Groups (C E Praeger)Old Groups Can Learn New Tricks (L Pyber)Structure and Presentations of Lie-Type Groups (F G Timmesfeld)Computing in the Monster (R A Wilson)and other papers Readership: Graduate students, researchers and academics in algebra. Keywords:Simple Groups;Algebraic Combinatorics;Finite Geometry;Permutation Groups. Probabilistic Group

Counting with Symmetric Functions

Counting with Symmetric Functions PDF

Author: Jeffrey Remmel

Publisher:

Published: 2015

Total Pages:

ISBN-13: 9783319236193

DOWNLOAD EBOOK →

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.

Combinatorial Number Theory

Combinatorial Number Theory PDF

Author: Bruce Landman

Publisher: Walter de Gruyter

Published: 2013-08-29

Total Pages: 168

ISBN-13: 3110280612

DOWNLOAD EBOOK →

This volume contains selected refereed papers based on lectures presented at the "Integers Conference 2011", an international conference in combinatorial number theory that was held in Carrollton, Georgia, United States in October 2011. This was the fifth Integers Conference, held bi-annually since 2003. It featured plenary lectures presented by Ken Ono, Carla Savage, Laszlo Szekely, Frank Thorne, and Julia Wolf, along with sixty other research talks. This volume consists of ten refereed articles, which are expanded and revised versions of talks presented at the conference. They represent a broad range of topics in the areas of number theory and combinatorics including multiplicative number theory, additive number theory, game theory, Ramsey theory, enumerative combinatorics, elementary number theory, the theory of partitions, and integer sequences.

Lanterna Rally - Theme by Grace Themes