This book presents methods of solving problems in three areas of elementary combinatorial mathematics: classical combinatorics, combinatorial arithmetic, and combinatorial geometry. Brief theoretical discussions are immediately followed by carefully worked-out examples of increasing degrees of difficulty and by exercises that range from routine to rather challenging. The book features approximately 310 examples and 650 exercises.

This open access book presents novel theoretical, empirical and experimental work exploring the nature of mental representations that support natural language production and understanding, and other manifestations of cognition. One fundamental question raised in the text is whether requisite knowledge structures can be adequately modeled by means of a uniform representational format, and if so, what exactly is its nature. Frames are a key topic covered which have had a strong impact on the exploration of knowledge representations in artificial intelligence, psychology and linguistics; cascades are a novel development in frame theory. Other key subject areas explored are: concepts and categorization, the experimental investigation of mental representation, as well as cognitive analysis in semantics. This book is of interest to students, researchers, and professionals working on cognition in the fields of linguistics, philosophy, and psychology.

This book is a unique teaching tool that takes math lovers on a journey designed to motivate kids (and kids at heart) to learn the fun of factoring and prime numbers. This volume visually explores the concepts of factoring and the role of prime and composite numbers. The playful and colorful monsters are designed to give children (and even older audiences) an intuitive understanding of the building blocks of numbers and the basics of multiplication. The introduction and appendices can also help adult readers answer questions about factoring from their young audience. The artwork is crisp and creative and the colors are bright and engaging, making this volume a welcome deviation from standard math texts. Any person, regardless of age, can profit from reading this book. Readers will find themselves returning to its pages for a very long time, continually learning from and getting to know the monsters as their knowledge expands. You Can Count on Monsters is a magnificent addition for any math education program and is enthusiastically recommended to every teacher, parent and grandparent, student, child, or other individual interested in exploring the visually fascinating world of the numbers 1 through 100.

A look at solving problems in three areas of classical elementary mathematics: equations and systems of equations of various kinds, algebraic inequalities, and elementary number theory, in particular divisibility and diophantine equations. In each topic, brief theoretical discussions are followed by carefully worked out examples of increasing difficulty, and by exercises which range from routine to rather more challenging problems. While it emphasizes some methods that are not usually covered in beginning university courses, the book nevertheless teaches techniques and skills which are useful beyond the specific topics covered here. With approximately 330 examples and 760 exercises.

Through this book, upper undergraduate mathematics majors will master a challenging yet rewarding subject, and approach advanced studies in algebra, number theory and geometry with confidence. Groups, rings and fields are covered in depth with a strong emphasis on irreducible polynomials, a fresh approach to modules and linear algebra, a fresh take on Gröbner theory, and a group theoretic treatment of Rejewski's deciphering of the Enigma machine. It includes a detailed treatment of the basics on finite groups, including Sylow theory and the structure of finite abelian groups. Galois theory and its applications to polynomial equations and geometric constructions are treated in depth. Those interested in computations will appreciate the novel treatment of division algorithms. This rigorous text 'gets to the point', focusing on concisely demonstrating the concept at hand, taking a 'definitions first, examples next' approach. Exercises reinforce the main ideas of the text and encourage students' creativity.

This volume contains papers which were contributed for presentation at the international conference "Fundamentals of Computation Theory - FCT '91" heldat Gosen, near Berlin, September 9-13, 1991. This was the eighth in the series of FCT conferences organized every odd year. The programme of theconference, including invited lectures and selected contributions, falls into the following categories: - Semantics and logical concepts in the theory of computing, formal specification, - Automata and formal languages, Computational geometry, - Algorithmic aspects of algebra and algebraic geometry, cryptography, - Complexity (sequential, parallel, distributed computing, structure, lower bounds, complexity of analytical problems, general concepts), - Algorithms (efficient, probabilistic, parallel, sequential, distributed), - Counting and combinatorics in connection with mathematical computer science. The proceedings of previous FCT meetings are available as Lecture Notes in Computer Science (Vols. 380, 278, 199, 158, 117, 56).

The Mathematics of Chip-firing is a solid introduction and overview of the growing field of chip-firing. It offers an appreciation for the richness and diversity of the subject. Chip-firing refers to a discrete dynamical system — a commodity is exchanged between sites of a network according to very simple local rules. Although governed by local rules, the long-term global behavior of the system reveals fascinating properties. The Fundamental properties of chip-firing are covered from a variety of perspectives. This gives the reader both a broad context of the field and concrete entry points from different backgrounds. Broken into two sections, the first examines the fundamentals of chip-firing, while the second half presents more general frameworks for chip-firing. Instructors and students will discover that this book provides a comprehensive background to approaching original sources. Features: Provides a broad introduction for researchers interested in the subject of chip-firing The text includes historical and current perspectives Exercises included at the end of each chapter About the Author: Caroline J. Klivans received a BA degree in mathematics from Cornell University and a PhD in applied mathematics from MIT. Currently, she is an Associate Professor in the Division of Applied Mathematics at Brown University. She is also an Associate Director of ICERM (Institute for Computational and Experimental Research in Mathematics). Before coming to Brown she held positions at MSRI, Cornell and the University of Chicago. Her research is in algebraic, geometric and topological combinatorics.

This is the only book on the topic of geometric configurations of points and lines. It presents in detail the history of the topic, with its surges and declines since its beginning in 1876. It covers all the advances in the field since the revival of interest in geometric configurations some 20 years ago. The author's contributions are central to this revival. In particular, he initiated the study of 4-configurations (that is, those that contain four points on each line, and four lines through each point); the results are fully described in the text. The main novelty in the approach to all geometric configurations is the concentration on their symmetries, which make it possible to deal with configurations of rather large sizes. The book brings the readers to the limits of present knowledge in a leisurely way, enabling them to enjoy the material as well as entice them to try their hand at expanding it.

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.