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


Counting finite posets and topologies
Authors:Marcel Erné  Kurt Stege
Institution:(1) Institut für Mathematik, Universität Hannover, Welfengarten 1, D-3000 Hannover, Germany
Abstract:A refinement of an algorithm developed by Culberson and Rawlins yields the numbers of all partially ordered sets (posets) with n points and k antichains for nle11 and all relevant integers k. Using these numbers in connection with certain formulae derived earlier by the first author, one can now compute the numbers of all quasiordered sets, posets, connected posets etc. with n points for nle14. Using the well-known one-to-one correspondence between finite quasiordered sets and finite topological spaces, one obtains the numbers of finite topological spaces with n points and k open sets for nle11 and all k, and then the numbers of all topologies on nle14 points satisfying various degrees of separation and connectedness properties, respectively. The number of (connected) topologies on 14 points exceeds 1023.
Keywords:05A15  05A19  06A06  54-04
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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