Student or educator? Sign up with your school email and get 6 months of Pro free.

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 access
Alon, Noga, West, Douglas B.·1986·Proceedings of the American Mathematical Society

Abstract

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

Crossref · 10.1090/s0002-9939-1986-0861764-9

Cites

7 of 7 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 6 references

Research works printed but not linked: 2

  1. Dugundji, James, 1966, Topology
  2. 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

See all 89

Metadata

Authors
Alon, N., & West, D. B.
Affiliations
University of Illinois Urbana-Champaign (US)
Venue
Proceedings of the American Mathematical Society
Published
1986-12
Volume
98
Issue
4
Pages
623-628
ISSN
  • 0002-9939 (ISSN-L)
  • 1088-6826
OpenAlex
W1963607038
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
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.