Balancing extensions via Brunn-Minkowski期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

Balancing extensions via Brunn-Minkowski

Authors:

Affiliation:

1. Department of Mathematics and Center for Operations Research, Rutgers University, 08903, New Brunswick, NJ, USA
2. Institute of Mathematics and Computer Sci, The Hebrew University, 91904, Jerusalem, Israel
3. IBM Research Almaden, 650 Harry Rd., 95120, San Jose, Ca, USA

Abstract:

We give a simple proof, based on the Brunn-Minkowski Theorem, of Theorem. Inany finite poset P not a total order there are elementsx, y such that



Keywords:	KeywordHeading" >AMS subject classification (1991) 06 A 07 52 A 38 68 P 10 68 R 05
本文献已被 SpringerLink 等数据库收录！

设为首页 | 免责声明 | 关于勤云 | 加入收藏