Related papers: Whitney Numbers of Partial Dowling Lattices

Dowling constructed Dowling lattice Qn(G), for any finite set with n elements and any finite multiplicative group G of order m, which is a finite geometric lattice. He also defined the Whitney numbers of the first and second kinds for any…

We study the Whitney numbers of the first kind of combinatorial geometries. The first part of the paper is devoted to general results relating the M\"{o}bius functions of nested atomistic lattices, extending some classical theorems in…

A G-gain graph is a graph whose oriented edges are labeled invertibly from a group G. Zaslavsky proposed two matroids of G-gain graphs, called frame matroids and lift matroids, and investigated linear representations of them. Each matroid…

It is shown that the Whitney function of a representable q-matroid and the collection of all higher weight enumerators of any representing rank-metric code determine each other via a monomial substitution. Moreover, the q-matroid itself and…

Dowling and Rhodes defined different lattices on the set of triples (Subset, Partition, Cross Section) over a fixed finite group G. Although the Rhodes lattice is not a geometric lattice, it defines a matroid in the sense of the theory of…

We show that the Whitney function of a q-matroid can be determined from the cloud and flock polynomials associated to the cyclic flats. These polynomials capture information about the corank (resp., nullity) of certain spaces whose cyclic…

A well-known conjecture states that the Whitney numbers of the second kind of a geometric lattice (simple matroid) are logarithmically concave. We show this conjecture to be equivalent to proving an upper bound on the number of new copoints…

The Dowling geometry $Q_n(\Gamma)$, where $\Gamma$ is a finite group, is a matroid that generalizes the complete-graphic matroid $M(K_{n+1})$. We determine the maximum size of an $N$-free submatroid of $Q_n(\Gamma)$ for various choices of…

We introduce a new family of symmetric polynomials $\mathfrak{G}^{(\mathbf{u},\mathbf{v})}_{\lambda}$ arising from exactly solvable lattice models associated with the quantised loop algebra $\mathcal{U}_{q}(\mathfrak{sl}_{2}[z^\pm])$. The…

The purpose of this this paper is to generalize the functors arising from the theory of Witt vectors duto to Cartier. Given a polynomial $g(q)\in \mathbb Z[q]$, we construct a functor ${\overline {W}}^{g(q)}$ from the category of $\mathbb…

A gain graph is a graph whose edges are orientably labelled from a group. A weighted gain graph is a gain graph with vertex weights from an abelian semigroup, where the gain group is lattice ordered and acts on the weight semigroup. For…

Let $p$ and $l$ be distinct odd primes and let $n\geq 2$ be a positive integer. Let $E$ be a finite Galois extension of degree $l$ of a $p$-adic field $F$. Let $q$ be the cardinality of the residue field of $F$. Let $\overline{\pi}_F$ be a…

This paper is devoted to the theory of $GL_n({\mathbb Z})$-conjugacy classes of regular integer $n\times n$ matrices. Such a matrix is $GL_n({\mathbb Q})$-conjugate to the companion matrix of its characteristic polynomial. But the set of…

Let G be a finite connected graph. The Kirchhoff polynomial of G is a certain homogeneous polynomial whose degree is equal to the first betti number of G. These polynomials appear in the study of electrical circuits and in the evaluation of…

We represent Feigin's construction [11] of lattice W algebras and give some simple results: lattice Virasoro and $W_3$ algebras. For simplest case $g=sl(2)$ we introduce whole $U_q(sl(2))$ quantum group on this lattice. We find simplest…

In this paper we compute new values of Iwahori Whittaker functions on $n$-fold metaplectic covers $\widetilde{G}$ of $\mathbf{G}(F)$ with $\mathbf{G}$ a split reductive group over a non-archimedean local field $F$. For every Iwahori…

A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…

Restricted Whitney numbers of the first kind appear in the combinatorial recursion for the matroid Kazhdan-Lusztig polynomials. In the special case of braid matroids (the matroid associated to the partition lattice, the complete graph, the…

We study the quantum finite W-algebras W(gl_N,f), associated to the Lie algebra gl_N, and its arbitrary nilpotent element f. We construct for such an algebra an r_1 x r_1 matrix L(z) of Yangian type, where r_1 is the number of maximal parts…

We reinterpret the Rhodes semilattices $R_n(\mathfrak{G})$ of a group $\mathfrak{G}$ in terms of gain graphs and generalize them to all gain graphs, both as sets of partition-potential pairs and as sets of subgraphs, and for the latter,…