The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
The Borsuk-Ulam theorem and bisection of necklaces
Open accessAbstract
The Borsuk-Ulam theorem of topology is applied to a problem in discrete mathematics. A bisection of a necklace with k colors of beads is a collection of intervals whose union captures half the beads of each color. Every necklace with k colors has a bisection formed by at most k cuts. Higher-dimensional generalizations are considered.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Theorem 1 ([7], cf. also [2]) Given g 1 , . . . , g k : [0 , 1] → R continously integrable functions there always exist 0 = z 0 ≤ z 1 ≤ . . . ≤ z k ≤ z k +1 = 1 and δ 1 , . . . , δ k +1 ∈ { +1 , -1 } such that Σ k +1 i =1 δ i ∫ z i z i -1 g j = 0 for all 1 ≤ j ≤ k .”
From Necklace Bisection with One Cut Less than Needed (2008) · cites this paper as [2]
In the citing paper
“A well-known theorem of Goldberg and West states that two thieves can always split a necklace containing an even number of beads from each of k types fairly by at most k cuts.”
From Necklace Bisection with One Cut Less than Needed (2008) · cites this paper as [2]
Citations
Cites
Drei Sätze über die n-dimensionale euklidische Sphäre
Borsuk, K. (1933) · Fundamenta Mathematicae · doi:10.4064/fm-20-1-177-190 · Cited by 516
Alon, N. (1987) · Advances in Mathematics · doi:10.1016/0001-8708(87)90055-7 · Cited by 136
Self-citationGoldberg, C. H., & West, D. B. (1985) · SIAM Journal on Algebraic Discrete Methods · doi:10.1137/0606010 · Cited by 69
Self-citationBhatt, S. N., & Leiserson, C. E. (1984) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 60
A Simple Proof of the Hobby-Rice Theorem
Pinkus, A. M. (1976) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1976-0425470-0 · Cited by 34
A Moment Problem in L 1 Approximation
Hobby, C. R., & Rice, J. R. (1965) · Proceedings of the American Mathematical Society · doi:10.2307/2033900 · Cited by 10
A moment problem in 𝐿₁ approximation
Hobby, C. R., & Rice, J. R. (1965) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1965-0178292-5 · Cited by 3
Research works printed but not linked: 2
- Dugundji, James, 1966, Topology
- Liapounoff, A., 1940, Sur les fonctions-vecteurs complètement additives, Bull. Acad. Sci. URSS. S\'{e}r. Math. [Izvestia Akad. Nauk SSSR], 4, 465
Cited by
Alon, N. (1987) · Advances in Mathematics · doi:10.1016/0001-8708(87)90055-7 · Cited by 136
Self-citationThe Chromatic Number of Kneser Hypergraphs
Alon, N., Frankl, P., & Lovász, L. (1986) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1986-0857448-8 · Cited by 127
Self-citationThe discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
Loera, J. A. D., Goaoc, X., Meunier, F., & Mustafa, N. H. (2019) · Bulletin of the American Mathematical Society · doi:10.1090/bull/1653 · Cited by 85
Consensus-halving via theorems of Borsuk-Ulam and Tucker
Simmons, F. W., & Su, F. E. (2003) · Mathematical Social Sciences · doi:10.1016/s0165-4896(02)00087-2 · Cited by 74
Equipartition of mass distributions by hyperplanes
Ramos, E. A. (1996) · Discrete & Computational Geometry · doi:10.1007/bf02717729 · Cited by 62
Metadata
- Authors
- Alon, N., & West, D. B.
- Affiliations
- University of Illinois Urbana-Champaign (US)
- Venue
- Proceedings of the American Mathematical Society
- Publisher
- American Mathematical Society (AMS)
- Published
- 1986-12
- Volume
- 98
- Issue
- 4
- Pages
- 623-628
- ISSN
- 0002-9939 (ISSN-L)
- 1088-6826
- OpenAlex
- W1963607038
- Semantic Scholar
- d691dfd3d7dec4f0ca9f4d4dabd690b0fddd82af
- Cited by
- 88
- References
- 6
- Citations by year
- 2026: 3 · 2025: 4 · 2024: 4 · 2023: 5 · 2022: 6 · 2021: 6 · 2020: 8 · 2019: 4 · 2018: 5 · 2017: 1 · 2016: 3 · 2015: 4 · 2014: 1 · 2013: 1 · 2012: 1
- FWCI
- 2.16
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Proceedings of the American Mathematical Society (publishedVersion)
- Funders
- National Science Foundation (8406100, 8504322)
- Office of Naval Research (N00014)
- Topics
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Advanced Combinatorial Mathematics
- Social Sciences › Economics, Econometrics and Finance › Economics and Econometrics › Game Theory and Voting Systems
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Limits and Structures in Graph Theory
- Keywords
- Borsuk-Ulam theorem, discrete topology, topological combinatorics, higher-dimensional generalization
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Borsuk-Ulam theorem and bisection of necklaces. https://app.cochat.ai/papers/10.1090/s0002-9939-1986-0861764-9
- The paper
- Alon, N., & West, D. B. (1986). The Borsuk-Ulam theorem and bisection of necklaces. Proceedings of the American Mathematical Society. https://doi.org/10.1090/s0002-9939-1986-0861764-9
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.