Tools

LEADER 03672nam 2200517 a 4500

001 ssj0001458996;

003 WaSeSS;

005 20240212080422.0;

006 m d ;

007 cr n ;

008 100617s2011 flua sb 001 0 eng d;

010 a| 2010024420;

020 a| 9781420082609 (hardcover : alk. paper);

020 a| 1420082604 (hardcover : alk. paper);

035 a| (WaSeSS)ssj0001458996;

049 a| EREEa| NEHH;

050 00 a| QA164b| .S57 2011;

082 00 a| 511/.62| 22;

100 1 a| Allenby, R. B. J. T.=| ^A282986;

245 10 a| How to counth| [electronic resource] :b| an introduction to combinatorics /c| R.B.J.T. Allenby, Alan Slomson.;

250 a| 2nd ed.;

260 a| Boca Raton, FL :b| CRC Press,;

300 a| xv, 430 p. :b| ill. ;c| 27 cm.;

490 1 a| Discrete mathematics and its applications;

500 a| First published as: an introduction to combinatorics, 1991.;

504 a| Includes bibliographical references and index.;

505 0 a| 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 -- Pólya counting -- Dirichlet's pigeonhole principle -- Ramsey theory -- Rook polynomials and matchings.;

506 a| Available only to authorized users.;

520 a| "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 Pólya's counting theorem."--Publisher's description.;

538 a| Mode of access: World Wide Web;

650 0 a| Combinatorial analysis.=| ^A31443;

655 0 a| Electronic books.=| ^A491897;

700 1 a| Slomson, A. B.=| ^A268229;

700 1 a| Slomson, A. B.t| Introduction to combinatorics.=| ^A268229;

830 0 a| Discrete mathematics and its applications.=| ^A375546;

856 40 z| Full text available from Ebook Central - Academic Completeu| https://ebookcentral.proquest.com/lib/eastcarolina/detail.action?docID=1648349;

947 a| (OCoLC)ocn642510225;

949 a| CLICK ON WEB ADDRESSw| ASISh| JOYNER188;

949 a| CLICK ON WEB ADDRESSw| ASISh| HSL77;

949 a| CLICK ON WEB ADDRESSw| ASISh| JMUSIC60;

596 a| 1 3 4;

998 a| 6310807;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 6310807-1001l| JNETm| JOYNERr| Ys| Yt| JNESSBKu| 2/15/2024x| EBOOKz| JERESOURCE;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 6310807-2001l| HSLELECm| HSLr| Ys| Yt| HEBKu| 2/15/2024x| EBOOKz| HERESOURCE;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 6310807-3001l| MNETm| JMUSICr| Ys| Yt| MNESSBKu| 2/15/2024x| EBOOKz| JERESOURCE;

How to count an introduction to combinatorics / R.B.J.T. Allenby, Alan Slomson.

Author/creator	Allenby, R. B. J. T.
Other author	Slomson, A. B.
Other author	Slomson, A. B.
Format	Electronic
Edition	2nd ed.
Publication Info	Boca Raton, FL : CRC Press,
Description	xv, 430 p. : ill. ; 27 cm.
Supplemental Content	Full text available from Ebook Central - Academic Complete
Subjects	Combinatorial analysis.

Series	Discrete mathematics and its applications Discrete mathematics and its applications. ^A375546
Contents	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 -- Pólya counting -- Dirichlet's pigeonhole principle -- Ramsey theory -- Rook polynomials and matchings.
Abstract	"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 Pólya's counting theorem."--Publisher's description.
General note	First published as: an introduction to combinatorics, 1991.
Bibliography note	Includes bibliographical references and index.
Access restriction	Available only to authorized users.
Technical details	Mode of access: World Wide Web
Genre/form	Electronic books.
LCCN	2010024420
ISBN	9781420082609 (hardcover : alk. paper)
ISBN	1420082604 (hardcover : alk. paper)

Availability

Library	Location	Call Number	Status	Item Actions
	Electronic Resources	Access Content Online	✔ Available

How to count an introduction to combinatorics / R.B.J.T. Allenby, Alan Slomson.

Click here for more information about this title

Availability