中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/28061
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 81570/81570 (100%)
造访人次 : 48280020      在线人数 : 2527
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/28061


    题名: THE CROSSING NUMBER OF POSETS
    作者: LIN,C
    贡献者: 數學研究所
    关键词: ORDERS
    日期: 1994
    上传时间: 2010-06-29 19:41:05 (UTC+8)
    出版者: 中央大學
    摘要: The purpose of this paper is to investigate some properties of the crossing number chi(P) of a poset P. We first study the crossing numbers of the product and the lexicographical sum of posets. The results are similar to the dimensions of these posets. Then we consider the problem of what happens to the crossing number when a point is taken away from a poset. We show that if P is a poset such that x is-an-element-of P and chi(P - x) greater-than-or-equal-to 1, then 1/2 chi(P) less-than-or-equal-to chi(P - x) less-than-or-equal-to chi(P). We don't know yet how to improve the lower bound. We also determine the crossing numbers of some subposets of the Boolean lattice B(n) which consist of some specified ranks. Finally we show that PSI(n) is crossing critical where PSI(n) is the subposet of B(n) which is restricted to rank 1, rank n - 1 and middle rank(s). Some open problems are raised at the end of this paper.
    關聯: ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS
    显示于类别:[數學研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML394检视/开启


    在NCUIR中所有的数据项都受到原著作权保护.

    社群 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 ©   - 隱私權政策聲明