Polynomial Automorphisms
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
Cites
Statistics
Verification
Claims the paper makes
Citations
Cited by
The tame and the wild automorphisms of polynomial rings in three variables
Shestakov, I., & Umirbaev, U. (2003) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-03-00440-5 · Cited by 263
Analysis and design of polynomial control systems using dissipation inequalities and sum of squares
Ebenbauer, C., & Allgöwer, F. (2006) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2006.05.014 · Cited by 114
The Nagata automorphism is wild
Shestakov, I. P., & Umirbaev, U. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1735483100 · Cited by 66
A reduction of the Jacobian Conjecture to the symmetric case
de Bondt, M., & van den Essen, A. (2005) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-05-07570-2 · Cited by 60
Some open problems in low dimensional dynamical systems
Gasull, A. (2021) · SeMA Journal · doi:10.1007/s40324-021-00244-3 · Cited by 40
Metadata
- Authors
- van den Essen, A.
- Venue
- Birkhäuser Basel eBooks
- Publisher
- Birkhäuser Basel
- Published
- 2000
- OpenAlex
- W4253289064
- Semantic Scholar
- d04b3a02d04e205385c98d14b26fa948ad6a81ad
- 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.