A new technique, called the superimposition technique, is used to prove various combinatorial identities, including the Aztec Diamond Theorem. The technique involves superimposing matchings of a graph and a smaller subgraph, and then partitioning the united graph again into matchings of two subgraphs. Applications of the technique include weighted Aztec diamonds, holey Aztec rectangles, and pla...
