arxiv: 2604.11693 · v1 · submitted 2026-04-13 · 🧮 math.AC

Recognition: unknown

Strongly nilpotent automorphisms are Pascal finite

El\.zbieta Adamus, Zbigniew Hajto

Pith reviewed 2026-05-10 15:31 UTC · model grok-4.3

classification 🧮 math.AC

keywords polynomial automorphismsstrongly nilpotent automorphismsPascal finite automorphismsNagata automorphismquadratic automorphismscommutative algebra

0 comments

The pith

Strongly nilpotent automorphisms of polynomial rings are always Pascal finite.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper compares the two classes of strongly nilpotent and Pascal finite polynomial automorphisms. It establishes that every strongly nilpotent automorphism must be Pascal finite. The reverse inclusion does not hold. Nagata's automorphism supplies a concrete case that is Pascal finite yet not strongly nilpotent. Vasyunin's quadratic example further shows that not every quadratic polynomial automorphism belongs to the Pascal finite class.

Core claim

We conclude that every strongly nilpotent automorphism is a Pascal finite one, but not vice versa. We observe that Nagata's automorphism is Pascal finite, but not strongly nilpotent. Considering Vasyunin example leads us to conclusion that not every quadratic polynomial automorphism is Pascal finite.

What carries the argument

The inclusion of the class of strongly nilpotent automorphisms inside the class of Pascal finite automorphisms, established by comparing their defining properties on polynomial rings.

If this is right

Any automorphism shown to be strongly nilpotent automatically satisfies the Pascal finite property.
Nagata's automorphism belongs to the Pascal finite class without being strongly nilpotent.
Quadratic polynomial automorphisms need not be Pascal finite, as shown by Vasyunin's example.
The two classes are distinct, with the strongly nilpotent class properly contained in the Pascal finite class.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The one-way containment supplies a coarser invariant that can be checked before testing the stricter strongly nilpotent condition.
The concrete counterexamples already in the literature can serve as test cases when developing membership algorithms for either class.

Load-bearing premise

The two automorphism classes are defined so that their membership can be compared directly using only the standard operations and degree considerations in polynomial rings.

What would settle it

An explicit strongly nilpotent automorphism of a polynomial ring that fails the Pascal finite condition would disprove the claimed inclusion.

read the original abstract

We compare two classes of polynomial automorphisms, strongly nilpotent and Pascal finite. We conclude that every strongly nilpotent automorphism is a Pascal finite one, but not vice versa. We observe that Nagata's automorphism is Pascal finite, but not strongly nilpotent. Considering Vasyunin example leads us to conclusion that not every quadratic polynomial automorphism is Pascal finite.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Strongly nilpotent automorphisms form a proper subclass of Pascal finite ones, separated by Nagata's and Vasyunin's examples.

read the letter

The key point here is that strongly nilpotent polynomial automorphisms are always Pascal finite, though the reverse is not true, as shown by Nagata's automorphism being Pascal finite but not strongly nilpotent, and the Vasyunin example demonstrating that some quadratic automorphisms fail to be Pascal finite. This establishes a new inclusion between the two classes and supplies specific counterexamples that separate them. The paper does well by grounding the distinction in concrete, previously studied automorphisms rather than abstract arguments alone. Using Nagata and Vasyunin allows readers to see the separation without needing to construct new examples from scratch. The logic appears to follow from standard properties of polynomial rings, which is appropriate for this specialized topic. The soft spots are limited. Since the full proofs and definitions are not in the abstract, one has to trust that the direct computations for the examples hold up, but the stress test indicates no internal inconsistency or hidden assumptions that would break the claim. It's a short note, so it doesn't develop new techniques or apply the result to broader problems, which might make it feel incremental to some readers. If the field has many such comparisons already, this adds one more data point rather than shifting the landscape. This paper is aimed at experts in commutative algebra who study polynomial automorphisms and their various finiteness or nilpotency conditions. Someone working on classifying these maps or comparing different notions of 'finite' behavior would get value from seeing how these two classes relate. I would recommend sending this to peer review. The result is clear, the examples are named and checkable, and it deserves a referee's look to verify the details and assess its place in the literature.

Referee Report

0 major / 2 minor

Summary. The paper compares the classes of strongly nilpotent and Pascal finite polynomial automorphisms over a field (typically of characteristic zero). It proves that every strongly nilpotent automorphism is Pascal finite, supplies explicit counterexamples showing the converse fails, verifies that Nagata's automorphism is Pascal finite but not strongly nilpotent, and shows via Vasyunin's quadratic example that not every quadratic polynomial automorphism is Pascal finite.

Significance. If the inclusion and the separation of the two classes hold, the result clarifies the relative strength of two finiteness-type conditions on automorphisms of polynomial rings. This is relevant to the structure of the automorphism group and to questions surrounding the Jacobian conjecture. The concrete counterexamples (Nagata, Vasyunin) provide explicit, checkable instances that separate the notions and may serve as test cases for further invariants.

minor comments (2)

