63 products were found matching your search for Enumeration in 1 shops:

For well over a century, academic disciplines have studied human behavior using quantitative information. Until recently, however, the humanities have remained largely immune to the use of data—or vigorously resisted it. Thanks to new developments in computer science and natural language processing, literary scholars have embraced the quantitative study of literary works and have helped make Digital Humanities a rapidly growing field. But these developments raise a fundamental, and as yet unanswered question: what is the meaning of literary quantity?           In Enumerations, Andrew Piper answers that question across a variety of domains fundamental to the study of literature. He focuses on the elementary particles of literature, from the role of punctuation in poetry, the matter of plot in novels, the study of topoi, and the behavior of characters, to the nature of fictional language and the shape of a poet’s career. How does quantity affect our understanding of these categories? What happens when we look at 3,388,230 punctuation marks, 1.4 billion words, or 650,000 fictional characters? Does this change how we think about poetry, the novel, fictionality, character, the commonplace, or the writer’s career? In the course of answering such questions, Piper introduces readers to the analytical building blocks of computational text analysis and brings them to bear on fundamental concerns of literary scholarship. This book will be essential reading for anyone interested in Digital Humanities and the future of literary study.  

For well over a century, academic disciplines have studied human behavior using quantitative information. Until recently, however, the humanities have remained largely immune to the use of data—or vigorously resisted it. Thanks to new developments in computer science and natural language processing, literary scholars have embraced the quantitative study of literary works and have helped make Digital Humanities a rapidly growing field. But these developments raise a fundamental, and as yet unanswered question: what is the meaning of literary quantity?           In Enumerations, Andrew Piper answers that question across a variety of domains fundamental to the study of literature. He focuses on the elementary particles of literature, from the role of punctuation in poetry, the matter of plot in novels, the study of topoi, and the behavior of characters, to the nature of fictional language and the shape of a poet’s career. How does quantity affect our understanding of these categories? What happens when we look at 3,388,230 punctuation marks, 1.4 billion words, or 650,000 fictional characters? Does this change how we think about poetry, the novel, fictionality, character, the commonplace, or the writer’s career? In the course of answering such questions, Piper introduces readers to the analytical building blocks of computational text analysis and brings them to bear on fundamental concerns of literary scholarship. This book will be essential reading for anyone interested in Digital Humanities and the future of literary study.  

Contents: Matika: 1. Tika Matika. 2. Duka Matika. 3. Suttantika Duka Matika. I. Division on mind and mental concomitants: i. Categories of meritorious thoughts. ii. Twelve categories of demeritorious thoughts. iii. Categories of thought not classified as meritorious or demeritorious. II. Division concerning : corporeality: i. Matika. ii. Rupa Vibhatti. III. Division of summarized : analytical statements. IV. Division of additional elucidation. Index. "The Dhammasangani is the title given to the first book out of the seven book of the Abhidhamma Pitaka. A study of Abhidhamma properly begins with a study of Dhammasangani the Pali word dhamma varies in meaning according to context; here as part of the term dhammasangani, dhamma means ultimate realities. Sangani means collecting together or complete enumeration. The Dhammasangani deals with collecting and enumerating the ultimate realities by the method of triad (tikas) and dyads (dukas) as set out in its Matika. The present book is complete English translation of Dhammasangani from the Pali." (jacket)

Combinatorial enumeration is a readily accessible subject full of easily stated, but sometimes tantalizingly difficult problems. This book leads the reader in a leisurely way from basic notions of combinatorial enumeration to a variety of topics, ranging from algebra to statistical physics. The book is organized in three parts: Basics, Methods, and Topics. The aim is to introduce readers to a fascinating field, and to offer a sophisticated source of information for professional mathematicians desiring to learn more. There are 666 exercises, and every chapter ends with a highlight section, discussing in detail a particularly beautiful or famous result.

Combinatorial enumeration is a readily accessible subject full of easily stated, but sometimes tantalizingly difficult problems. This book leads the reader in a leisurely way from basic notions of combinatorial enumeration to a variety of topics, ranging from algebra to statistical physics. The book is organized in three parts: Basics, Methods, and Topics. The aim is to introduce readers to a fascinating field, and to offer a sophisticated source of information for professional mathematicians desiring to learn more. There are 666 exercises, and every chapter ends with a highlight section, discussing in detail a particularly beautiful or famous result.

