Asymptotics of generalized Galois numbers via affine Kac-Moody algebras

Abstract

Generalized Galois numbers count the number of flags in vector spaces over finite fields. Asymptotically, as the dimension of the vector space becomes large, we give their exponential growth and determine their initial values. The initial values are expressed analytically in terms of theta functions and Euler's generating function for the partition numbers. Our asymptotic enumeration method is based on a Demazure module limit construction for integrable highest weight representations of affine Kac-Moody algebras. For the classical Galois numbers, that count the number of subspaces in vector spaces over finite fields, the theta functions are Jacobi theta functions. We apply our findings to the asymptotic number of q-ary codes, and conclude with some final remarks about possible future research concerning asymptotic enumerations via limit constructions for affine Kac-Moody algebras.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…