The abstract and introduction would benefit from a brief, self-contained reminder of the precise definitions of 'strongly nilpotent' and 'Pascal finite' (even if they are standard), so that the one-way implication and the counterexamples can be understood without immediate reference to external sources.
The verification that Nagata's automorphism is Pascal finite but not strongly nilpotent, and the corresponding computation for Vasyunin's example, should be expanded with at least one intermediate step or explicit matrix or degree bound so that the direct-computation claim can be followed without external software or lengthy hand calculation.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary of our manuscript, the assessment of its significance, and the recommendation for minor revision. No specific major comments or points requiring clarification were listed in the report.

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper defines strongly nilpotent and Pascal finite automorphisms as independent classes and proves a one-way implication using standard properties of polynomial rings over fields of characteristic zero. The abstract and described logic supply explicit counterexamples (Nagata, Vasyunin) verifiable by direct computation, with no self-definitional reductions, fitted parameters renamed as predictions, load-bearing self-citations, or ansatz smuggling. The derivation chain remains self-contained against external algebraic benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper works entirely within the existing framework of polynomial automorphisms; no new free parameters, ad-hoc axioms, or invented entities are introduced in the abstract.

axioms (1)

domain assumption Polynomial automorphisms are considered over a field (standardly of characteristic zero).
This is the conventional setting for the study of polynomial automorphisms and is presupposed by the definitions of the two classes.

pith-pipeline@v0.9.0 · 5338 in / 1132 out tokens · 31910 ms · 2026-05-10T15:31:16.334631+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

14 extracted references · 8 canonical work pages

[1]

E. Adamus,A note on algorithmic approach to inverting formal power series, arXiv:2503.03520v2, https://doi.org/10.48550/arXiv.2503.03520, accepted for publication in the Proceedings - Mathe- matical Sciences

work page doi:10.48550/arxiv.2503.03520
[2]

Adamus, P

E. Adamus, P. Bogdan, T. Crespo and Z. Hajto,An effective study of polynomial maps, Journal of Algebra and Its Applications, 16 (2017), No.8, 1750141, 13pp, DOI: 10.1142/S0219498817501419

work page doi:10.1142/s0219498817501419 2017
[3]

Adamus, P

E. Adamus, P. Bogdan, T. Crespo and Z. Hajto,Pascal finite polynomial automorphisms, Journal of Algebra and Its Applications, Vol. 18, No. 7 (2019), DOI: 10.1142/S021949881950124X

work page doi:10.1142/s021949881950124x 2019
[4]

H.Bass, E.Connell, D.Wright,The Jacobian conjecture: Reduction of degree and formal expansion of the inverse, Bull. Amer. Math. Soc. 7 (1982), 287-330

1982
[5]

E. Bisi, P. Dyszewski, N. Gantert, S.G.G. Johnston, J. Prochno, D. Schmid,Random planar trees and the Jacobian conjecture, J. Lond. Math. Soc., II. Ser. 113, No. 1, Article ID e70416, 40 p. (2026),https://doi.org/10.1112/jlms.70416

work page doi:10.1112/jlms.70416 2026
[6]

de Bondt,Homogeneous Keller maps, Doctoral thesis, 2009

M. de Bondt,Homogeneous Keller maps, Doctoral thesis, 2009

2009
[7]

de Bondt,The strong nilpotency index of a matrix, Linear and Multilinear Algebra, Vol

M. de Bondt,The strong nilpotency index of a matrix, Linear and Multilinear Algebra, Vol. 62, No. 4, 486–497 (2014), http://dx.doi.org/10.1080/03081087.2013.784282

work page doi:10.1080/03081087.2013.784282 2014
[8]

van den Essen,Polynomial automorphisms and the Jacobian Conjecture, Progress in Mathe- matics 190 (Birkhäuser Verlag, 2000)

A. van den Essen,Polynomial automorphisms and the Jacobian Conjecture, Progress in Mathe- matics 190 (Birkhäuser Verlag, 2000). 9

2000
[9]

Furter, S

J-Ph. Furter, S. Maubach, Locally finite polynomial endomorphisms,Journal of Pure and Applied Algebra211(2007) 445—458

2007
[10]

S. G. G. Johnston,A degree bound for strongly nilpotent polynomial automorphisms, J. Algebra 608 (2022), 259–271, DOI:10.1016/j.jalgebra.2022.05.027

work page doi:10.1016/j.jalgebra.2022.05.027 2022
[11]

S. G.G. Johnston, J. Prochno,Faà di Bruno’s formula and inversion of power series, Advances in Mathematics, Vol. 395, 2022, 108080, https://doi.org/10.1016/j.aim.2021.108080

work page doi:10.1016/j.aim.2021.108080 2022
[12]

G. H. Meisters, C. OlechStrong nilpotence holds in dimensions up to five only, Linear and Multi- linear Algebra, 30(4), 231–255 (1991), https://doi.org/10.1080/03081089108818109

work page doi:10.1080/03081089108818109 1991
[13]

I. P. Shestakov, U. U. Umirbaev,The tame and the wild automorphisms of polynomial rings in three variables, J. Amer. Math. Soc., 17 (2004), 197-227

2004
[14]

Wang,A Jacobian criterion for separability, J

S. Wang,A Jacobian criterion for separability, J. Algebra 65 (1980), 453-494. 10

1980