This graduate-level text presents an encyclopedic account of the mathematical theory and problem-solving techniques associated with enumeration problems. Its approach blends combinatorial and algebraic ideas to offer insights into a wide variety of problems, and each section of the book focuses on a specific discrete structure, advancing from elementary (often classical) results to those at research level. Subjects include the combinatorics of the ordinary generating function and the exponential generating function, the combinatorics of sequences, and the combinatorics of paths. The text is complemented by approximately 350 exercises with full solutions. 1983 edition. Foreword by Gian-Carlo Rota. References. Index.

The book is a definitive treatise on the enumeration of graphs and related structural configurations, providing historical results as well as recent developments having potential application in the fields of physics, chemistry, computer science, and electrical engineering. Its ten chapters cover the subjects of labeled enumeration, Polya's Theorem, trees, graphs, diagraphs, power group enumeration, superposition, blocks, asymptotics, and as a special feature, a new comprehensive list of unsolved graphical enumeration problems. It includes an extensive bibliography and numerous exercises ranging in difficulty from routine to intractable.

The book is a definitive treatise on the enumeration of graphs and related structural configurations, providing historical results as well as recent developments having potential application in the fields of physics, chemistry, computer science, and electrical engineering. Its ten chapters cover the subjects of labeled enumeration, Polya's Theorem, trees, graphs, diagraphs, power group enumeration, superposition, blocks, asymptotics, and as a special feature, a new comprehensive list of unsolved graphical enumeration problems. It includes an extensive bibliography and numerous exercises ranging in difficulty from routine to intractable.

Welcome to your book of lists. Enumeration, volume three in the Personal Illuminations series by James C. Christensen, is the perfect place to keep track of everything from the mundane to the sacred--from home repairs and favorite foods to travel plans and goals for the year. This book of lists is filled with playful illustrations and contains dozens of ideas from "to do" lists, to lists of favorites, to checklists of new things to try. Some of the pages you will find include: * Favorite quotations; favorite restaurants; favorite pets. * Places I would like to see before I die. * Five things to accomplish this year. * Bravest things I've done. * Things I'm afraid to try. * People I admire. * Bridges to mend. * Daydreams I've had. Whether you love to create lists or jot and doodle, or you just want a fun and simple way to create a personal journal, Enumeration is the book for you. Major works of James C. Christensen are available as limited edition fine art prints and three-dimensional collectibles published by The Greenwich Workshop, Inc. www.greenwichworkshop.com

This graduate-level text presents an encyclopedic account of the mathematical theory and problem-solving techniques associated with enumeration problems. Its approach blends combinatorial and algebraic ideas to offer insights into a wide variety of problems, and each section of the book focuses on a specific discrete structure, advancing from elementary (often classical) results to those at research level. Subjects include the combinatorics of the ordinary generating function and the exponential generating function, the combinatorics of sequences, and the combinatorics of paths. The text is complemented by approximately 350 exercises with full solutions. 1983 edition. Foreword by Gian-Carlo Rota. References. Index.

This graduate-level text presents an encyclopedic account of the mathematical theory and problem-solving techniques associated with enumeration problems. Its approach blends combinatorial and algebraic ideas to offer insights into a wide variety of problems, and each section of the book focuses on a specific discrete structure, advancing from elementary (often classical) results to those at research level. Subjects include the combinatorics of the ordinary generating function and the exponential generating function, the combinatorics of sequences, and the combinatorics of paths. The text is complemented by approximately 350 exercises with full solutions. 1983 edition. Foreword by Gian-Carlo Rota. References. Index.

