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


A Priestley Sum of Finite Trees is Acyclic
Authors:Richard N. Ball  Aleš Pultr  Jiří Sichler
Affiliation:(1) Department of Mathematics, University of Denver, Denver, CO 80208, USA;(2) Department of Applied Mathematics and ITI, MFF, Charles University, CZ 11800 Praha 1, Malostranské nám., 25, Czech Republic;(3) Department of Mathematics, University of Manitoba, Winnipeg, Canada, R3T 2N2
Abstract:We show that the Priestley sum of finite trees contains no cyclic finite poset. The first author would like to express his thanks for support from project LN 1M0021620808 of the Ministry of Education of the Czech Republic. The second author would like to express his thanks for support from project 1M0021620808 of the Ministry of Education of the Czech Republic, from the NSERC of Canada and from a PROF grant from the University of Denver. The third author would like to express his thanks for the support from the NSERC of Canada and for partial support from the project 1M0021620808 of the Ministry of Education of the Czech Republic.
Keywords:Distributive lattice  Priestley duality  Poset  Graph
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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