MHB Combinatorics book recommendation.

caffeinemachine
Gold Member
MHB
Messages
799
Reaction score
15
Hello MHB.
I want to read an advanced combinatorics book. I am well versed in combinatorial methods like counting proofs, Pigeon Hole Principle, criticality, induction, graphs etc. I have good knowledge of undergraduate algebra so I am fine if the book you recommend has some algebraic methods.. in fact I would prefer reading a book which discusses algebraic methods in combinatorics. I am comfortable with the following topics at present:

Linear Algebra
Abstract Algebra
Real Analysis
Elementary Number Theory
Graph Theory

Can someone recommend an appropriate book? Thank you in advance.
 
Physics news on Phys.org
caffeinemachine said:
Hello MHB.
I want to read an advanced combinatorics book. I am well versed in combinatorial methods like counting proofs, Pigeon Hole Principle, criticality, induction, graphs etc. I have good knowledge of undergraduate algebra so I am fine if the book you recommend has some algebraic methods.. in fact I would prefer reading a book which discusses algebraic methods in combinatorics. I am comfortable with the following topics at present:

Linear Algebra
Abstract Algebra
Real Analysis
Elementary Number Theory
Graph Theory

Can someone recommend an appropriate book? Thank you in advance.

Hi caffeinemachine, :)

These are the books that I have used. Not sure whether these will fit your particular needs though.

1) Combinatorics Topics, Techniques, Algorithms by P.J. Cameron

2) Hadamard Matrices and their Applications by K.J. Horadam

You might be interested in reading >>this<<.

Kind Regards,
Sudharaka.
 
Sudharaka said:
Hi caffeinemachine, :)

These are the books that I have used. Not sure whether these will fit your particular needs though.

1) Combinatorics Topics, Techniques, Algorithms by P.J. Cameron

2) Hadamard Matrices and their Applications by K.J. Horadam

You might be interested in reading >>this<<.

Kind Regards,
Sudharaka.
Thank you Sudharaka. Peter Cameron's book seems promising. I also came to know about lint and wilson's book because of the link you gave.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Back
Top