This is a textbook for an introductory combinatorics course lasting one or two semesters. An extensive list of problems, ranging from routine exercises to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra choices if they want to shift the emphasis of their course.Just as with the first three editions, the new edition walks the reader through the classic parts of combinatorial enumeration and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques, and on the other hand, showing that some questions at the forefront of research are comprehensible and accessible to the talented and hardworking undergraduate. The basic topics discussed are: the twelvefold way, cycles in permutations, the formula of inclusion and exclusion, the notion of graphs and trees, matchings, Eulerian and Hamiltonian cycles, and planar graphs.New to this edition are the Quick Check exercises at the end of each section. In all, the new edition contains about 240 new exercises. Extra examples were added to some sections where readers asked for them.The selected advanced topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, the theory of designs, enumeration under group action, generating functions of labeled and unlabeled structures and algorithms and complexity.The book encourages students to learn more combinatorics, provides them with a not only useful but also enjoyable and engaging reading.The Solution Manual is available upon request for all instructors who adopt this book as a course text. Please send your request to sales@wspc.com.The previous edition of this textbook has been adopted at various schools including UCLA, MIT, University of Michigan, and Swarthmore College. It was also translated into Korean.

This is the second edition of Freshwater Algae; the popular guide to temperate freshwater algae. This book uniquely combines practical information on sampling and experimental techniques with an explanation of basic algal taxonomy plus a key to identify the more frequently-occurring organisms.  Fully revised,  it describes major bioindicator species in relation to key environmental parameters and their implications for aquatic management. This second edition includes: the same clear writing style as the first edition to provide an easily accessible source of information on algae within standing and flowing waters, and the problems they may cause the identification of 250 algae using a key based on readily observable morphological features that can be readily observed under a conventional light microscope up-to-date information on the molecular determination of taxonomic status, analytical microtechniques and the potential role of computer analysis in algal biology upgrades to numerous line drawings to include more detail and extra species information, full colour photographs of live algae – including many new images from the USA and China Bridging the gap between simple identification texts and highly specialised research volumes, this book is used both as a comprehensive introduction to the subject and as a laboratory manual. The new edition will be invaluable to aquatic biologists for algal identification, and for all practitioners and researchers working within aquatic microbiology in industry and academia.

This is a textbook for an introductory combinatorics course lasting one or two semesters. An extensive list of problems, ranging from routine exercises to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra choices if they want to shift the emphasis of their course.Just as with the first two editions, the new edition walks the reader through the classic parts of combinatorial enumeration and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques, and on the other hand, showing that some questions at the forefront of research are comprehensible and accessible to the talented and hardworking undergraduate. The basic topics discussed are: the twelvefold way, cycles in permutations, the formula of inclusion and exclusion, the notion of graphs and trees, matchings, Eulerian and Hamiltonian cycles, and planar graphs.The selected advanced topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, the theory of designs (new to this edition), enumeration under group action (new to this edition), generating functions of labeled and unlabeled structures and algorithms and complexity.As the goal of the book is to encourage students to learn more combinatorics, every effort has been made to provide them with a not only useful, but also enjoyable and engaging reading.The Solution Manual is available upon request for all instructors who adopt this book as a course text. Please send your request to sales@wspc.com.

This is a textbook for an introductory combinatorics course that can take up one or two semesters. An extensive list of problems, ranging from routine exercises to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra choices if they want to shift the emphasis of their course. Just as with the first edition, the new edition walks the reader through the classic parts of combinatorial enumeration and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques, and on the other hand, showing that some questions at the forefront of research are comprehensible and accessible for the talented and hard-working undergraduate. The basic topics discussed are: the twelvefold way, cycles in permutations, the formula of inclusion and exclusion, the notion of graphs and trees, matchings and Eulerian and Hamiltonian cycles. The selected advanced topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, and algorithms and complexity.As the goal of the book is to encourage students to learn more combinatorics, every effort has been made to provide them with a not only useful, but also enjoyable and engaging reading.

This is the second edition of Freshwater Algae; the popular guide to temperate freshwater algae. This book uniquely combines practical information on sampling and experimental techniques with an explanation of basic algal taxonomy plus a key to identify the more frequently-occurring organisms.  Fully revised,  it describes major bioindicator species in relation to key environmental parameters and their implications for aquatic management. This second edition includes: the same clear writing style as the first edition to provide an easily accessible source of information on algae within standing and flowing waters, and the problems they may cause the identification of 250 algae using a key based on readily observable morphological features that can be readily observed under a conventional light microscope up-to-date information on the molecular determination of taxonomic status, analytical microtechniques and the potential role of computer analysis in algal biology upgrades to numerous line drawings to include more detail and extra species information, full colour photographs of live algae – including many new images from the USA and China Bridging the gap between simple identification texts and highly specialised research volumes, this book is used both as a comprehensive introduction to the subject and as a laboratory manual. The new edition will be invaluable to aquatic biologists for algal identification, and for all practitioners and researchers working within aquatic microbiology in industry and academia.

