Kirjahaku

This book has grown out of graduate courses given by the author at Southern Illinois University, Carbondale, as well as a series of seminars delivered at Curtin University of Technology, Western Australia. The book is intended to be used both as a textbook at the graduate level and also as a professional reference. The topic of one-factorizations fits into the theory of combinatorial designs just as much as it does into graph theory. Factors and factorizations occur as building blocks in the theory of designs in a number of places. Our approach owes as much to design theory as it does to graph theory. It is expected that nearly all readers will have some background in the theory of graphs, such as an advanced undergraduate course in Graph Theory or Applied Graph Theory. However, the book is self-contained, and the first two chapters are a thumbnail sketch of basic graph theory. Many readers will merely skim these chapters, observing our notational conventions along the way. (These introductory chapters could, in fact, enable some instructors to Ilse the book for a somewhat eccentric introduction to graph theory.) Chapter 3 introduces one-factors and one-factorizations. The next two chapters outline two major application areas: combinatorial arrays and tournaments. These two related areas have provided the impetus for a good deal of study of one-factorizations.

Graph theory continues to be one of the fastest growing areas of modern mathematics because of its wide applicability in such diverse disciplines as computer science, engineering, chemistry, management science, social science, and resource planning. Graphs arise as mathematical models in these fields, and the theory of graphs provides a spectrum of methods of proof. This concisely written textbook is intended for an introductory course in graph theory for undergraduate mathematics majors or advanced undergraduate and graduate students from the many fields that benefit from graph-theoretic applications.This second edition includes new chapters on labeling and communications networks and small-worlds, as well as expanded beginner's material in the early chapters, including more examples, exercises, hints and solutions to key problems. Many additional changes, improvements, and corrections resulting from classroom use and feedback have been added throughout. With a distinctly applied flavor, this gentle introduction to graph theory consists of carefully chosen topics to develop graph-theoretic reasoning for a mixed audience. Familiarity with the basic concepts of set theory, along with some background in matrices and algebra, and a little mathematical maturity are the only prerequisites.

Wallis's book on discrete mathematics is a resource for an introductory course in a subject fundamental to both mathematics and computer science, a course that is expected not only to cover certain specific topics but also to introduce students to important modes of thought specific to each discipline . . . Lower-division undergraduates through graduate students. —Choice reviews (Review of the First Edition)Very appropriately entitled as a 'beginner's guide', this textbook presents itself as the first exposure to discrete mathematics and rigorous proof for the mathematics or computer science student. —Zentralblatt Math (Review of the First Edition)This second edition of A Beginner’s Guide to Discrete Mathematics presents a detailed guide to discrete mathematics and its relationship to other mathematical subjects including set theory, probability, cryptography, graph theory, and number theory. This textbook has a distinctly applied orientation and explores a variety of applications. Key Features of the second edition: * Includes a new chapter on the theory of voting as well as numerous new examples and exercises throughout the book * Introduces functions, vectors, matrices, number systems, scientific notations, and the representation of numbers in computers * Provides examples which then lead into easy practice problems throughout the text and full exercise at the end of each chapter * Full solutions for practice problems are provided at the end of the bookThis text is intended for undergraduates in mathematics and computer science, however, featured special topics and applications may also interest graduate students.

This second edition of A Beginner’s Guide to Finite Mathematics: For Business, Management, and the Social Sciences takes a distinctly applied approach to finite mathematics at the freshman and sophomore level. Topics are presented sequentially: the book opens with a brief review of sets and numbers, followed by an introduction to data sets, histograms, means and medians. Counting techniques and the Binomial Theorem are covered, which provide the foundation for elementary probability theory; this, in turn, leads to basic statistics. This new edition includes chapters on game theory and financial mathematics.Requiring little mathematical background beyond high school algebra, the text will be especially useful for business and liberal arts majors for study in the classroom or for self-study. Its straightforward treatment of the essential concepts in finite mathematics will appeal to a wide audience of students and teachers.

An advanced reference containing 21 selected or consolidated papers presented at an international conference in April 1988 at Tunxi (now Hunangshan), China. Contains recent, previously unavailable findings of Chinese mathematicians; discusses problems, results, and proving methods of combinatorial d

An advanced reference containing 21 selected or consolidated papers presented at an international conference in April 1988 at Tunxi (now Hunangshan), China. Contains recent, previously unavailable findings of Chinese mathematicians; discusses problems, results, and proving methods of combinatorial d

