English  |  正體中文  |  简体中文  |  Items with full text/Total items : 69937/69937 (100%)
Visitors : 23107682      Online Users : 687
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/84275


    Title: A Study On Kissing Number Problem
    Authors: 陳佑銘;Chen, You-Ming
    Contributors: 數學系
    Keywords: 吻球數
    Date: 2020-07-24
    Issue Date: 2020-09-02 18:47:03 (UTC+8)
    Publisher: 國立中央大學
    Abstract: Kissing number problem 吻球數問題(又稱為牛頓數)是問說,在n維歐氏空間中可以同時接觸中心單位球體的非重疊單位球體的最大數量N? 到目前為止,僅當n = 1; 2; 3; 4; 8和24時才知道其確切的值。
    這個問題陳說起來很簡單,但是經過數百年,已知的答案仍然很少。1694年,Newton與Gregory之間對3維的吻球數發生了一場著名的爭論。Newton認為12是3維時吻球數的正確答案,而Gregory認為答案是13。最後,在關於3維吻球數的結尾是由Schutte和van der Waerden這兩位數學家在1953年給了我們第一個完整證明,即當維度n = 3時吻球數N = 12。
    在這數百年中,數學家們開發了許多方法來近似吻球數的答案。其中有一些方法是眾所周知的。例如,Odlyzko和Sloane使用了線性規劃解決了8維和24的吻球數問題。此外,Musin則是對線性規劃做了一些拓展,從而解決了4維的吻球數問題。
    本研究介紹了線性規劃,半正定規劃。我們將這些方法結合起來,以獲得通過另一種方法重現經典吻球數問題的結果。我們也嘗試用四點半正定規劃來計算,然而並未得到新結果,但我們仍提供數學的基本架構給後來的人參考。;The kissing number problem asks for the maximum number N of pairwise non-overlapping unit spheres that can simultaneously touch a central unit sphere in n-dimensional Euclidean space. The value is only known when n = 1, 2, 3, 4, 8, and 24.

    This question seems simple. However, for hundreds of years, there are still few known answers. In 1694, there was a famous dispute occurred between Newton and Gregory. Newton believed that 12 was the correct answer to the kissing number in dimension 3. However, Gregory thought it was 13. In the end, Schütte and van der Waerden gave us the first proof of the kissing number in dimension 3, N = 12, in 1953.

    During these hundreds of years, mathematicians had developed many ways to approximate the answer. There are some famous methods that are well known. For example, Odlyzko and Sloane′s linear programming solved the kissing number problem in dimension 8 and 24. Moreover, Musin′s extension of the linear programming solved the kissing number problem in dimension 4.

    This study presents the linear programming method, and semidefinite programming method. We combine these methods to obtain a way to reproduce the result of the classical kissing number problem by a different method. We also offer the formula of four points semidefinite programming method to be the reference for latecomers.
    Appears in Collections:[數學研究所] 博碩士論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML29View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明