Publication View

Abstract (2005)

Abstract

The Borsuk-Ulam theorem has many applications in algebraic topology, algebraic geomtry, and combinatorics. Here we study some combinatorial consequences, typically asserting the existence of a certain combinatorial object. We also focus on the computational complexity of algorithms that search for the object. 1

Publication details

Download	http://citeseerx.ist.psu.edu/viewdoc/summary?doi=?doi=10.1.1.138.90
Source	http://paul.rutgers.edu/~samroy/Papers/BUmain.pdf
Contributors	CiteSeerX
Repository	CiteSeerX - Scientific Literature Digital Library and Search Engine (United States)
Type	text
Language	English
Relation	10.1.1.111.3313, 10.1.1.107.9127, 10.1.1.2.9415, 10.1.1.41.821, 10.1.1.40.8418, 10.1.1.55.9466, 10.1.1.132.8742, 10.1.1.4.1582, 10.1.1.43.4890, 10.1.1.119.8878, 10.1.1.38.8438, 10.1.1.33.2847, 10.1.1.11.8482, 10.1.1.70.4728, 10.1.1.126.4744, 10.1.1.11.9930, 10.1.1.10.6572, 10.1.1.42.9774, 10.1.1.2.3149, 10.1.1.25.9447, 10.1.1.16.3619, 10.1.1.137.6073, 10.1.1.60.8396, 10.1.1.26.6233, 10.1.1.133.8548, 10.1.1.80.4097, 10.1.1.42.6193, 10.1.1.1.7151, 10.1.1.86.6685, 10.1.1.92.3236, 10.1.1.68.3186, 10.1.1.24.8105, 10.1.1.35.7165, 10.1.1.67.3209, 10.1.1.15.2100, 10.1.1.12.6786, 10.1.1.11.1218