polymake: a Framework for Analyzing Convex Polytopes
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
polymake is a software tool designed for the algorithmic treatment of polytopes and polyhedra. We give an overview of the functionality as well as of the structure. This paper can be seen as a first approximation to a polymake handbook. The tutorial starts with the very basics and ends up with a few polymake applications to research problems. Then we present the main features of the system including the interfaces to other software products. polymake is free software; it is available on the Internet at http://www.math.tu-berlin.de/diskregeom/polymaka/. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Art of Computer Programming: Volume 3: Sorting and Searching
Knuth, D. E. (1973) · Cited by 3,955
Reflection Groups and Coxeter Groups
Humphreys, J. E. (1990) · Cambridge University Press eBooks · doi:10.1017/cbo9780511623646 · Cited by 2,993
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Knuth, D. E. (1998) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 1,421
Handbook of Discrete and Computational Geometry, Second Edition
(2004) · Chapman & Hall/CRC eBooks · doi:10.1201/9781420035315 · Cited by 1,208
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
Knuth, D. E. (1978) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 369
Combinatorial Aspects of Convex Polytopes
Bayer, M. M., & Lee, C. W. (1993) · Elsevier eBooks · doi:10.1016/b978-0-444-89596-7.50019-5 · Cited by 61
Cited by
Ziegler, G. M. (1995) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-8431-1 · Cited by 2,329
What are higher-order networks?
Bick, C., Gross, E., Harrington, H. A., & Schaub, M. T. (2023) · SIAM Review · doi:10.1137/21m1414024 · Cited by 420
“There are other software including simcomp toolbox in GAP [89], or the topology application ‘topaz’ in polymake [105].”
Method
Metadata
- Authors
- Gawrilow, E., & Joswig, M.
- Venue
- Polytopes — Combinatorics and Computation
- Publisher
- Birkhäuser Basel
- Published
- 2000
- Pages
- 43-73
- OpenAlex
- W2233474732
- Cited by
- 535
- References
- 6
- FWCI
- 22.86
- Type
- book chapter
- Language
- en
- Open access
- closed
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: polymake: a Framework for Analyzing Convex Polytopes. https://app.cochat.ai/papers/10.1007/978-3-0348-8438-9_2
- The paper
- Gawrilow, E., & Joswig, M. (2000). polymake: a Framework for Analyzing Convex Polytopes. Polytopes — Combinatorics and Computation. https://doi.org/10.1007/978-3-0348-8438-9_2
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.