SearcharxivSearch

arXiv subjects

Elżbieta Adamus

Publications and source records attributed to Elżbieta Adamus.

6 recordsLinked to original sources

Order and Pascal depth of Pascal finite automorphisms of the plane

Let $K$ be a field of characteristic $p>0$. For a Pascal finite automorphism $F$ of the affine plane we show that its order is determined by its Pascal depth, $|F|=p^{\lceil\log_pτ_K(F)\rceil}$, and that, combined with Dolgachev's theorem on the plane Cremona group, this pins the order spectrum of Pascal finite plane automorphisms to $\{1,p,p^2\}$ and bounds the Pascal depth by $τ_K(F)\le p^2$. For the polynomial group $\text{GA}_2(K)$ we give a second, independent proof of the order-$p^2$ ceiling, a purely group-theoretic argument from the Jung--van der Kulk amalgam and Serre's tree theorem, using no birational geometry. We prove that the bound is sharp in two independent senses. Order~$p^2$ is attained by the length-two Witt vectors, and Pascal depth $p^2$ is attained by an explicit tame automorphism $G_p$, for which we give a characteristic-free proof that $τ_K(G_p)=p^2$. We contrast the plane with higher dimensions, where both order and depth are unbounded.

math.AG

On the Jung-van der Kulk decomposition into Pascal finite factors

Combining the Jung--van der Kulk theorem with the conjugacy invariance of the Pascal finite class, we show that every polynomial automorphism $F$ of the plane over an arbitrary field $K$, satisfying $F(0) = 0$, decomposes into the form $F = \diag(\det J_F, 1) \circ P_1 \circ \dots \circ P_s$, where all $P_i$ are Pascal finite automorphisms. Since every Pascal finite automorphism has Jacobian determinant equal to 1, the diagonal factor is the only obstacle: $F$ is a composition of Pascal finite maps if and only if $\det J_F = 1$. In particular, Question~3.1 from \cite{ABCH2} has a positive answer in dimension 2 in any characteristic, which constitutes an analogue of the Exponential Generators Conjecture in positive characteristic. In characteristic $p$, the factors can be chosen to have an order dividing $p^2$.

math.AG

Strongly nilpotent automorphisms are Pascal finite

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.

math.AC

Algorithm for studying polynomial maps and reductions modulo prime number

In our previous paper an effective algorithm for inverting polynomial automorphisms was proposed. Also the class of Pascal finite polynomial automorphisms was introduced. Pascal finite polynomial maps constitute a generalization of exponential automorphisms to positive characteristic. In this note we explore properties of the algorithm while using Segre homotopy and reductions modulo prime number. We give a method of retrieving an inverse of a given polynomial automorphism $F$ with integer coefficients form a finite set of the inverses of its reductions modulo prime numbers. Some examples illustrate effective aspects of our approach.

math.NT