跳到主要內容

簡易檢索 / 詳目顯示

研究生: 邱明哲
Chiu, Min-Che
論文名稱:
A Bijective Proof from Binary trees to Nonnegative sequences
指導教授: 李陽明
學位類別: 碩士
Master
系所名稱: 理學院 - 應用數學系
Department of Mathematical Sciences
論文出版年: 2000
畢業學年度: 88
語文別: 英文
論文頁數: 24
相關次數: 點閱:100下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報

  • 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.

    封面頁
    證明書
    論文摘要
    目錄
    1. Introduction
    1.1 Catalan number
    1.2 Nonnegative sequences with terms and its properties
    1.3 Sub-nonnegative sequences and its properties
    2. Function Definition
    2.1 Function construction
    2.2 Examples
    3. Proof
    3.1 The function is well-defined
    3.2 The function is injective
    3.3 The function is surjective
    3.4 Examples
    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.

    無法下載圖示 (限達賢圖書館四樓資訊教室A單機使用)
    QR CODE
    :::