Colored Tverberg problem, extensions and new results
英文摘要:
We prove a "multiple colored Tverberg theorem" and a "balanced colored Tverberg theorem", by applying different methods, tools and ideas. The proof of the first theorem uses multiple chessboard complexes (as configuration spaces) and Eilenberg-Krasnoselskii theory of degrees of equivariant maps for non-free actions. The proof of the second result relies on high connectivity of the configuration space, established by discrete Morse theory.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。