Maximal Number of Vertices of Polytopes Defined by F-Probabilities

被引：0

作者：

Wallner, Anton ^{[1
]}

机构：

[1] Univ Munich, Munich, Germany

来源：

ISIPTA 05-PROCEEDINGS OF THE FOURTH INTERNATIONAL SYMPOSIUM ON IMPRECISE PROBABILITIES AND THEIR APPLICATIONS | 2005年

关键词：

Geometry of interval probability; number of vertices of structures/cores/credal sets; combinatorial theory of polyhedra; 0/1-matrices;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Every F-probability (= coherent probability) F on a finite sample space Omega(k) with k elements defines a set of classical probabilities in accordance with the interval limits. This set, called "structure" of F, is a convex polytope having dimension <= k - 1. We prove that the maximal number of vertices of structures is exactly k!.

引用

页码：388 / 395

页数：8

共 42 条

[31] Maximal f-Vectors of Minkowski Sums of Large Numbers of Polytopes
Christophe Weibel
Discrete & Computational Geometry, 2012, 47 : 519 - 537
[32] Maximal f-Vectors of Minkowski Sums of Large Numbers of Polytopes
Weibel, Christophe
DISCRETE & COMPUTATIONAL GEOMETRY, 2012, 47 (03) : 519 - 537
[33] A Note on the Maximal Wiener Index of Trees with Given Number of Vertices of Maximum Degree
Lin, Hong
MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2014, 72 (03) : 783 - 790
[34] Trees with maximal second Zagreb index and prescribed number of vertices of the given degree
Vukicevic, Damir
Rajtmajer, Sarah Michele
Trinajstic, Nenad
MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2008, 60 (01) : 65 - 70
[35] Unicyclic Graphs with Given Number of Cut Vertices and the Maximal Merrifield - Simmons Index
Hua, Hongbo
Xu, Xinli
Wang, Hongzhuan
FILOMAT, 2014, 28 (03) : 451 - 461
[36] ON THE MAXIMAL NUMBER OF MUTUALLY ORTHOGONAL F-HYPERRECTANGLES
SUCHOWER, SJ
UTILITAS MATHEMATICA, 1989, 36 : 77 - 82
[37] Maximal number of constant weight vertices of the unit n-cube contained in a k-dimensional subspace
Ahlswede, R
Aydinian, H
Khachatrian, L
2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 390 - 390
[38] The Problem of Computing k-Disjoint Maximal Cliques Covering a Maximum Number of Vertices for Weakly Triangulated Graph
Bandyopadhyay, Sumana
Pal, Rajat Kumar
2014 SCIENCE AND INFORMATION CONFERENCE (SAI), 2014, : 234 - 241
[39] F-algebras of holomorphic functions in a half-plane defined by maximal functions
D. A. Efimov
Doklady Mathematics, 2007, 76 : 755 - 757
[40] F-algebras of holomorphic functions in a half-plane defined by maximal functions
Efimov, D. A.
DOKLADY MATHEMATICS, 2007, 76 (02) : 755 - 757

← 1 2 3 4 5 →