Whitney Numbers of Partial Dowling Lattices
Abstract
The Dowling lattice Qn(G), G a finite group, generalizes the geometric lattice generated by all vectors, over a field, with at most two nonzero components. Abstractly, it is a fundamental object in the classification of finite matroids. Constructively, it is the frame matroid of a certain gain graph known as G·Kn(V). Its Whitney numbers of the first kind enter into several important formulas. Ravagnani suggested and partially proved that these numbers of Qn(G) and higher-weight generalizations are polynomial functions of |G|. We give a simple proof for Qn(G) and its generalization to a wider class of gain graphs and biased graphs, and we determine the degrees and coefficients of the polynomials.
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.