MARC details
000 -LEADER |
fixed length control field |
01767nam a2200301Ia 4500 |
003 - CONTROL NUMBER IDENTIFIER |
control field |
LDD |
005 - DATE AND TIME OF LATEST TRANSACTION |
control field |
20191018153039.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
fixed length control field |
181029s9999 xx 000 0 und d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9781498780254 |
Terms of availability |
P 76.99 |
040 ## - CATALOGING SOURCE |
Transcribing agency |
LDD |
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
Edition number |
23 |
Classification number |
311.62 L824C-2 |
100 ## - MAIN ENTRY--PERSONAL NAME |
Personal name |
Loehr, Nicholas A. |
9 (RLIN) |
9033 |
245 #0 - TITLE STATEMENT |
Title |
Combinatorics / |
Statement of responsibility, etc. |
Nicholas A. Loehr. |
250 ## - EDITION STATEMENT |
Edition statement |
Second edition. |
260 ## - PUBLICATION, DISTRIBUTION, ETC. |
Place of publication, distribution, etc. |
Boca Raton : |
Name of publisher, distributor, etc. |
CRC Press, Taylor & Francis Group, |
Date of publication, distribution, etc. |
2018. |
300 ## - PHYSICAL DESCRIPTION |
Extent |
xxiv, 618 pages : |
Other physical details |
illustrations ; |
Dimensions |
27 cm. |
365 ## - TRADE PRICE |
Price amount |
P 76.99 |
490 ## - SERIES STATEMENT |
Series statement |
Discrete mathematics and its applications |
500 ## - GENERAL NOTE |
General note |
Previous edition: Bijective combinatorics / Nicholas A. Loehr (Boca Raton, FL : Chapman & Hall/CRC, c2011). |
504 ## - BIBLIOGRAPHY, ETC. NOTE |
Bibliography, etc. note |
Includes bibliographical references (pages 595-601) and index. |
520 ## - SUMMARY, ETC. |
Summary, etc. |
Bijective proofs are some of the most elegant and powerful techniques in all of mathematics. Suitable for readers without prior background in algebra or combinatorics, the book presents an introduction to enumerative and algebraic combinatorics emphasizing bijective methods. The text develops mathematical tools, such as basic counting rules, recursions, inclusion-exclusion techniques, generating functions, bijective proofs, and linear-algebraic methods to solve enumeration problems. The tools are used to analyze combinatorial structures, words, permutations, subsets, functions, compositions, integer partitions, graphs, trees, lattice paths, multisets, rook placements, and set partitions. -- |
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Combinatorial analysis. |
9 (RLIN) |
9034 |
700 ## - ADDED ENTRY--PERSONAL NAME |
Personal name |
Loehr, Nicholas A. |
9 (RLIN) |
9033 |
901 ## - LOCAL DATA ELEMENT A, LDA (RLIN) |
a |
16979 |
b |
24-11-2017 |
902 ## - LOCAL DATA ELEMENT B, LDB (RLIN) |
a |
20575 |
b |
19-12-2017 |
c |
F |
d |
SBA |
e |
51 |
903 ## - LOCAL DATA ELEMENT C, LDC (RLIN) |
a |
Discount-20 |
b |
Reqst by : S. Venkataraman |
942 ## - ADDED ENTRY ELEMENTS (KOHA) |
Source of classification or shelving scheme |
Dewey Decimal Classification |
Koha item type |
Books |