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


Point Configurations in d-Space without Large Subsetsin Convex Position
Authors:Gyula?Károlyi  author-information"  >  author-information__contact u-icon-before"  >  mailto:karolyi@cs.elte.hu"   title="  karolyi@cs.elte.hu"   itemprop="  email"   data-track="  click"   data-track-action="  Email author"   data-track-label="  "  >Email author,Pavel?Valtr  author-information"  >  author-information__contact u-icon-before"  >  mailto:valtr@kam.mff.cuni.cz"   title="  valtr@kam.mff.cuni.cz"   itemprop="  email"   data-track="  click"   data-track-action="  Email author"   data-track-label="  "  >Email author
Affiliation:(1) IFOR, Department of Mathematics, ETH Zurich, Zurich, Switzerland and Department of Algebra and Number Theory, Eötvös University, Postafiók 120, H-1518 Budapest, Hungary;(2) Department of Applied Mathematics, Charles University and Institute for Theoretical Computer Science (ITI), Charles University, Malostransk"rsquo"en"rsquo"am. 25, 118 00 Praha 1, Czech Republic
Abstract:In this paper we give a lower bound forthe ErdH os–Szekeres number in higher dimensions.Namely, in two different wayswe construct, for every $n>dge 2$,a configuration of $n$ pointsin general position in $R^d$ containingat most $c_d(log n)^{d-1}$ points in convex position.(Points in $R^d$ are in convex position ifnone of them lies in the convex hull of the others.)
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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