This is a textbook for an introductory combinatorics course lasting one or two semesters. An extensive list of problems, ranging from routine exercises to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra choices if they want to shift the emphasis of their course. Just as with the first two editions, the new edition walks the reader through the classic parts of combinatorial enumeration and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques, and on the other hand, showing that some questions at the forefront of research are comprehensible and accessible to the talented and hardworking undergraduate. The basic topics discussed are: the twelvefold way, cycles in permutations, the formula of inclusion and exclusion, the notion of graphs and trees, matchings, Eulerian and Hamiltonian cycles, and planar graphs. The selected advanced topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, the theory of designs (new to this edition), enumeration under group action (new to this edition), generating functions of labeled and unlabeled structures and algorithms and complexity. As the goal of the book is to encourage students to learn more combinatorics, every effort has been made to provide them with a not only useful, but also enjoyable and engaging reading.

This is a textbook for an introductory combinatorics course lasting one or two semesters. An extensive list of problems, ranging from routine exercises to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra choices if they want to shift the emphasis of their course.Just as with the first two editions, the new edition walks the reader through the classic parts of combinatorial enumeration and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques, and on the other hand, showing that some questions at the forefront of research are comprehensible and accessible to the talented and hardworking undergraduate. The basic topics discussed are: the twelvefold way, cycles in permutations, the formula of inclusion and exclusion, the notion of graphs and trees, matchings, Eulerian and Hamiltonian cycles, and planar graphs.The selected advanced topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, the theory of designs (new to this edition), enumeration under group action (new to this edition), generating functions of labeled and unlabeled structures and algorithms and complexity.As the goal of the book is to encourage students to learn more combinatorics, every effort has been made to provide them with a not only useful, but also enjoyable and engaging reading.The Solution Manual is available upon request for all instructors who adopt this book as a course text. Please send your request to sales@wspc.com.

This is a textbook for an introductory combinatorics course lasting one or two semesters. An extensive list of problems, ranging from routine exercises to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra choices if they want to shift the emphasis of their course.Just as with the first three editions, the new edition walks the reader through the classic parts of combinatorial enumeration and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques, and on the other hand, showing that some questions at the forefront of research are comprehensible and accessible to the talented and hardworking undergraduate. The basic topics discussed are: the twelvefold way, cycles in permutations, the formula of inclusion and exclusion, the notion of graphs and trees, matchings, Eulerian and Hamiltonian cycles, and planar graphs.New to this edition are the Quick Check exercises at the end of each section. In all, the new edition contains about 240 new exercises. Extra examples were added to some sections where readers asked for them.The selected advanced topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, the theory of designs, enumeration under group action, generating functions of labeled and unlabeled structures and algorithms and complexity.The book encourages students to learn more combinatorics, provides them with a not only useful but also enjoyable and engaging reading.The Solution Manual is available upon request for all instructors who adopt this book as a course text. Please send your request to sales@wspc.com.The previous edition of this textbook has been adopted at various schools including UCLA, MIT, University of Michigan, and Swarthmore College. It was also translated into Korean.

This is a textbook for an introductory combinatorics course lasting one or two semesters. An extensive list of problems, ranging from routine exercises to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra choices if they want to shift the emphasis of their course. Just as with the first two editions, the new edition walks the reader through the classic parts of combinatorial enumeration and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques, and on the other hand, showing that some questions at the forefront of research are comprehensible and accessible to the talented and hardworking undergraduate. The basic topics discussed are: the twelvefold way, cycles in permutations, the formula of inclusion and exclusion, the notion of graphs and trees, matchings, Eulerian and Hamiltonian cycles, and planar graphs. The selected advanced topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, the theory of designs (new to this edition), enumeration under group action (new to this edition), generating functions of labeled and unlabeled structures and algorithms and complexity. As the goal of the book is to encourage students to learn more combinatorics, every effort has been made to provide them with a not only useful, but also enjoyable and engaging reading.