Kenyon College Course Catalog 2019-20
245
Combinatorics is, broadly speaking, the study of finite sets and finite mathematical structures. A
great many mathematical topics are included in this description, including graph theory,
combinatorial designs, partially ordered sets, networks, lattices and Boolean algebras and
combinatorial methods of counting, including combinations and permutations, partitions,
generating functions, recurring relations, the principle of inclusion and exclusion, and the Stirling
and Catalan numbers. This course will cover a selection of these topics. Combinatorial mathematics
has applications in a wide variety of nonmathematical areas, including computer science (both in
algorithms and in hardware design), chemistry, sociology, government and urban planning; this
course may be especially appropriate for students interested in the mathematics related to one of
these fields. Prerequisite: MATH 112 or a score or 4 or 5 on the BC Calculus AP exam or permission
of instructor. Offered every other year.
MATH 230 EUCLIDEAN AND NON-EUCLIDEAN GEOMETRY
Credit: 0.5 QR
The "Elements" of Euclid, written over 2,000 ago, is a stunning achievement. The "Elements" and
the non-Euclidean geometries discovered by Bolyai and Lobachevsky in the 19th century form the
basis of modern geometry. From this start, our view of what constitutes geometry has grown
considerably. This is due in part to many new theorems that have been proved in Euclidean and
non-Euclidean geometry but also to the many ways in which geometry and other branches of
mathematics have come to influence one another over time. Geometric ideas have widespread use
in analysis, linear algebra, differential equations, topology, graph theory and computer science, to
name just a few areas. These fields, in turn, affect the way that geometers think about their subject.
Students in MATH 230 will consider Euclidean geometry from an advanced standpoint, but also will
have the opportunity to learn about non-Euclidean geometries. Prerequisite: MATH 222 or
permission of instructor. Offered occasionally.
MATH 231 MATHEMATICAL PROBLEM SOLVING
Credit: 0.25
Looking at a problem in a creative way and seeking out different methods toward solving it are
essential skills in mathematics and elsewhere. In this course, students will build their problem-
solving intuition and skills by working on challenging and fun mathematical problems. Common
problem-solving techniques in mathematics will be covered in each class meeting, followed by
collaboration and group discussions, which will be the central part of the course. The course will
culminate with the Putnam exam on the first Saturday in December. Interested students who have a
conflict with that date should contact the instructor. Prerequisite: MATH 112 or a score of 4 or 5 on
the BC Calculus exam or permission of instructor.
MATH 236 RANDOM STRUCTURES
Credit: 0.5 QR
This course will explore the theory, structure, applications and interesting consequences when
probability is introduced to mathematical objects. Some of the core topics will be random graphs,
random walks and Markov processes, as well as randomness applied to sets, permutations,
polynomials, functions, integer partitions and codes. Previous study of all of these mathematical
objects is not a prerequisite, as essential background will be covered during the course. In addition
to studying the random structures themselves, a concurrent focus of the course will be the
development of mathematical tools to analyze them, such as combinatorial concepts, indicator
variables, generating functions, discrete distributions, laws of large numbers, asymptotic theory