Combinatorics

This book uses new mathematical tools to examine broad computability and complexity questions in enumerative combinatorics, with applications to other areas of mathematics, theoretical computer science, and physics. A focus on effective algorithms leads to the development of computer algebra software of use to researchers in these domains.

This textbook offers an accessible introduction to combinatorics, infused with Solomon Golomb’s insights and illustrative examples. Core concepts in combinatorics are presented with an engaging narrative that suits undergraduate study at any level. Featuring early coverage of the Principle of Inclusion-Exclusion and a unified treatment of permutations later on, the structure emphasizes the cohesive development of ideas. Combined with the conversational style, this approach is especially well suited to independent study.

This text provides a theoretical background for several topics in combinatorial mathematics, such as enumerative combinatorics (including partitions and Burnside's lemma), magic and Latin squares, graph theory, extremal combinatorics, mathematical games and elementary probability.

This undergraduate textbook is suitable for introductory classes in combinatorics and related topics.

This is the first of two volumes of a state-of-the-art survey article collection which originates from three commutative algebra sessions at the 2009 Fall Southeastern American Mathematical Society Meeting at Florida Atlantic University. The articles reach into diverse areas of commutative algebra and build a bridge between Noetherian and non-Noetherian commutative algebra.