On the two variable distance enumerator of the Shi hyperplane arrangement

From MaRDI portal
Publication:925010

DOI10.1016/J.EJC.2007.08.002zbMATH Open1139.52021arXivmath/0610780OpenAlexW1996588825MaRDI QIDQ925010FDOQ925010

Sivaramakrishnan Sivasubramanian

Publication date: 29 May 2008

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: We give an interpretation of the coefficients of the two variable refinement DShn(q,t) of the distance enumerator of the Shi hyperplane arrangement Shn in n dimensions. This two variable refinement was defined by Stanley cite{stan-rota} for the general r-extended Shi hyperplane arrangements. We give an interpretation when r=1. We define three natural three-dimensional partitions of the number (n+1)n1. The first arises from parking functions of length n, the second from special posets on n vertices defined by Athanasiadis and the third from spanning trees on n+1 vertices. We call the three partitions as the parking partition, the tree-poset partition and the spanning-tree partition respectively. We show that one of the parts of the parking partition is identical to the number of edge-labelled trees with label set 1,2,...,n on n+1 unlabelled vertices. We prove that the parking partition majorises the tree-poset partition and conjecture that the spanning-tree partition also majorises the tree-poset partition.


Full work available at URL: https://arxiv.org/abs/math/0610780




Recommendations




Cites Work


Cited In (1)





This page was built for publication: On the two variable distance enumerator of the Shi hyperplane arrangement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925010)