首页 | 本学科首页   官方微博 | 高级检索  
     


On the complexity of posets
Authors:William T. Trotter  Kenneth P. Bogart
Affiliation:Department of Mathematics and Computer Science, University of South Carolina, Columbia, SC 29208, U.S.A.;Mathematics Department, Dartmouth College, Hanover, NH 03755, U.S.A.
Abstract:The purpose of this paper is to discuss several invariants each of which provides a measure of the intuitive notion of complexity for a finite partially ordered set. For a poset X the invariants discussed include cardinality, width, length, breadth, dimension, weak dimension, interval dimension and semiorder dimension denoted respectively X, W(X), L(X), B(X), dim(X). Wdim(X), Idim(X) and Sdim(X). Among these invariants the following inequalities hold. B(X)?Idim(X)?Sdim(X)?Wdim(X)?dim(X)?W(X). We prove that every poset X with three of more points contains a partly with Idim(X) Idim(X) {x,v}). If M denotes the set of maximal elements and A an arbitrary anticham of X we show that Idim(X)?W(X-M) and Idim(X)?2W(X-A). We also show that there exist functions f(n,t) and (gt) such that I(X)?n and Idim(X)?tsimply dim(X)?f(n,t and Sdim(X)?t implies dim(X)?g(t).
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号