Notes on the Combinatorial Fundamentals of Algebra
by Darij Grinberg
Publisher: arXiv.org 2021
Number of pages: 1359
Description:
This is a detailed survey, with rigorous and self-contained proofs, of some of the basics of elementary combinatorics and algebra, including the properties of finite sums, binomial coefficients, permutations and determinants. It is entirely expository and written to a large extent as a repository for folklore proofs; no new results appear.
Download or read it online for free here:
Download link
(10MB, PDF)
Similar books
Analytic Combinatoricsby Philippe Flajolet, Robert Sedgewick - Cambridge University Press
Deals with the the analysis of discrete structures, that emerged over the past years as an essential tool in the understanding of computer programs and models with applications in science. The text contains examples and exercises.
(20180 views)
Algebraic and Geometric Methods in Enumerative Combinatoricsby Federico Ardila - arXiv
The main goal of this survey is to state clearly and concisely some of the most useful tools in algebraic and geometric enumeration, and to give many examples that quickly and concretely illustrate how to put these tools to use.
(9412 views)
Notes on Combinatoricsby Peter J. Cameron - Queen Mary, University of London
Contents: Subsets and binomial coefficients; Selections and arrangements; Power series; Recurrence relations; Partitions and permutations; The Principle of Inclusion and Exclusion; Families of sets; Systems of distinct representatives; etc.
(11412 views)
Combinatorial Algorithmsby Albert Nijenhuis, Herbert S. Wilf - Academic Press Inc
This is a collection of mathematical algorithms with many new and interesting examples in this second edition. The authors tried to place in the reader's hands a kit of building blocks with which the reader can construct more elaborate structures.
(21881 views)