logo
logo
x
바코드검색
BOOKPRICE.co.kr
책, 도서 가격비교 사이트
바코드검색

인기 검색어

실시간 검색어

검색가능 서점

도서목록 제공

How to Count : An Introduction to Combinatorics, Second Edition

How to Count : An Introduction to Combinatorics, Second Edition (Hardcover, 2 ed)

R. B. J. T. Allenby, Alan Slomson (지은이)
Chapman & Hall
153,420원

일반도서

검색중
서점 할인가 할인률 배송비 혜택/추가 실질최저가 구매하기
125,800원 -18% 0원
6,290원
119,510원 >
yes24 로딩중
교보문고 로딩중
notice_icon 검색 결과 내에 다른 책이 포함되어 있을 수 있습니다.

중고도서

검색중
서점 유형 등록개수 최저가 구매하기
로딩중

eBook

검색중
서점 정가 할인가 마일리지 실질최저가 구매하기
로딩중

책 이미지

How to Count : An Introduction to Combinatorics, Second Edition
eBook 미리보기

책 정보

· 제목 : How to Count : An Introduction to Combinatorics, Second Edition (Hardcover, 2 ed) 
· 분류 : 외국도서 > 과학/수학/생태 > 수학 > 조합론
· ISBN : 9781420082609
· 쪽수 : 444쪽
· 출판일 : 2010-08-12

목차

What’s It All About?
What Is Combinatorics?
Classic Problems
What You Need to Know
Are You Sitting Comfortably?

Permutations and Combinations
The Combinatorial Approach
Permutations
Combinations
Applications to Probability Problems
The Multinomial Theorem
Permutations and Cycles

Occupancy Problems
Counting the Solutions of Equations
New Problems from Old
A "Reduction" Theorem for the Stirling Numbers

The Inclusion-Exclusion Principle
Double Counting
Derangements
A Formula for the Stirling Numbers

Stirling and Catalan Numbers
Stirling Numbers
Permutations and Stirling Numbers
Catalan Numbers

Partitions and Dot Diagrams
Partitions
Dot Diagrams
A Bit of Speculation
More Proofs Using Dot Diagrams

Generating Functions and Recurrence Relations
Functions and Power Series
Generating Functions
What Is a Recurrence Relation?
Fibonacci Numbers
Solving Homogeneous Linear Recurrence Relations
Nonhomogeneous Linear Recurrence Relations
The Theory of Linear Recurrence Relations
Some Nonlinear Recurrence Relations

Partitions and Generating Functions
The Generating Function for the Partition Numbers
A Quick(ish) Way of Finding p(n)
An Upper Bound for the Partition Numbers
The Hardy?Ramanujan Formula
The Story of Hardy and Ramanujan

Introduction to Graphs
Graphs and Pictures
Graphs: A Picture-Free Definition
Isomorphism of Graphs
Paths and Connected Graphs
Planar Graphs
Eulerian Graphs
Hamiltonian Graphs
The Four-Color Theorem

Trees
What Is a Tree?
Labeled Trees
Spanning Trees and Minimal Connectors
The Shortest-Path Problem

Groups of Permutations
Permutations as Groups
Symmetry Groups
Subgroups and Lagrange’s Theorem
Orders of Group Elements
The Orders of Permutations

Group Actions
Colorings
The Axioms for Group Actions
Orbits
Stabilizers

Counting Patterns
Frobenius’s Counting Theorem
Applications of Frobenius’s Counting Theorem

Polya Counting
Colorings and Group Actions
Pattern Inventories
The Cycle Index of a Group
Polya’s Counting Theorem: Statement and Examples
Polya’s Counting Theorem: The Proof
Counting Simple Graphs

Dirichlet’s Pigeonhole Principle
The Origin of the Principle
The Pigeonhole Principle
More Applications of the Pigeonhole Principle

Ramsey Theory
What Is Ramsey’s Theorem?
Three Lovely Theorems
Graphs of Many Colors
Euclidean Ramsey Theory

Rook Polynomials and Matchings
How Rook Polynomials Are Defined
Matchings and Marriages

Solutions to the A Exercises

Books for Further Reading

Index

저자소개

R. B. J. T. Allenby (지은이)    정보 더보기
펼치기
Alan Slomson (지은이)    정보 더보기
펼치기
이 포스팅은 쿠팡 파트너스 활동의 일환으로,
이에 따른 일정액의 수수료를 제공받습니다.
이 포스팅은 제휴마케팅이 포함된 광고로 커미션을 지급 받습니다.
도서 DB 제공 : 알라딘 서점(www.aladin.co.kr)
최근 본 책