The Borsuk-Ulam Theorem and Bisection of Necklaces
From MaRDI portal
Publication:4722077
DOI10.2307/2045739zbMath0614.05005OpenAlexW4235995746MaRDI QIDQ4722077
Publication date: 1986
Full work available at URL: https://doi.org/10.2307/2045739
Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of partitions of integers (05A17) Fixed-point and coincidence theorems (topological aspects) (54H25) Applications of graph theory to circuits and networks (94C15)
Related Items (37)
\(O_n\) is an \(n\)-MCFL ⋮ Consensus-Halving: Does It Ever Get Easier? ⋮ Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes ⋮ Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem ⋮ Measure partitions using hyperplanes with fixed directions ⋮ Splitting necklaces ⋮ The word problem of \(\mathbb{Z}^n\) is a multiple context-free language ⋮ A survey of mass partitions ⋮ Equipartition of mass distributions by hyperplanes ⋮ Discrete geometry on colored point sets in the plane -- a survey ⋮ Obstacles for splitting multidimensional necklaces ⋮ Splitting multidimensional necklaces ⋮ Unnamed Item ⋮ Thieves can make sandwiches ⋮ Fair Division and Generalizations of Sperner- and KKM-type Results ⋮ Unnamed Item ⋮ Simplotopal maps and necklace splitting ⋮ Computing exact solutions of consensus halving and the Borsuk-Ulam theorem ⋮ Ham-sandwich cuts and center transversals in subspaces ⋮ Resource-monotonicity and population-monotonicity in connected cake-cutting ⋮ On existence theorems ⋮ A generalization of the ham sandwich theorem ⋮ Computing solutions of the paintshop-necklace problem ⋮ The Chromatic Number of Kneser Hypergraphs ⋮ Witt vectors. Part 1 ⋮ Unnamed Item ⋮ Splitting necklaces and measurable colorings of the real line ⋮ Consensus-halving via theorems of Borsuk-Ulam and Tucker ⋮ Ham-Sandwich Cuts and Center Transversals in Subspaces ⋮ Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem ⋮ Paintshop, odd cycles and necklace splitting ⋮ Multilabeled Versions of Sperner's and Fan's Lemmas and Applications ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ The complexity of finding fair independent sets in cycles ⋮ Two's company, three's a crowd: consensus-halving for a constant number of agents ⋮ The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich ⋮ Consensus Halving for Sets of Items
Cites Work
This page was built for publication: The Borsuk-Ulam Theorem and Bisection of Necklaces
