{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/into-the-woods-a-graph-theoretic-proof-of-the","title":"Into the Woods: A graph theoretic proof of the Dodgson/Muir identity","arxiv_id":"2110.01026","date":"2021-10-03","proceeding":null,"authors":["Melanie Fraser"],"abstract":"The Dodgson/Muir Identity is an identity on determinants of matrix minors that generalizes the Dodgson Identity. Using the matrix tree theorem, we create an equivalent forest identity on ordered sets of $k$ forests. We then prove the generalized Forest Identity, and by extension the Dodgson/Muir Identity, using an edge-swapping involution. This algorithm is a generalization of the Red Hot Potato algorithm, developed by the author in 2021 to prove the Dodgson Identity.","url_abs":"https://arxiv.org/abs/2110.01026v1","url_pdf":"https://arxiv.org/pdf/2110.01026v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"into-the-woods-a-graph-theoretic-proof-of-the","repo_url":"https://github.com/mcfraser3/generalizedrhp","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}