arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1404.4239math.COcs.CGmath.ATmath.GT
收藏

可塌缩复形的极值例子与随机离散莫尔斯理论

Extremal examples of collapsible complexes and random discrete Morse theory

Karim A. Adiprasito, Bruno Benedetti, Frank H. Lutz

摘要:

我们提出了极值结构与单纯可扩展性的属性。(1)对于每一个$d \ge 2$,有可折叠的(和可壳的)单纯$d$ -复合体,只有一个自由面。此外,还有只有两个自由面的非回避$d$ -复合物。(Both结果在所有方面都是最佳的。)(2)最佳离散Morse向量不需要是唯一的。我们明确地构造了一个可收缩的,但不可折叠的$3$维单纯复形的面向量$f=(106,596,1064,573)$,承认两个不同的最佳离散莫尔斯向量,$(1,1,1,0)$和$(1,0,1,1)$。事实上,我们表明,在每一个维度$d\geq 3$有收缩,非折叠单纯$d$ -复合物,有$(1,0,\dots,0,1,1,0)$和$(1,0,\dots,0,0,1,1)$作为不同的最佳离散莫尔斯矢量。(3)我们给出了一个(非PL)$5$ -流形的第一个显式例子,面向量为$f=(5013,72300,290944,$ $495912,383136,110880)$,这是可塌缩的,但不是同胚的球。此外,我们讨论了随机方法的可扩展性和离散莫尔斯理论可能的改进和缺点。我们将分别介绍\cite{BenedettiLutz2014}的\texttt{lex-first}和\texttt{lex-last}离散莫尔斯策略的随机化版本\texttt{random-lex-first}和\texttt{random-lex-last}-我们将看到,在许多情况下,\texttt{random-lex-last}策略的效果明显优于Benedetti--Lutz的(统一)\texttt{random}策略。在理论方面,我们证明了,经过反复的重心细分,离散莫尔斯矢量随机算法发现,平均而言,指数(在重心细分的数量)的临界细胞的数量渐近几乎肯定。

英文摘要:

We present extremal constructions connected with the property of simplicial collapsibility. (1) For each $d \ge 2$, there are collapsible (and shellable) simplicial $d$-complexes with only one free face. Also, there are non-evasive $d$-complexes with only two free faces. (Both results are optimal in all dimensions.) (2) Optimal discrete Morse vectors need not be unique. We explicitly construct a contractible, but non-collapsible $3$-dimensional simplicial complex with face vector $f=(106,596,1064,573)$ that admits two distinct optimal discrete Morse vectors, $(1,1,1,0)$ and $(1,0,1,1)$. Indeed, we show that in every dimension $d\geq 3$ there are contractible, non-collapsible simplicial $d$-complexes that have $(1,0,\dots,0,1,1,0)$ and $(1,0,\dots,0,0,1,1)$ as distinct optimal discrete Morse vectors. (3) We give a first explicit example of a (non-PL) $5$-manifold, with face vector $f=(5013,72300,290944,$ $495912,383136,110880)$, that is collapsible but not homeomorphic to a ball. Furthermore, we discuss possible improvements and drawbacks of random approaches to collapsibility and discrete Morse theory. We will introduce randomized versions \texttt{random-lex-first} and \texttt{random-lex-last} of the \texttt{lex-first} and \texttt{lex-last} discrete Morse strategies of \cite{BenedettiLutz2014}, respectively --- and we will see that in many instances the \texttt{random-lex-last} strategy works significantly better than Benedetti--Lutz's (uniform) \texttt{random} strategy. On the theoretical side, we prove that after repeated barycentric subdivisions, the discrete Morse vectors found by randomized algorithms have, on average, an exponential (in the number of barycentric subdivisions) number of critical cells asymptotically almost surely.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