This book has grown out of graduate courses given by the author at Southern Illinois University, Carbondale, as well as a series of seminars delivered at Curtin University of Technology, Western Australia. The book is intended to be used both as a textbook at the graduate level and also as a professional reference. The topic of one-factorizations fits into the theory of combinatorial designs just as much as it does into graph theory. Factors and factorizations occur as building blocks in the theory of designs in a number of places. Our approach owes as much to design theory as it does to graph theory. It is expected that nearly all readers will have some background in the theory of graphs, such as an advanced undergraduate course in Graph Theory or Applied Graph Theory. However, the book is self-contained, and the first two chapters are a thumbnail sketch of basic graph theory. Many readers will merely skim these chapters, observing our notational conventions along the way. (These introductory chapters could, in fact, enable some instructors to Ilse the book for a somewhat eccentric introduction to graph theory.) Chapter 3 introduces one-factors and one-factorizations. The next two chapters outline two major application areas: combinatorial arrays and tournaments. These two related areas have provided the impetus for a good deal of study of one-factorizations.

Mathematics in the Real World is a self-contained, accessible introduction to the world of mathematics for non-technical majors. With a focus on everyday applications and context, the topics in this textbook build in difficulty and are presented sequentially, starting with a brief review of sets and numbers followed by an introduction to elementary statistics, models, and graph theory. Data and identification numbers are then covered, providing the pathway to voting and finance. Each subject is covered in a concise and clear fashion through the use of real-world applications and the introduction of relevant terminology. Many sample problems – both writing exercises and multiple-choice questions – are included to help develop students’ level of understanding and to offer a variety of options to instructors.Covering six major units and outlining a one-semester course, Mathematics in the Real World is aimed at undergraduate liberal art students fulfilling the mathematics requirement in their degree program. This introductory text will be an excellent resource for such courses, and will show students where mathematics arises in their everyday lives.

Mathematics in the Real World is a self-contained, accessible introduction to the world of mathematics for non-technical majors. With a focus on everyday applications and context, the topics in this textbook build in difficulty and are presented sequentially, starting with a brief review of sets and numbers followed by an introduction to elementary statistics, models, and graph theory. Data and identification numbers are then covered, providing the pathway to voting and finance. Each subject is covered in a concise and clear fashion through the use of real-world applications and the introduction of relevant terminology. Many sample problems – both writing exercises and multiple-choice questions – are included to help develop students’ level of understanding and to offer a variety of options to instructors.Covering six major units and outlining a one-semester course, Mathematics in the Real World is aimed at undergraduate liberal art students fulfilling the mathematics requirement in their degree program. This introductory text will be an excellent resource for such courses, and will show students where mathematics arises in their everyday lives.

Combinatorial theory is one of the fastest growing areas of modern mathematics. Focusing on a major part of this subject, Introduction to Combinatorial Designs, Second Edition provides a solid foundation in the classical areas of design theory as well as in more contemporary designs based on applications in a variety of fields.After an overview of basic concepts, the text introduces balanced designs and finite geometries. The author then delves into balanced incomplete block designs, covering difference methods, residual and derived designs, and resolvability. Following a chapter on the existence theorem of Bruck, Ryser, and Chowla, the book discusses Latin squares, one-factorizations, triple systems, Hadamard matrices, and Room squares. It concludes with a number of statistical applications of designs. Reflecting recent results in design theory and outlining several applications, this new edition of a standard text presents a comprehensive look at the combinatorial theory of experimental design. Suitable for a one-semester course or for self-study, it will prepare readers for further exploration in the field. To access supplemental materials for this volume, visit the author’s website at http://www.math.siu.edu/Wallis/designs

This title takes an in-depth look at the mathematics in the context of voting and electoral systems, with focus on simple ballots, complex elections, fairness, approval voting, ties, fair and unfair voting, and manipulation techniques. The exposition opens with a sketch of the mathematics behind the various methods used in conducting elections. The reader is lead to a comprehensive picture of the theoretical background of mathematics and elections through an analysis of Condorcet’s Principle and Arrow’s Theorem of conditions in electoral fairness. Further detailed discussion of various related topics include: methods of manipulating the outcome of an election, amendments, and voting on small committees.In recent years, electoral theory has been introduced into lower-level mathematics courses, as a way to illustrate the role of mathematics in our everyday life. Few books have studied voting and elections from amore formal mathematical viewpoint. This text will be useful to those who teach lower level courses or special topics courses and aims to inspire students to understand the more advanced mathematics of the topic. The exercises in this text are ideal for upper undergraduate and early graduate students, as well as those with a keen interest in the mathematics behind voting and elections.