Generating Functions for Domino Matchings in the 2×k2\times k Game of Memory

preprint2019arXivOpen access

Abstract

When all the elements of the multiset {1,1,2,2,3,3,…,k,k}\{1,1,2,2,3,3,\ldots,k,k\} are placed in the cells of a 2×k2\times k rectangular array, in how many configurations are exactly vv of the pairs directly over top one another, and exactly hh directly beside one another --- thus forming 2×12\times 1 or 1×21\times 2 dominoes? We consider the sum of matching numbers over the graphs obtained by deleting hh horizontal and vv vertical vertex pairs from the 2×k2\times k grid graph in all possible ways, providing a generating function for these aggregate matching polynomials. We use this result to derive a formal generating function enumerating the domino matchings, making connections with linear chord diagrams.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.