Unverified50% confidenceFactExact time
In d-dimensional space, the number of convex hull vertices of n points can reach O(n^floor(d/2)) in the worst case, a phenomenon known as the Upper Bound Theorem.
1
Sources
50%
Confidence
Long-term
Relevance
9/30/2026
First Seen
Sources
Related Entities
Related Claims
Unverified球面亏格为0，环面亏格为1，亏格是衡量曲面复杂程度的拓扑不变量66% similarUnverifiedA graph with n vertices has 2^(n(n-1)/2) possible configurations65% similarUnverified在n维空间中一个临界点成为局部极小值的概率约为(1/2)^n，因为要求Hessian矩阵的所有n个特征值都为正64% similarUnverified西尔维斯特-加莱定理指出：平面上给定有限个点，如果它们不全在同一条直线上，那么必然存在一条恰好只穿过其中两个点的直线（普通直线）64% similarUnverified第 n 个折痕的方向由整数 n 的二进制表示唯一确定：将 n 除以 2 直到得到奇数，若结果模 4 余 1 则折痕向右，余 3 则向左63% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/963141API
curl https://kongchang.com/api/v1/knowledge/claims/963141MCP
get_claim(id=963141)