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


Cutsets and anti-chains in linear lattices
Authors:Bruce Rothschild
Institution:a Department of Mathematics, University of California, Los Angeles, CA, USA
b Department of Mathematics, Pomona College, Claremont, CA 91711, USA
Abstract:Consider the poset, ordered by inclusion, of subspaces of a four-dimensional vector space over a field with 2 elements. We prove that, for this poset, any cutset (i.e., a collection of elements that intersects every maximal chain) contains a maximal anti-chain of the poset. In analogy with the same result by Duffus, Sands, and Winkler D. Duffus, B. Sands, P. Winkler, Maximal chains and anti-chains in Boolean lattices, SIAM J. Discrete Math. 3 (2) (1990) 197-205] for the subset lattice, we conjecture that the above statement holds in any dimension and for any finite base field, and we prove some special cases to support the conjecture.
Keywords:Cutset  Anti-chain  Fibre  Maximal chain  Linear lattice  Projective geometry  _method=retrieve&  _eid=1-s2  0-S0097316506000719&  _mathId=si1  gif&  _pii=S0097316506000719&  _issn=00973165&  _acct=C000053510&  _version=1&  _userid=1524097&  md5=f85def33854d97f1c462b856a03161d3')" style="cursor:pointer  PG(n" target="_blank">" alt="Click to view the MathML source" title="Click to view the MathML source">PG(n  q)
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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