Many sequences of combinatorial interest are known to be unimodal or log-concave and there has been a considerable amount of interest devoted to this topic. The main object of this work is to point out another branch of mathematics that can be successfully used to attack these kinds of problems, namely, the theory of total positivity.

This book contains twenty-two papers presented at the International Conference in Combinatorics, held in Jerusalem in May 1993. The papers describe some of the latest developments in algebraic combinatorics, enumeration, graph and hypergraph theory, combinatorial geometry, and geometry of polytopes and arrangements. The papers are accessible to specialists as well as nonspecialists.

Richard Stanley's work in combinatorics revolutionized and reshaped the subject. His lectures, papers, and books inspired a generation of researchers. 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.

Combinatorics and Number Theory of Counting Sequences is an introduction to the theory of finite set partitions and to the enumeration of cycle decompositions of permutations. The presentation prioritizes elementary enumerative proofs. Therefore, parts of the book are designed so that even those high school students and teachers who are interested in combinatorics can have the benefit of them. Still, the book collects vast, up-to-date information for many counting sequences (especially, related to set partitions and permutations), so it is a must-have piece for those mathematicians who do research on enumerative combinatorics. In addition, the book contains number theoretical results on counting sequences of set partitions and permutations, so number theorists who would like to see nice applications of their area of interest in combinatorics will enjoy the book, too. Features The Outlook sections at the end of each chapter guide the reader towards topics not covered in the book, and many of the Outlook items point towards new research problems. An extensive bibliography and tables at the end make the book usable as a standard reference. Citations to results which were scattered in the literature now become easy, because huge parts of the book (especially in parts II and III) appear in book form for the first time.

The book offers a comprehensive introduction to Leavitt path algebras (LPAs) and graph C*-algebras. Highlighting their significant connection with classical K-theory—which plays an important role in mathematics and its related emerging fields—this book allows readers from diverse mathematical backgrounds to understand and appreciate these structures. The articles on LPAs are mostly of an expository nature and the ones dealing with K-theory provide new proofs and are accessible to interested students and beginners of the field. It is a useful resource for graduate students and researchers working in this field and related areas, such as C*-algebras and symbolic dynamics.

The articles in this collection present new results in combinatorics, algebra, algebraic geometry, dynamical systems, analysis, and probability. Of particular interest is the survey article by A. N. Kirillov devoted to combinatorics of Young diagrams and related problems of representation theory. Also included are articles devoted to the eightieth birthday of renowned Russian mathematician, V. A. Rokhlin, ``Remembrances of V. A. Rokhlin'', by I. R. Shafarevich, and ``An Unfinished Project of V.A. Rokhlin'', by V. N. Sudakov. The results, ideas, and methods given in the book will be of interest to a broad range of specialists.

Polynomials are incredibly useful mathematical tools that have a wide array of applications. This book provides a comprehensive overview of polynomials and recent developments in the field. It includes ten chapters that address such topics as polynomials-based cyclic coding, Hermite polynomials, Routh polynomials, fitting parametric polynomials with control point coefficients, the thermoelastic wave model, and much more.