Mathematics – Combinatorics
Scientific paper
2012-03-26
Mathematics
Combinatorics
24 pages, 9 figures, 1 table
Scientific paper
We consider the problem of finding the number of matrices over a finite field with a certain rank and with support that avoids a subset of the entries. These matrices are a q-analogue of permutations with restricted positions (i.e., rook placements). For general sets of entries these numbers of matrices are not polynomials in q (Stembridge 98); however, when the set of entries is a Young diagram, the numbers, up to a power of q-1, are polynomials with nonnegative coefficients (Haglund 98). In this paper, we give a number of conditions under which these numbers are polynomials in q, or even polynomials with nonnegative integer coefficients. We extend Haglund's result to complements of skew Young diagrams, and we apply this result to the case when the set of entries is the Rothe diagram of a permutation. In particular, we give a necessary and sufficient condition on the permutation for its Rothe diagram to be the complement of a skew Young diagram up to rearrangement of rows and columns. We end by giving conjectures connecting invertible matrices whose support avoids a Rothe diagram and Poincar\'e polynomials of the strong Bruhat order.
Klein Aaron J.
Lewis Joel Brewster
Morales Alejandro H.
No associations
LandOfFree
Counting matrices over finite fields with support on skew Young and Rothe diagrams does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Counting matrices over finite fields with support on skew Young and Rothe diagrams, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting matrices over finite fields with support on skew Young and Rothe diagrams will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-637791