
# PrefacePreface to PreTeXt edition

At the time of his death in 2005, Ken Bogart was working on this NSF-supported effort to create a combinatorics textbook that developed the key ideas of undergraduate combinatorics through “guided discovery”, or what many today typically call inquiry-based learning. The project was under contract with Springer-Verlag for a commercially-published print edition, but Ken's untimely passing left the project in an unfinished state. Bogart's family asked the Department of Mathematics at Dartmouth College, where he had spent his entire career after earning his Ph.D. from Caltech in 1968, to distribute the text freely under the GNU Free Documentation License. This open-source release came with some notes, however. Those notes, listed on the book's Dartmouth page, were:

1. The contents of the archive are released under the terms of the GNU Free Documentation License (FDL), a copy of which is contained in the archive.
2. The contents of the archive are released in “as is” condition, which in particular means that the state of the source files is not in agreement with the pdf versions of the text. A README offers some guidance.
3. Many people have already used the textbook in courses at various universities throughout the country. It is the hope of the Bogart family that this project continues to grow to completion with the efforts of those who download this archive.

The caveat in the second note seemed to be the largest toward fulfilling the goal of the third, as the “official” version of the PDF had a different chapter structure than the source files provided. This was mostly the result of splitting a chapter into two and rearranging a few topics, but there were also places where problems were split or merged between the source version and the PDF version. The PDF version also came with copious hints that readers could access online, but no source existed for these hints.

This PreTeXt edition of Combinatorics through Guided Discovery attempts to help fulfill the Bogart family's wish to see the project grow and reach a complete state. One of us (MTK) had used the official PDF to teach a combinatorics course in Winter 2015 and mentioned this fact at a workshop on open source textbooks and PreTeXt (then MathBook XML) organized by the American Institute of Mathematics in the spring of 2016. This caught the attention of KEM, since Combinatorics through Guided Discovery had been placed on the AIM list of approved open source textbooks, but there had been no success in finding someone to take on the task of updating the source to match the PDF. The three of us came together again in May 2017 at the University of Puget Sound for another workshop on open educational resources and agreed to cooperate to complete the conversion of this book to PreTeXt. The fact that OL wanted to use parts of the book for his Fall 2017 class gave us the motivation required to complete the project over the summer.

For this edition, our goal has been to reproduce the text of Bogart's final PDF as faithfullly as possible. Based on our own classroom uses, we have notes about problems that could use revising, but we agreed the right first step would be to have source files that matched what Bogart left. We have, however, corrected obvious errors along the way, which included moving the Supplementary Chapter Problems in Chapter 3 from the level of a subsection to the level of a section for consistency with the other chapters. Footnotes may be numbered differently, as in this edition, a footnote in the body of a problem is rendered with the problem and numbered in a different sequence. The hints that previously were accessed by links from the PDF to a Dartmouth webpage have also been included in the backmatter of the print edition as an appendix. Links to open hints in place are available in the HTML version, while in the print and PDF edition, the existence of a hint is indicated by “(h)” at the end of the problem (or part of a problem). David Farmer provided invaluable assistance by automating the initial conversion of files to PreTeXt and extracting the text of the hints from the PDF files. We then worked in parallel to compare the official PDF to what we were able to produce from the source until they matched. Since this process could not be truly automated, we suspect there will be some places where Bogart's PDF and this edition do not match. We welcome reports of these through issues and pull requests on the Github site for the book https://github.com/OpenDiscreteMath/ibl-combinatorics/. Going forward, we would like to see community-driven updates to further develop the text, either by improving existing problems, adding new problems on existing topics, or adding new topics suitable for a course based on this text. One area of development may be to include SageMath to the text, since PreTeXt includles a number of nice features for doing this and some of the material may benefit from the addition of a computer algebra system to allow more interesting calculations than would be feasible by hand.

An HTML version of this text is available at http://bogart.openmathbooks.org/. A low-cost print edition is available for purchase online. The cost of the print edition is kept as low as possible, and any royalties received support costs associated with hosting and distributing the text. A PDF copy of print edition is also posted on the book's site. The PDF may provide a better experience for searching than the HTML version.

Mitchel T. Keller, Oscar Levin, and Kent E. Morrison
Lexington, Virginia; Greeley, Colorado; and San Jose, California
December 2017