Posets Arising as 1-Skeleta of Simple Polytopes, the Nonrevisiting Path Conjecture, and Poset Topology
Posets Arising as 1-Skeleta of Simple Polytopes, the Nonrevisiting Path Conjecture, and Poset Topology
复制标题
作为简单多面体的 1-骨架产生的偏序集、不重访路径猜想和偏序集拓扑
DOI:
--
复制
发表时间:
2018
期刊:
影响因子:
--
通讯作者:
P. Hersh
中科院分区:
文献类型:
--
作者:
P. Hersh
Given any polytope $P$ and any generic linear functional ${f c} $, one obtains a directed graph $G(P,{f c})$ by taking the 1-skeleton of $P$ and orienting each edge $e(u,v)$ from $u$ to $v$ for ${f c} (u) <{f c} ( v)$. This paper examines the question of finding sufficient conditions on a polytope $P$ and generic cost vector $f{ c}$ so that the graph $G(P, {f c} )$ will not have any directed paths which revisit a face of $P$ after departing from it. This is equivalent to the question of finding conditions on $P$ and ${f c} $ under which the simplex method for linear programming will be efficient under all choices of pivot rules. Conditions are given which provably yield a corollary of the desired directed graph face nonrevisiting property and which could perhaps suffice to give the desired property itself. One of the conditions proposed is that $G(P,{f c} )$ be the Hasse diagram of a partially ordered set, which is equivalent to requiring nonrevisiting of 1-dimensional faces. This opens the door to the usage of poset-theoretic techniques.
This also leads to a result for simple polytopes in which $G(P,{f c})$ is the Hasse diagram of a lattice $L$ that the order complex of each open interval in $L$ is homotopy equivalent to a ball or a sphere of some dimension. Applications are given to the weak Bruhat order, the Tamari lattice, and more generally to the Cambrian lattices, using realizations of the Hasse diagrams of these posets as 1-skeleta of permutahedra, associahedra, and generalized associahedra.