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


The combinatorial structure of (m,n)-convex sets
Authors:Marilyn Breen
Affiliation:1. University of Oklahoma, Norman, Oklahoma, U.S.A.
Abstract:LetS be a closed subset of a Hausdorff linear topological space,S having no isolated points, and letc s (m) denote the largest integern for whichS is (m,n)-convex. Ifc s (k)=0 andc s (k+1)=1, then $$ c_s left( m right) = sumlimits_{i = 1}^k {left( {begin{array}{*{20}c} {left[ {frac{{m + k - i}} {k}} right]} 2 end{array} } right)} $$ . Moreover, ifT is a minimalm subset ofS, the combinatorial structure ofT is revealed.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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