The Borsuk-Ulam theorem and bisection of necklaces-Reference-Cited by-同舟云学术

The Borsuk-Ulam theorem and bisection of necklaces

Published:1986 Issue:4 Volume:98 Page:623-628
ISSN:0002-9939
Container-title:Proceedings of the American Mathematical Society
language:en
Short-container-title:Proc. Amer. Math. Soc.

Author:

Alon Noga,West Douglas B.

Abstract

The Borsuk-Ulam theorem of topology is applied to a problem in discrete mathematics. A bisection of a necklace with k k colors of beads is a collection of intervals whose union captures half the beads of each color. Every necklace with k k colors has a bisection formed by at most k k cuts. Higher-dimensional generalizations are considered.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/proc/1986-098-04/S0002-9939-1986-0861764-9/S0002-9939-1986-0861764-9.pdf

Reference8 articles.

1. S. N. Bhatt and C. E. Leiserson, How to assemble tree machines, Proc. 14th ACM Sympos. Theor. Computing, San Francisco, Assoc. Comp. Mach., 1981, pp. 99-104.

2. K. Borsuk, Drei Satze uber die 𝑛-dimensionale euklidische Sphare, Fund, Math. 20 (1933), 177-190.

3. Bisection of circle colorings;Goldberg, Charles H.;SIAM J. Algebraic Discrete Methods,1985

4. A moment problem in 𝐿₁ approximation;Hobby, Charles R.;Proc. Amer. Math. Soc.,1965

Cited by 39 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. More Variations on Shuffle Squares;Symmetry;2023-10-26

2. Consensus-Halving: Does It Ever Get Easier?;SIAM Journal on Computing;2023-04-04

3. Two's company, three's a crowd: Consensus-halving for a constant number of agents;Artificial Intelligence;2022-12

4. Consensus Halving for Sets of Items;Mathematics of Operations Research;2022-11

5. The Complexity of Finding Fair Independent Sets in Cycles;computational complexity;2022-10-11