This text consists of a sequence of problems which develop a variety of aspects in the field of semigroupsof operators. Many of the problems are not found easily in other books. Written in the Socratic/Moore method, this is a problem book without the answers presented. To get the most out of the content requires high motivation from the reader to work out the exercises. The reader is given the opportunity to discover important developments of the subject and to quickly arrive at the point of independent research. The compactness of the volume and the reputation of the author lends this consider set of problems to be a 'classic' in the making. This text is highly recommended for us as supplementary material for 3 graduate level courses.

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.

A textbook for an undergraduate course, requiring only a knowledge of basic linear algebra. Explains how to compute presentations for finitely generated cancellative monoids, and from a presentation of a monoid, decide whether this monoid is cancellative, reduced, separative, finite, torsion free, group, affine, full, normal, etc. Of most interest to people working with semigroup theory, but also in other areas of algebra. Annotation copyrighted by Book News, Inc., Portland, OR

This book explores the theory of strongly continuous one-parameter semigroups of linear operators. A special feature of the text is an unusually wide range of applications such as to ordinary and partial differential operators, to delay and Volterra equations, and to control theory. Also, the book places an emphasis on philosophical motivation and the historical background.

This volume contains papers which are based primarily on talks given at an inter national conference on Algorithmic Problems in Groups and Semigroups held at the University of Nebraska-Lincoln from May ll-May 16, 1998. The conference coincided with the Centennial Celebration of the Department of Mathematics and Statistics at the University of Nebraska-Lincoln on the occasion of the one hun dredth anniversary of the granting of the first Ph.D. by the department. Funding was provided by the US National Science Foundation, the Department of Math ematics and Statistics, and the College of Arts and Sciences at the University of Nebraska-Lincoln, through the College's focus program in Discrete, Experimental and Applied Mathematics. The purpose of the conference was to bring together researchers with interests in algorithmic problems in group theory, semigroup theory and computer science. A particularly useful feature of this conference was that it provided a framework for exchange of ideas between the research communities in semigroup theory and group theory, and several of the papers collected here reflect this interac tion of ideas. The papers collected in this volume represent a cross section of some of the results and ideas that were discussed in the conference. They reflect a synthesis of overlapping ideas and techniques stimulated by problems concerning finite monoids, finitely presented mono ids, finitely presented groups and free groups.

This book deals mainly with modelling systems that change with time. The evolution equations that it describes can be found in a number of application areas, such as kinetics, fragmentation theory and mathematical biology. This will be the first self-contained account of the area.

Since the publication of Herbert Spencer's Principles of Sociology in 1875, the use of social structure as a defining concept has produced a large body of creative speculations, insights, and intuitions about social life. However, writers in this tradition do not always provide the sorts of formal definitons and propositions that are the building blocks of modern social research. In its broad-ranging examination of the kind of data that form the basis for the systematic study of social structure, Research Methods in Social Network Analysis marks a significant methodological advance in network studies.As used in this volume, social structure refers to a bundle of intuitive natural language ideas and concepts about patterning in social relationships among people. In contrast, social networks is used to refer to a collection of precise analytic and methodological concepts and procedures that facilitate the collection of data and the systematic study of such patterning. Accordingly, the book's five sections are arranged to address analytical problems in a series of logically ordered stages or processes.The major contributors define the fundamental modes by which social structural phenomena are to be represented; how boundaries to a social structure are set; how the relations of a network are measured in terms of structure and content; the ways in which the relational structure of a network affects system actors; and how actors within a social network are clustered into cliques or groups. The chapters in the last section build on solutions to problems proposed in the previous sections. This highly unified approach to research design combined with a representative diversity of viewpoints makes Research Methods in Social Network Analysis a state-of-the-art volume.