On the Symbol Length of Fields with finite Square Class Number
Detlev Hoffmann, Nico Lorenz

TL;DR
This paper establishes upper bounds on the symbol length of quadratic forms over fields with finitely many square classes, using combinatorial methods related to vector spaces over finite fields.
Contribution
It provides new bounds for the n-symbol length of quadratic forms over such fields, including a rediscovery of a known bound via a different approach.
Findings
Derived an upper bound for the number of Pfister forms over the field.
Computed upper bounds for the n-symbol length for fields with finitely many square classes.
Reproduced a known bound originally stated by Bruno Kahn.
Abstract
Let be a field of characteristic not 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 . Moreover, we compute upper bounds for the -symbol length (), i.e., the smallest integer such that to each quadratic form there exists some and Pfister forms such that . In particular, we rediscover a bound that can also be deduced from a result by Bruno Kahn that he stated without proof.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Coding theory and cryptography · Finite Group Theory Research
