Quadratically enriched binomial coefficients over a finite field
Abstract
We compute an analogue of Pascal's triangle enriched in bilinear forms over a finite field. This gives an arithmetically meaningful count of the ways to choose j ring homomorphisms into an algebraic closure from an \'etale extension of degree n. We also compute a quadratic twist. These (twisted) enriched binomial coefficients are defined in joint work of Brugall\'e and the second-named author, building on work of Serre. Such binomial coefficients support curve counting results over non-algebraically closed fields, using A1-homotopy theory.
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.