On the Symbol Length of Fields with finite Square Class Number

Abstract

Let F be a field of characteristic not 2 with finitely many square classes. Using combinatorial arguments applied to objects related to vector spaces over finite fields, we deduce an upper bound for the number of Pfister forms over F. Moreover, we compute upper bounds for the n-symbol length F (n∈ N), i.e., the smallest integer sln(F)≥ 0 such that to each quadratic form φ∈ In(F) there exists some 0≤ k≤ sln(F) and Pfister forms π1,…, πk such that π1+…+πk In+1(F). In particular, we rediscover a bound that can also be deduced from a result by Bruno Kahn that he stated without proof.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…