CoChat

Polynomial Automorphisms

van den Essen, Arno · 2000 · Birkhäuser Basel eBooks

The DOI matches its Crossref record.

Abstract

Motivated by some notorious open problems, such as the Jacobian conjecture and the tame generators problem, the subject of polynomial automorphisms has become a rapidly growing field of interest. This

Overview

Integrity signals

Registry

Crossref · 10.1007/978-3-0348-8440-2

Cites

Statistics

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

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cited by

See all 291

Metadata

Authors
van den Essen, A.
Venue
Birkhäuser Basel eBooks
Published
2000
OpenAlex
W4253289064
Cited by
274
References
0
Citations by year
2026: 8 · 2025: 6 · 2024: 11 · 2023: 14 · 2022: 7 · 2021: 15 · 2020: 11 · 2019: 19 · 2018: 9 · 2017: 16 · 2016: 11 · 2015: 15 · 2014: 12 · 2013: 12 · 2012: 5
FWCI
4.09
Type
book
Language
en
Open access
closed
Licence
www.springer.com/tdm (tdm)
Locations
  • Birkhäuser Basel eBooks (publishedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • Radboud Repository (Radboud University) (submittedVersion)
Topics
  • Physical Sciences › Mathematics › Geometry and Topology › Advanced Differential Equations and Dynamical Systems
  • Physical Sciences › Engineering › Control and Systems Engineering › Control and Dynamics of Mobile Robots
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Quantum chaos and dynamical systems
Keywords
polynomial automorphisms, Jacobian conjecture, open problems, polynomial rings

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: Polynomial Automorphisms. https://app.cochat.ai/papers/10.1007/978-3-0348-8440-2
The paper
van den Essen, A. (2000). Polynomial Automorphisms. Birkhäuser Basel eBooks. https://doi.org/10.1007/978-3-0348-8440-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.