SearcharxivSearch

arXiv · math/0606196

Quadratic and cubic invariants of unipotent affine automorphisms

Abstract

Let $K$ be an arbitrary field of characteristic zero, $P_n:= K[ x_1, ..., x_n]$ be a polynomial algebra, and $P_{n, x_1}:= K[x_1^{-1}, x_1, ..., x_n]$, for $n\geq 2$. Let $\s' \in {\rm Aut}_K(P_n)$ be given by $$ x_1\mapsto x_1-1, \quad x_1\mapsto x_2+x_1,\quad ... ,\quad x_n\mapsto x_n+x_{n-1}.$$ It is proved that the algebra of invariants, $F_n':= P_n^{\s'}$, is a polynomial algebra in $n-1$ variables which is generated by $[\frac{n}{2}]$ quadratic and $[\frac{n-1}{2}]$ cubic (free) generators that are given explicitly. Let $\s \in {\rm Aut}_K(P_n)$ be given by %$$\s \in {\rm Aut}_K(P_n): $$ x_1\mapsto x_1, \quad x_1\mapsto x_2+x_1, \quad ... ,\quad x_n\mapsto x_n+x_{n-1}.$$ It is well-known that the algebra of invariants, $F_n:= P_n^\s$, is finitely generated (Theorem of Weitzenböck, \cite{Weitz}, 1932), has transcendence degree $n-1$, and that one can give an explicit transcendence basis in which the elements have degrees $1, 2, 3, ..., n-1$. However, it is an old open problem to find explicit generators for $F_n$. We find an explicit vector space basis for the quadratic invariants, and prove that the algebra of invariants $P_{n, x_1}^\s$ is a polynomial algebra over $K[x_1, x_1^{-1}]$ in $n-2$ variables which is generated by $[\frac{n-1}{2}]$ quadratic and $[\frac{n-2}{2}]$ cubic (free) generators that are given explicitly. The coefficients of these quadratic and cubic invariants throw light on the `unpredictable combinatorics' of invariants of affine automorphisms and of $SL_2$-invariants.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

V V Bavula, T H Lenagan. 2006-06-08. Quadratic and cubic invariants of unipotent affine automorphisms. https://arxiv.org/abs/math/0606196

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA