加载中…
The Dowling lattice , 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 . Its Whitney numbers of the first kind enter into several important formulas. Ravagnani suggested and partially proved that these numbers of and higher-weight generalizations are polynomial functions of . We give a simple proof for and its generalization to a wider class of gain graphs and biased graphs, and we determine the degrees and coefficients of the polynomials.

生成讲解博客的中文版本

生成AI智能校验的中文版本