W.D. Wallis – författare

This textbook focuses on graph factorizations, an area which lies partly in graph theory and partly in the theory of combinational designs. It is intended for beginning graduate students in combinatorial mathematics, but also covers current research and should prove useful as a reference source for professionals in the field.

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.

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 .

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.

Magic squares are among the more popular mathematical recreations. Over the last 50 years, many generalizations of “magic” ideas have been applied to graphs. Recently there has been a resurgence of interest in “magic labelings” due to a number of results that have applications to the problem of decomposing graphs into trees. Key features of this second edition include:·         a new chapter on magic labeling of directed graphs·         applications of theorems from graph theory and interesting counting arguments·         new research problems and exercises covering a range of difficulties·         a fully updated bibliography and indexThis concise, self-contained exposition is unique in its focus on the theory of magic graphs/labelings. It may serve as a graduate or advanced undergraduate text for courses in mathematics or computer science, and as reference for the researcher.

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 volume is a sequel to our 1996 compilation, Computational and Constructive Design Theory. Again we concentrate on two closely re­ lated aspects of the study of combinatorial designs: design construction and computer-aided study of designs. There are at least three classes of constructive problems in design theory. The first type of problem is the construction of a specific design. This might arise because that one particular case is an exception to a general rule, the last remaining case of a problem, or the smallest unknown case. A good example is the proof that there is no projective plane of parameter 10. In that case the computations involved were not different in kind from those which have been done by human brains without electronic assistance; they were merely longer. Computers have also been useful in the study of combinatorial spec­ trum problems: if a class of design has certain parameters, what is the set of values that the parameters can realize? In many cases, there is a recursive construction, so that the existence of a small number of "starter" designs leads to the construction of infinite classes of designs, and computers have proven very useful in finding "starter" designs.

This is a specialized textbook on graph factorizations, an area which lies partly in graph theory and partly in the theory of combinational designs. It is the first full-size book on its particular subject, which has previously been treated only in survey papers and in chapters in books on design theory and on graph decompositions and matching theory. The book is intended for beginning graduate students in Combinatorial Mathematics, and may be used as a text for a special topics course; but it reaches to the boundaries of current research and will also prove useful as a reference source for professionals in the field. It contains a number of easy exercises, together with some which are challenging, and a few unsolved problems. There is an extensive bibliography.

This volume is a sequel to our 1996 compilation, Computational and Constructive Design Theory. Again we concentrate on two closely re­ lated aspects of the study of combinatorial designs: design construction and computer-aided study of designs. There are at least three classes of constructive problems in design theory. The first type of problem is the construction of a specific design. This might arise because that one particular case is an exception to a general rule, the last remaining case of a problem, or the smallest unknown case. A good example is the proof that there is no projective plane of parameter 10. In that case the computations involved were not different in kind from those which have been done by human brains without electronic assistance; they were merely longer. Computers have also been useful in the study of combinatorial spec­ trum problems: if a class of design has certain parameters, what is the set of values that the parameters can realize? In many cases, there is a recursive construction, so that the existence of a small number of "starter" designs leads to the construction of infinite classes of designs, and computers have proven very useful in finding "starter" designs.

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.

Magic squares are among the more popular mathematical recreations. Over the last 50 years, many generalizations of “magic” ideas have been applied to graphs. Recently there has been a resurgence of interest in “magic labelings” due to a number of results that have applications to the problem of decomposing graphs into trees. Key features of this second edition include:·         a new chapter on magic labeling of directed graphs·         applications of theorems from graph theory and interesting counting arguments·         new research problems and exercises covering a range of difficulties·         a fully updated bibliography and indexThis concise, self-contained exposition is unique in its focus on the theory of magic graphs/labelings. It may serve as a graduate or advanced undergraduate text for courses in mathematics or computer science, and as reference for the researcher.

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.

This book is focused on pancyclic and bipancyclic graphs and is geared toward researchers and graduate students in graph theory. Readers should be familiar with the basic concepts of graph theory, the definitions of a graph and of a cycle. Pancyclic graphs contain cycles of all possible lengths from three up to the number of vertices in the graph. Bipartite graphs contain only cycles of even lengths, a bipancyclic graph is defined to be a bipartite graph with cycles of every even size from 4 vertices up to the number of vertices in the graph. Cutting edge research and fundamental results on pancyclic and bipartite graphs from a wide range of journal articles and conference proceedings are composed in this book to create a standalone presentation.The following questions are highlighted through the book:- What is the smallest possible number of edges in a pancyclic graph with v vertices? - When do pancyclic graphs exist with exactly one cycle of every possible length?- What is the smallest possible number of edges in a bipartite graph with v vertices?- When do bipartite graphs exist with exactly one cycle of every possible length?