Please use this identifier to cite or link to this item:

Title: A Bijective Proof from Binary trees to Nonnegative sequences
Authors: 邱明哲
Chiu, Min-Che
Contributors: 李陽明
Chiu, Min-Che
Keywords: Combinatorics
Date: 2000
Issue Date: 2016-04-18 16:31:39 (UTC+8)
Abstract: In this thesis, we use Mathematical Induction to give a direct proof to show the numbers of binary trees with nodes and nonnegative sequences with terms are the same.
Reference: Reference
[1] F. Roberts, Applied Combinatorics, Prentice-Hall, Englewood Cliffs, N.J., 1984.
[2] John G. Michael and Kenneth H. Rosen, Applications Of Discrete Mathematics, McGraw-Hill, 1992.
[3] K. Bogart, Introductory Combinatorics, Harcourt, Brace, Jovanovich, New York, 1990.
[4] L. Comptet, Advanced Combinatorics, D. Reidel, Boston, 1974.
Description: 碩士
Source URI:
Data Type: thesis
Appears in Collections:[應用數學系] 學位論文

Files in This Item:

File SizeFormat

All items in 學術集成 are protected by copyright, with all rights reserved.

社群 sharing