× Combinatorial Techniques Close
Combinatorial Techniques By Sharad S. Sane
English | PDF | 2013 | 477 Pages | ISBN : 9380250487 | 37.66 MB
The idea of writing a text book on combinatorics has been on my mind for a very long time. The question was that of judgment in deciding which topics are to be con- sidered basic and must be included as also the organization of the material. I hope that the reader will find both the content and the organization of material in this book sufficiently interesting and coherent.
Whether combinatorics consists of merely techniques (read, a slightly derogatory, tricks) or also encompasses a sequence of theorems that can properly be perceived to be purporting some deep theory is not clear. The truth lies somewhere in between. To a section of the mathematical ~ommunity, combinatorics is nothing more than a pastime of solving puzzles. Cleverness is an acknowledged essential ingredient of creating all mathematics. That appears to be more so in case of combinatorics where cleverness is seemingly the only tool required to achieve the goal. However, "Mathematics is not cleverness" declares the objecting section of the mathematical community. When a mathematician, working in some other area of mathematics uses the expression, "that is combinatorial", it sometimes means clever but at times also means that it amounts to messy computations devoid of any theory and an ennui inducing exercise. It is the au- thor's intention to show to the reader that combinatorial techniques can be well studied and that these techniques, are far more systematic and sophisticated than the puzzles and tricks that they engulf and encompass.
Download File Size:36.3 MB
|
