SearcharxivSearch

arXiv · 2409.02061

On the holes in $I^n$ for symmetric bilinear forms in characteristic 2

Abstract

Let $F$ be a field. Following the resolution of Milnor's conjecture relating the graded Witt ring of $F$ to its mod-2 Milnor $K$-theory, a major problem in the theory of symmetric bilinear forms is to understand, for any positive integer $n$, the low-dimensional part of $I^n(F)$, the $n$th power of the fundamental ideal in the Witt ring of $F$. In a 2004 paper, Karpenko used methods from the theory of algebraic cycles to show that if $\mathfrak{b}$ is a non-zero anisotropic symmetric bilinear form of dimension $< 2^{n+1}$ representing an element of $I^n(F)$, then $\mathfrak{b}$ has dimension $2^{n+1} - 2^i$ for some $1 \leq i \leq n$. When $i = n$, a classical result of Arason and Pfister says that $\mathfrak{b}$ is similar to an $n$-fold Pfister form. At the next level, it has been conjectured that if $n \geq 2$ and $i= n-1$, then $\mathfrak{b}$ is isometric to the tensor product of an $(n-2)$-fold Pfister form and a $6$-dimensional form of trivial discriminant. This has only been shown to be true, however, when $n = 2$, or when $n = 3$ and $\mathrm{char}(F) \neq 2$ (another result of Pfister). In the present article, we prove the conjecture for all values of $n$ in the case where $\mathrm{char}(F) =2$. In addition, we give a short and elementary proof of Karpenko's theorem in the characteristic-2 case, rendering it free from the use of subtle algebraic-geometric tools. Finally, we consider the question of whether additional dimension gaps can appear among the anisotropic forms of dimension $\geq 2^{n+1}$ representing an element of $I^n(F)$. When $\mathrm{char}(F) \neq 2$, a result of Vishik asserts that there are no such gaps, but the situation seems to be less clear when $\mathrm{char}(F) = 2$.

Explore related subjects

Keep this discovery

BibTeXRIS

Stephen Scully. 2024-09-03. On the holes in $I^n$ for symmetric bilinear forms in characteristic 2. https://arxiv.org/abs/2409.02061

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