자료유형 | 단행본 |
---|---|
서명/저자사항 | Bijective combinatorics/ Nicholas A. Loehr. |
개인저자 | Loehr, Nicholas A. |
발행사항 | Boca Raton, FL: CRC: Chapman & Hall, c2011. |
형태사항 | xxii, 590 p.: ill.; 27 cm. |
총서사항 | Discrete mathematics and its applications |
ISBN | 9781439848845 (hardback): 143984884X (hardback) |
서지주기 | Includes bibliographical references and index. |
요약 | "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, Bijective Combinatorics presents a general introduction to enumerative and algebraic combinatorics that emphasizes bijective methods.The text systematically develops the mathematical tools, such as basic counting rules, recursions, inclusion-exclusion techniques, generating functions, bijective proofs, and linear-algebraic methods, needed to solve enumeration problems. These tools are used to analyze many combinatorial structures, including words, permutations, subsets, functions, compositions, integer partitions, graphs, trees, lattice paths, multisets, rook placements, set partitions, Eulerian tours, derangements, posets, tilings, and abaci. The book also delves into algebraic aspects of combinatorics, offering detailed treatments of formal power series, symmetric groups, group actions, symmetric polynomials, determinants, and the combinatorial calculus of tableaux. Each chapter includes summaries and extensive problem sets that review and reinforce the material.Lucid, engaging, yet fully rigorous, this text describes a host of combinatorial techniques to help solve complicated enumeration problems. It covers the basic principles of enumeration, giving due attention to the role of bijective proofs in enumeration theory"-- |
요약 | "This book presents a general introduction to enumerative combinatorics that emphasizes bijective methods. The text contains a systematic development of the mathematical tools needed to solve enumeration problems: basic counting rules, recursions, inclusion-exclusion techniques, generating functions, bijective proofs, and linear-algebraic methods. These tools are used to analyze many combinatorial structures including words, permutations, subsets, functions, compositions, integer partitions, graphs, trees, lattice paths, multisets, rook placements, set partitions, Eulerian tours, derangements, posets, tilings, and abaci. Later chapters delve into some of the algebraic aspects of combinatorics, including detailed treatments of formal power series, symmetric groups, group actions, symmetric polynomials, determinants, and the combinatorial calculus of tableaux"-- |
해제 | Provided by publisher. |
해제 | Provided by publisher. |
일반주제명 | Combinatorial analysis. |
분류기호(DDC) | 511.6 |
언어 | 영어 |
보존/밀집/기증 자료 신청 분관대출 서가부재도서 무인예약대출 배달서비스 소장위치출력
No. | 등록번호 | 청구기호 | 소장처 | 밀집번호 | 도서상태 | 반납예정일 | 예약 | 서비스 | 매체정보 |
---|---|---|---|---|---|---|---|---|---|
1 | 1161826 | 511.6 L82bc | 중앙도서관[본관]/3자료실(3층)/ | 대출가능 |