Polynomial Identities and Combinatorial Methods presents a wide range of perspectives on topics ranging from ring theory and combinatorics to invariant theory and associative algebras. It covers recent breakthroughs and strategies impacting research on polynomial identities and identifies new concepts in algebraic combinatorics, invariant and representation theory, and Lie algebras and superalgebras for novel studies in the field. It presents intensive discussions on various methods and techniques relating the theory of polynomial identities to other branches of algebraic study and includes discussions on Hopf algebras and quantum polynomials, free algebras and Scheier varieties.

This volume contains the talks given at the INDAM workshop entitled "Polynomial identites in algebras", held in Rome in September 2019. The purpose of the book is to present the current state of the art in the theory of PI-algebras. The review of the classical results in the last few years has pointed out new perspectives for the development of the theory. In particular, the contributions emphasize on the computational and combinatorial aspects of the theory, its connection with invariant theory, representation theory, growth problems. It is addressed to researchers in the field.

This book gives a state of the art approach to the study of polynomial identities satisfied by a given algebra by combining methods of ring theory, combinatorics, and representation theory of groups with analysis. The idea of applying analytical methods to the theory of polynomial identities appeared in the early 1970s and this approach has become one of the most powerful tools of the theory. A PI-algebra is any algebra satisfying at least one nontrivial polynomial identity. This includes the polynomial rings in one or several variables, the Grassmann algebra, finite-dimensional algebras, and many other algebras occurring naturally in mathematics. The core of the book is the proof that the sequence of co-dimensions of any PI-algebra has integral exponential growth - the PI-exponent of the algebra. Later chapters further apply these results to subjects such as a characterization of varieties of algebras having polynomial growth and a classification of varieties that are minimal for a given exponent.

This combinatorics text provides in-depth coverage of recurrences, generating functions, partitions, and permutations, along with some of the most interesting graph and network topics, design constructions, and finite geometries. It presents the computer and software algorithms in pseudo-code and incorporates definitions, theorems, proofs, examples, and nearly 300 illustrations as pedagogical elements of the exposition. Numerous problems, solutions, and hints reinforce basic skills and assist with creative problem solving. The author also offers a website with extensive graph theory informational resources as well as a computational engine to help with calculations for some of the exercises.

The main purpose of this book is to show how ideas from combinatorial group theory have spread to two other areas of mathematics: the theory of Lie algebras and affine algebraic geometry. Some of these ideas, in turn, came to combinatorial group theory from low-dimensional topology in the beginning of the 20th Century.

Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology, and information theory. With a careful combination of symbolic enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of the topic. The authors give full coverage of the underlying mathematics and a thorough treatment of both classical and modern applications of the theory. The text is complemented with exercises, examples, appendices and notes to aid understanding. The book can be used for an advanced undergraduate or a graduate course, or for self-study.

The special issue contains research papers with various topics in many different branches of mathematics, applied mathematics, and mathematical physics. Each paper presents mathematical theory, methods, and their application based on current and recent developing symmetric polynomials. Also, each one aims to provide the full understanding of current research problems, theories, and applications on the chosen topics and contains the most recent advances made in the area of symmetric functions and polynomials.

Bijective proofs are some of the most elegant and powerful techniques in all of mathematics. Suitable for readers without prior background in algebra or combinatorics, Bijective Combinatorics presents a general introduction to enumerative and algebraic combinatorics that emphasizes bijective methods.The text systematically develops the mathematical