Thomas Lam – författare

Richard Stanley's work in combinatorics revolutionized and reshaped the subject. Many of his hallmark ideas and techniques imported from other areas of mathematics have become mainstays in the framework of modern combinatorics. In addition to collecting several of Stanley's most influential papers, this volume also includes his own short reminiscences on his early years, and on his celebrated proof of The Upper Bound Theorem.

Richard Stanley's work in combinatorics revolutionized and reshaped the subject, inspiring a generation of researchers, through his lectures, papers, and books. In this volume, these researchers explain how Stanley's vision and insights influenced and guided their own perspectives on the subject. As a valuable bonus, this book contains a collection of Stanley's short comments on each of his papers.This book may serve as an introduction to several different threads of ongoing research in combinatorics as well as giving historical perspective.

This book gives an introduction to the very active field of combinatorics of affine Schubert calculus, explains the current state of the art, and states the current open problems. Affine Schubert calculus lies at the crossroads of combinatorics, geometry, and representation theory. Its modern development is motivated by two seemingly unrelated directions. One is the introduction of k-Schur functions in the study of Macdonald polynomial positivity, a mostly combinatorial branch of symmetric function theory. The other direction is the study of the Schubert bases of the (co)homology of the affine Grassmannian, an algebro-topological formulation of a problem in enumerative geometry.This is the first introductory text on this subject. It contains many examples in Sage, a free open source general purpose mathematical software system, to entice the reader to investigate the open problems. This book is written for advanced undergraduate and graduate students, as well as researchers,who want to become familiar with this fascinating new field.