Picture of person typing on laptop with programming code visible on the laptop screen

World class computing and information science research at Strathclyde...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by University of Strathclyde researchers, including by researchers from the Department of Computer & Information Sciences involved in mathematically structured programming, similarity and metric search, computer security, software systems, combinatronics and digital health.

The Department also includes the iSchool Research Group, which performs leading research into socio-technical phenomena and topics such as information retrieval and information seeking behaviour.

Explore

The sandpile model on a bipartite graph, parallelogram polyominoes, and a q,t-Narayana polynomial

Dukes, Mark and Le Borgne, Yvan (2012) The sandpile model on a bipartite graph, parallelogram polyominoes, and a q,t-Narayana polynomial. In: DMTCS Proceedings. Discrete Mathematics & Theoretical Computer Science, Nancy, France, pp. 337-348.

Full text not available in this repository. Request a copy from the Strathclyde author

Abstract

We give a polyomino characterisation of recurrent configurations of the sandpile model on the complete bipartite graph Km,n in which one designated vertex is the sink. We present a bijection from these recurrent configurations to decorated parallelogram polyominoes whose bounding box is a m × n rectangle. Other combinatorial structures appear in special cases of this correspondence: for example bicomposition matrices (a matrix analogue of set partitions), and (2+2)-free posets. A canonical toppling process for recurrent configurations gives rise to a path within the associated parallelogram polyominoes. We define a collection of polynomials that we call q, t-Narayana polynomials, the generating functions of the bistatistic (area, parabounce) on the set of parallelogram polyominoes, akin to Haglund's (area, hagbounce) bistatistic on Dyck paths. In doing so, we have extended a bistatistic of Egge et al. to the set of parallelogram polyominoes. This is one answer to their question concerning extensions to other combinatorial objects. We conjecture the q, t-Narayana polynomials to be symmetric and discuss the proofs for numerous special cases. We also show a relationship between the q, t-Catalan polynomials and our bistatistic (area, parabounce) on a subset of parallelogram polyominoes.