Essential dimension and error-correcting codes

preprint2015arXivOpen access

Abstract

One of the important open problems in the theory of central simple algebras is to compute the essential dimension of GL⁡n/μm\operatorname{GL}_n/μ_m, i.e., the essential dimension of a generic division algebra of degree nn and exponent dividing mm. In this paper we study the essential dimension of groups of the form G=(GL⁡n1×⋯×GL⁡nr)/C , G=(\operatorname{GL}_{n_1} \times \dots \times \operatorname{GL}_{n_r})/C \, , where CC is a central subgroup of GL⁡n1×⋯×GL⁡nr\operatorname{GL}_{n_1} \times \dots \times \operatorname{GL}_{n_r}. Equivalently, we are interested in the essential dimension of a generic rr-tuple (A1,…,Ar)(A_1, \dots, A_r) of central simple algebras such that deg⁡(Ai)=ni\operatorname{deg}(A_i) = n_i and the Brauer classes of A1,…,ArA_1, \dots, A_r satisfy a system of homogeneous linear equations in the Brauer group. The equations depend on the choice of CC via the error-correcting code Code⁡(C)\operatorname{Code}(C) which we naturally associate to CC. We focus on the case where n1,…,nrn_1, \dots, n_r are powers of the same prime. The upper and lower bounds on ed⁡(G)\operatorname{ed}(G) we obtain are expressed in terms of coding-theoretic parameters of Code⁡(C)\operatorname{Code}(C), such as its weight distribution. Surprisingly, for many groups of the above form the essential dimension becomes easier to estimate when r≥3r \geq 3; in some cases we even compute the exact value. The Appendix by Athena Nguyen contains an explicit description of the Galois cohomology of groups of the form (GL⁡n1×⋯×GL⁡nr)/C(\operatorname{GL}_{n_1} \times \dots \times \operatorname{GL}_{n_r})/C. This description and its corollaries are used throughout the paper.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.