English

The Canada Day Theorem

Combinatorics 2013-02-06 v2

Abstract

The Canada Day Theorem is an identity involving sums of k×kk \times k minors of an arbitrary n×nn \times n symmetric matrix. It was discovered as a by-product of the work on so-called peakon solutions of an integrable nonlinear partial differential equation proposed by V. Novikov. Here we present another proof of this theorem, which explains the underlying mechanism in terms of the orbits of a certain abelian group action on the set of all kk-edge matchings of the complete bipartite graph Kn,nK_{n,n}.

Cite

@article{arxiv.1206.4138,
  title  = {The Canada Day Theorem},
  author = {Daniel Gomez and Hans Lundmark and Jacek Szmigielski},
  journal= {arXiv preprint arXiv:1206.4138},
  year   = {2013}
}

Comments

16 pages. pdfLaTeX + AMS packages + TikZ. Fixed a hyperlink problem and a few typos

R2 v1 2026-06-21T21:21:44.531Z