Semantic Scholar Open Access 2014 14 sitasi

Multiple chessboard complexes and the colored Tverberg problem

D. Jojic S. Vrecica R. Živaljević

Lihat Sumber DOI

Abstrak

Following D.B. Karaguezian, V. Reiner, and M.L. Wachs (Matching Complexes, Bounded Degree Graph Complexes, and Weight Spaces of $GL$-Complexes, Journal of Algebra 2001) we study the connectivity degree and shellability of multiple chessboard complexes. Our central new results (Theorems 3.2 and 4.4) provide sharp connectivity bounds relevant to applications in Tverberg type problems where multiple points of the same color are permitted. These results also provide a foundation for the new results of Tverberg-van Kampen-Flores type, as announced in arXiv:1502.05290 [math.CO].

Topik & Kata Kunci

Mathematics Computer Science

Penulis (3)

D. Jojic

S. Vrecica

R. Živaljević

Format Sitasi

APA MLA BibTeX

Jojic, D., Vrecica, S., Živaljević, R. (2014). Multiple chessboard complexes and the colored Tverberg problem. https://doi.org/10.1016/j.jcta.2016.08.008

Akses Cepat

Lihat di Sumber doi.org/10.1016/j.jcta.2016.08.008

Informasi Jurnal

Tahun Terbit: 2014
Bahasa: en
Total Sitasi: 14×
Sumber Database: Semantic Scholar
DOI: 10.1016/j.jcta.2016.08.008
Akses: Open Access ✓