This book contains the extended abstracts presented at the 12th International Conference on Power Series and Algebraic Combinatorics (FPSAC '00) that took place at Moscow State University, June 26-30, 2000. These proceedings cover the most recent trends in algebraic and bijective combinatorics, including classical combinatorics, combinatorial computer algebra, combinatorial identities, combinatorics of classical groups, Lie algebra and quantum groups, enumeration, symmetric functions, young tableaux etc...

Because of the inteplay among many fields of mathematics and science, algebraic combinatorics is an area in which a wide variety of ideas and methods come together. The papers in this volume reflect the most interesting aspects of this rich interaction and will be of interest to researchers in discrete mathematics and combinatorial systems.

Because of the interplay among many fields of mathematics and science, algebraic combinatorics is an area in which a wide variety of ideas and methods come together. The papers in this volume reflect the most interesting aspects of this rich interaction, and will be of interest to researchers in discrete mathematics and combinatorial systems.

Combinatorial Algebra: Syntax and Semantics provides comprehensive account of many areas of combinatorial algebra. It contains self-contained proofs of more than 20 fundamental results, both classical and modern. This includes Golod–Shafarevich and Olshanskii's solutions of Burnside problems, Shirshov's solution of Kurosh's problem for PI rings, Belov's solution of Specht's problem for varieties of rings, Grigorchuk's solution of Milnor's problem, Bass–Guivarc'h theorem about growth of nilpotent groups, Kleiman's solution of Hanna Neumann's problem for varieties of groups, Adian's solution of von Neumann-Day's problem, Trahtman's solution of the road coloring problem of Adler, Goodwyn and Weiss. The book emphasize several ``universal" tools, such as trees, subshifts, uniformly recurrent words, diagrams and automata. With over 350 exercises at various levels of difficulty and with hints for the more difficult problems, this book can be used as a textbook, and aims to reach a wide and diversified audience. No prerequisites beyond standard courses in linear and abstract algebra are required. The broad appeal of this textbook extends to a variety of student levels: from advanced high-schoolers to undergraduates and graduate students, including those in search of a Ph.D. thesis who will benefit from the “Further reading and open problems” sections at the end of Chapters 2 –5. The book can also be used for self-study, engaging those beyond t he classroom setting: researchers, instructors, students, virtually anyone who wishes to learn and better understand this important area of mathematics.

This is the first book where mathematics and computer science are directly confronted and joined to tackle intricate problems in computer science with deep mathematical approaches. It contains a collection of refereed papers presented at the Colloquium on Mathematics and Computer Science held at the University of Versailles-St-Quentin on September 18-20, 2000. The colloquium was a meeting place for researchers in mathematics and computer science and thus an important opportunity to exchange ideas and points of view, and to present new approaches and new results in the common areas such as algorithms analysis, trees, combinatorics, optimization, performance evaluation and probabilities. The book is intended for a large public in applied mathematics, discrete mathematics and computer science, including researchers, teachers, graduate students and engineers. It provides an overview of the current questions in computer science and related modern mathematical methods. The range of applications is very wide and reaches beyond computer science.

Aimed at graduate students and researchers in enumerative combinatorics, this book is the first to treat the analytic aspects of combinatorial enumeration from a multivariate perspective.

Algebra, as we know it today, consists of many different ideas, concepts and results. A reasonable estimate of the number of these different items would be somewhere between 50,000 and 200,000. Many of these have been named and many more could (and perhaps should) have a name or a convenient designation. Even the nonspecialist is likely to encounter most of these, either somewhere in the literature, disguised as a definition or a theorem or to hear about them and feel the need for more information. If this happens, one should be able to find enough information in this Handbook to judge if it is worthwhile to pursue the quest.In addition to the primary information given in the Handbook, there are references to relevant articles, books or lecture notes to help the reader. An excellent index has been included which is extensive and not limited to definitions, theorems etc.The Handbook of Algebra will publish articles as they are received and thus the reader will find in this third volume articles from twelve different sections. The advantages of this scheme are two-fold: accepted articles will be published quickly and the outline of the Handbook can be allowed to evolve as the various volumes are published.A particularly important function of the Handbook is to provide professional mathematicians working in an area other than their own with sufficient information on the topic in question if and when it is needed.- Thorough and practical source of information - Provides in-depth coverage of new topics in algebra - Includes references to relevant articles, books and lecture notes

This book presents a domain of extreme industrial and scientific interest: the study of smart systems and structures. It presents polytope projects as comprehensive physical and cognitive architectures that support the investigation, fabrication and implementation of smart systems and structures. These systems feature multifunctional components that can perform sensing, control, and actuation. In light of the fact that devices, tools, methodologies and organizations based on electronics and information technology for automation, specific to the third industrial revolution, are increasingly reaching their limits, it is essential that smart systems be implemented in industry. Polytope projects facilitate the utilization of smart systems and structures as key elements of the fourth industrial revolution. The book begins by presenting polytope projects as a reference architecture for cyber-physical systems and smart systems, before addressing industrial process synthesis in Chapter 2. Flow-sheet trees, cyclic separations and smart configurations for multi-component separations are discussed here. In turn, Chapter 3 highlights periodic features for drug delivery systems and networks of chemical reactions, while Chapter 4 applies conditioned random walks to polymers and smart materials structures. Chapter 5 examines self-assembly and self-reconfiguration at different scales from molecular to micro systems. Smart devices and technologies are the focus of chapter 6. Modular micro reactor systems and timed automata are examined in selected case studies. Chapter 7 focuses on inferential engineering designs, concept-knowledge, relational concept analysis and model driven architecture, while Chapter 8 puts the spotlight on smart manufacturing, industry 4.0, reference architectures and models for new product development and testing. Lastly, Chapter 9 highlights the polytope projects methodology and the prospects for smart systems and structures. Focusing on process engineering and mathematical modeling for the fourth industrial revolution, the book offers a unique resource for engineers, scientists and entrepreneurs working in chemical, biochemical, pharmaceutical, materials science or systems chemistry, students in various domains of production and engineering, and applied mathematicians.

View the abstract.

This graduate level text is distinguished both by the range of topics and the novelty of the material it treats--more than half of the material in it has previously only appeared in research papers. The first half of this book introduces the characteristic and matchings polynomials of a graph. It is instructive to consider these polynomials together because they have a number of properties in common. The matchings polynomial has links with a number of problems in combinatorial enumeration, particularly some of the current work on the combinatorics of orthogonal polynomials. This connection is discussed at some length, and is also in part the stimulus for the inclusion of chapters on orthogonal polynomials and formal power series. Many of the properties of orthogonal polynomials are derived from properties of characteristic polynomials. The second half of the book introduces the theory of polynomial spaces, which provide easy access to a number of important results in design theory, coding theory and the theory of association schemes. This book should be of interest to second year graduate text/reference in mathematics.