| CARVIEW |
Select Language
HTTP/2 200
last-modified: Thu, 15 Oct 2015 00:11:07 GMT
cache-control: max-age=3600
content-type: text/html; charset=utf-8
content-security-policy: frame-ancestors 'none'
x-frame-options: SAMEORIGIN
x-cloud-trace-context: 9d73c85956851731ce87c9b49f30ad92
server: Google Frontend
via: 1.1 google, 1.1 varnish, 1.1 varnish
accept-ranges: bytes
age: 1809575
date: Thu, 01 Jan 2026 00:08:38 GMT
x-served-by: cache-lga21963-LGA, cache-bom-vanm7210045-BOM
x-cache: HIT, MISS
x-timer: S1767226118.225610,VS0,VE201
content-length: 47807
[1203.5804] Counting matrices over finite fields with support on skew Young diagrams and complements of Rothe diagrams
Skip to main content
[v1] Mon, 26 Mar 2012 20:05:44 UTC (174 KB)
[v2] Fri, 1 Jun 2012 20:52:51 UTC (174 KB)
[v3] Mon, 25 Feb 2013 21:12:55 UTC (175 KB)
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors.
Donate
Mathematics > Combinatorics
arXiv:1203.5804 (math)
[Submitted on 26 Mar 2012 (v1), last revised 25 Feb 2013 (this version, v3)]
Title:Counting matrices over finite fields with support on skew Young diagrams and complements of Rothe diagrams
View a PDF of the paper titled Counting matrices over finite fields with support on skew Young diagrams and complements of Rothe diagrams, by Aaron J. Klein and Joel Brewster Lewis and Alejandro H. Morales
View PDF
Abstract: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é polynomials of the strong Bruhat order.
| Comments: | 24 pages, 9 figures, 1 table |
| Subjects: | Combinatorics (math.CO) |
| MSC classes: | 05A05, 05A15 |
| Cite as: | arXiv:1203.5804 [math.CO] |
| (or arXiv:1203.5804v3 [math.CO] for this version) | |
| https://doi.org/10.48550/arXiv.1203.5804
arXiv-issued DOI via DataCite
|
|
| Journal reference: | J. Algebraic Combinatorics 39 #2 (2014), pp. 429-456 |
| Related DOI: | https://doi.org/10.1007/s10801-013-0453-x
DOI(s) linking to related resources
|
Submission history
From: Alejandro Morales [view email][v1] Mon, 26 Mar 2012 20:05:44 UTC (174 KB)
[v2] Fri, 1 Jun 2012 20:52:51 UTC (174 KB)
[v3] Mon, 25 Feb 2013 21:12:55 UTC (175 KB)
Full-text links:
Access Paper:
- View PDF
- TeX Source
View a PDF of the paper titled Counting matrices over finite fields with support on skew Young diagrams and complements of Rothe diagrams, by Aaron J. Klein and Joel Brewster Lewis and Alejandro H. Morales
References & Citations
export BibTeX citation
Loading...
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.