How to count : (Record no. 155502)

MARC details
000 -LEADER
fixed length control field 02346cam a2200265 a 4500
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20160322165154.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 100617s2011 flua b 001 0 eng
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781420082609 (hardcover : alk. paper)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 1420082604 (hardcover : alk. paper)
041 ## - LANGUAGE CODE
Language code of text/sound track or separate title eng
082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 519.11
Item number ALL
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Allenby, R. B. J. T.
9 (RLIN) 434
245 10 - TITLE STATEMENT
Title How to count :
Remainder of title an introduction to combinatorics /
Statement of responsibility, etc. R.B.J.T. Allenby, Alan Slomson.
250 ## - EDITION STATEMENT
Edition statement 2nd ed.
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc. Boca Raton, FL :
Name of publisher, distributor, etc. CRC Press,
Date of publication, distribution, etc. c2011.
300 ## - PHYSICAL DESCRIPTION
Extent xv, 430 p. :
490 1# - SERIES STATEMENT
Series statement Discrete mathematics and its applications
500 ## - GENERAL NOTE
General note First published as: an introduction to combinatorics, 1991.
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note What's it all about? -- Permutations and combinations -- Occupancy problems -- The inclusion-exclusion principle -- Stirling and Catalan numbers -- Partitions and dot diagrams -- Generating functions and recurrence relations -- Partitions and generating functions -- Introduction to graphs -- Trees -- Groups of permutations -- Group actions -- Counting patterns -- Pólya counting -- Dirichlet's pigeonhole principle -- Ramsey theory -- Rook polynomials and matchings.
520 ## - SUMMARY, ETC.
Summary, etc. "Completely revised, How to Count: An Introduction to Combinatorics, Second Edition shows how to solve numerous classic and other interesting combinatorial problems. The authors take an easily accessible approach that introduces problems before leading into the theory involved. Although the authors present most of the topics through concrete problems, they also emphasize the importance of proofs in mathematics. This second edition incorporates 50 percent more material. It includes seven new chapters that cover occupancy problems, Stirling and Catalan numbers, graph theory, trees, Dirichlet's pigeonhole principle, Ramsey theory, and rook polynomials. This edition also contains more than 450 exercises. Ideal for both classroom teaching and self-study, this text requires only a modest amount of mathematical background. In an engaging way, it covers many combinatorial tools, such as the inclusion-exclusion principle, generating functions, recurrence relations, and Pólya's counting theorem."--Publisher's description.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Combinatorial analysis.
9 (RLIN) 435
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Slomson, A. B.
9 (RLIN) 436
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Slomson, A. B.
9 (RLIN) 437
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type Books
Holdings
Withdrawn status Lost status Damaged status Not for loan Home library Current library Shelving location Date acquired Total Checkouts Full call number Barcode Date last seen Price effective from Koha item type
        Department of Computer Science Department of Computer Science General Stacks 10/10/2013   519.11 ALL MCS5090 10/10/2013 10/10/2013 Books

University Library
Cochin University of Science and Technology
Kochi-682 022, Kerala, India