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

On Relationships Between Semi- antichains andUnichain Coverings in Discrete Mathematics
引用本文:吴陈. On Relationships Between Semi- antichains andUnichain Coverings in Discrete Mathematics[J]. 数学季刊, 1998, 0(2)
作者姓名:吴陈
作者单位:Dept. of Electronics and Information,East China Shipbuilding Institute,Jiangsu,212003
摘    要:§1. IntroductionTherelationsbetweenchainsandantichainsinapartiallyorderedsetaretheextensionoftheconceptssuchas“selectingrepresentation”,“selectingseedings”andetc.inrealworldinpractice.Theyaretherelationstobeconsideredindesigningsystems.LetPandGbetwopartiallyorderedsets.Thepartiallyorderedrelation[1]onthemarere-spectivellyrepresentedby“≤”(Theirmeaningsmaybedifferentinpracticeindifferentpar-tiallyorderedset).ThedirectproductP×GofPandGisdefinedasfollows:P×G={(p,g)|p∈P,g∈G}.Thep…


On Relationships Between Semi antichains and Unichain Coverings in Discrete Mathematics
Wu Chen. On Relationships Between Semi antichains and Unichain Coverings in Discrete Mathematics[J]. Chinese Quarterly Journal of Mathematics, 1998, 0(2)
Authors:Wu Chen
Abstract:The paper explores the relationships between the largest cardinality of a semi antichain and the smallest cardinality of its unichain covering on the direct product space induced by two partially ordered sets,through studying on partially ordered sets. A sufficient condition under which they are equal is obtained.
Keywords:discrete mathematics  partially ordered set
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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