Rank-Metric Lattices

TL;DR

This paper introduces rank-metric geometric lattices, explores their properties, characterizes supersolvable cases, computes characteristic polynomials, and connects these structures to vector rank-metric codes and their invariants.

Contribution

It defines rank-metric lattices as q-analogues of Dowling lattices, characterizes supersolvable cases, and links lattice invariants to rank-metric code properties.

Findings

Characterization of supersolvable rank-metric lattices

Computed characteristic polynomials for certain lattices

Introduced lattice-rank weights as code invariants

Abstract

We introduce the class of rank-metric geometric lattices and initiate the study of their structural properties. Rank-metric lattices can be seen as the $q$-analogues of higher-weight Dowling lattices, defined by Dowling himself in 1971. We fully characterize the supersolvable rank-metric lattices and compute their characteristic polynomials. We then concentrate on the smallest rank-metric lattice whose characteristic polynomial we cannot compute, and provide a formula for it under a polynomiality assumption on its Whitney numbers of the first kind. The proof relies on computational results and on the theory of vector rank-metric codes, which we review in this paper from the perspective of rank-metric lattices. More precisely, we introduce the notion of lattice-rank weights of a rank-metric code and investigate their properties as combinatorial invariants and as code distinguishers for inequivalent codes.