arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2003.04018math.MGmath.CO
收藏

Generalized chessboard complexes and discrete Morse theory

Duško Jojić, Gaiane Panina, Siniša T. Vrećica, Rade T. Živaljević

英文摘要:

Chessboard complexes and their generalizations, as objects, and Discrete Morse theory, as a tool, are presented as a unifying theme linking different areas of geometry, topology, algebra and combinatorics. Edmonds and Fulkerson bottleneck (minmax) theorem is proved and interpreted as a result about a critical point of a discrete Morse function on the Bier sphere of an associated simplicial complex $K$. We illustrate the use of "standard discrete Morse functions" on generalized chessboard complexes by proving a connectivity result for chessboard complexes with multiplicities. Applications include new Tverberg-Van Kampen-Flores type results for $j$-wise disjoint partitions of a simplex.

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

↑