2 hasil untuk "Swee Hong Chan"
Menampilkan 1–2 · 0,50 detik · RSS
-
Artikel Jurnal
Equality cases of the Alexandrov–Fenchel inequality are not in the polynomial hierarchy
Describing the equality conditions of the Alexandrov–Fenchel inequality [Ale37] has been a major open problem for decades. We prove that in the case of convex polytopes, this description is not in the polynomial hierarchy unless the polynomial hierarchy collapses to a finite level. This is the…
-
Artikel Jurnal
Sorting probability for large Young diagrams
Sorting probability for large Young diagrams, Discrete Analysis 2021:24, 57 pp. Let $P=(X,\leq_P)$ be a finite partially ordered set (or _poset_, for short). A _linear extension_ $L$ of $P$ is a total ordering $\leq_L$ on $X$ such that for every $x,y\in X$, if $x\leq_Py$, then $x\leq_Ly$. It is an…