6 citations · 6 across the 2 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2006
Interpreting the two variable Distance enumerator of the Shi hyperplane arrangement
Sivaramakrishnan Sivasubramanian
We give an interpretation of the coefficients of the two variable refinement $D_{\Sh_n}(q,t)$ of the distance enumerator of the Shi hyperplane arrangement $\Sh_n$ in dimensions…
math.CO2006★ 6 cited
Spanning trees in complete uniform hypergraphs and a connection to extended r-Shi hyperplane arrangements
Sivaramakrishnan Sivasubramanian
We give a Cayley type formula to count the number of spanning trees in the complete r-uniform hypergraph for all r >= 3. Similar to the bijection between spanning trees in complete…
math.CO2005
The polytope of degree partitions
Amitava Bhattacharya, S. Sivasubramanian, Murali K. Srinivasan
The degree partition of a simple graph is its degree sequence rearranged in weakly decreasing order. The polytope of degree partitions (respectively, degree sequences) is the conve…