**Combinatory Analysis**

by Percy A. MacMahon

**Publisher**: Cambridge University Press 1915**ISBN/ASIN**: 0821828320**Number of pages**: 612

**Description**:

The object of this work is, in the main, to present to mathematicians an account of theorems in combinatory analysis which are of a perfectly general character, and to shew the connexion between them by as far as possible bringing them together as parts of a general doctrine. It may appeal also to others whose reading has not been very extensive.

Download or read it online for free here:

**Download link 1**

**Download link 2**

(multiple formats)

## Similar books

**Combinatorics Through Guided Discovery**

by

**Kenneth P. Bogart**-

**Dartmouth College**

This is an introduction to combinatorial mathematics, also known as combinatorics. The book focuses especially but not exclusively on the part of combinatorics that mathematicians refer to as 'counting'. The book consists almost entirely of problems.

(

**6152**views)

**Enumerative Combinatorics: Volume 1**

by

**Richard P. Stanley**-

**MIT**

The standard guide to the topic for students and experts alike. The material in Volume 1 was chosen to cover those parts of enumerative combinatorics of greatest applicability and with the most important connections with other areas of mathematics.

(

**3390**views)

**Algebraic and Geometric Methods in Enumerative Combinatorics**

by

**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.

(

**4261**views)

**Matroid Decomposition**

by

**Klaus Truemper**-

**Leibniz**

Matroids were introduced in 1935 as an abstract generalization of graphs and matrices. Matroid decomposition covers the area of the theory dealing with decomposition and composition of matroids. The exposition is clear and simple.

(

**6322**views)