# Generating Functions for Domino Matchings in the $2\times k$ Game of Memory

## TL;DR

This paper develops generating functions for counting domino matchings in a $2\times k$ grid with specified vertical and horizontal pairings, connecting combinatorial configurations with algebraic and diagrammatic representations.

## Contribution

It introduces a formal generating function for domino matchings in the $2\times k$ grid, linking combinatorial enumeration with algebraic structures and linear chord diagrams.

## Key findings

- Derived a generating function for aggregate matching polynomials.
- Connected domino matchings to linear chord diagrams.
- Provided enumeration formulas for specific pairing configurations.

## Abstract

When all the elements of the multiset $\{1,1,2,2,3,3,\ldots,k,k\}$ are placed in the cells of a $2\times k$ rectangular array, in how many configurations are exactly $v$ of the pairs directly over top one another, and exactly $h$ directly beside one another --- thus forming $2\times 1$ or $1\times 2$ dominoes? We consider the sum of matching numbers over the graphs obtained by deleting $h$ horizontal and $v$ vertical vertex pairs from the $2\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.