3

I couldn't read most of the textbooks on combinatorics I've encountered. The problem is that authors usually do not explain a lot of things. For instance, they don't mention that generating function is an element of $\mathbb{C}[x]$. They never explain why identities like $\sin^2s + \cos^2 s = 1$ hold in this ring and so on. So I am looking for a book for self-study which treats this stuff rigorously and which strongly relies on abstract algebra.

Topics I want to study include generating functions and stuff one can do with them (like deriving Fibonacci sequence formula and so on), Catalan numbers and why are they interesting, $q$-binomial coefficients and a little bit about graph theory. And, of course, problems. I should also mention that I am not that interested in the subject itself but rather I often need it to deal with algebras generating by relations and that kind of stuff. And sometimes to teach contest math, too.

The main problem is that I don't know it is author not being clear enough or I am not able to understand something that simple. If author claims something which he doesn't want to prove he must explicitly say so.

My idea of good book is abstract algebra by Dummit & Foot. It explains every step or says that there is a step which we do not want to explain and it contains in the exercises with good hints provided.

Sebastiano
  • 7,649
Invincible
  • 2,572
  • 10
  • 26

2 Answers2

3

Considering the abstract algebra perspective, I recommend Aigner's "Combinatorial Theory" and Stanley's "Enumerative Combinatorics". Aigner's book Chapter V on generating functions is probably what you look for, since it develops from the standard algebra $\mathbb{S}(P)$ of a locally finite poset $P$ and examples of reduced algebras. Also, Stanley's "Enumerative Combinatorics" gives the definitions (including generating functions) in a precise, rigorous way.

Now, if you like more crazy stuff, I can also recommend Comtet's "Advanced Combinatorics". It's full of definitions, techniques and exercises. And of course, the classic "generationfunctionology" of Wilf can be used as a supplement for the exercise part.

I think you would be pleased with Aigner's and Stanley's books

1

Perhaps the book "The Concrete Tetrahedron: Symbolic sums, Recurrence equations, Generating Functions, Asymptotic Estimates" by Manuel Kauers and Peter Paule, Springer 2011, is suitable.

Johann Cigler
  • 1,299
  • 7
  • 12