Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Theorem

MacMahon's Master Theorem

Combinatorics and Graph Theory

MacMahon's master theorem, in enumerative combinatorics and linear algebra, is a result Percy MacMahon discovered and published in his 1916 monograph Combinatory Analysis. It has become a standard tool for deriving binomial identities, including Dixon's identity, and MacMahon himself called it a master theorem for how readily it resolved many otherwise difficult combinatorial questions; later mathematicians including I. J. Good and Leonard Carlitz gave new proofs, and further quantum and noncommutative generalizations followed. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/

Facts
Classification
Statement Form
Identity or Equation 1
Proof Year
1916 1
Connections

Has Statement Form

Equation, Concepts
Identity, Concepts

In Branch

Source MacMahon's master theorem (Wikipedia)

Proved By

Source MacMahon's master theorem (Wikipedia)
Sources
1. MacMahon's master theorem (Wikipedia)
  • Lead section
    In mathematics, MacMahon's master theorem (MMT) is a result in enumerative combinatorics and linear algebra.
  • In Branch: Linear Algebra, Lead sentence
    MMT) is a result in enumerative combinatorics and linear algebra.
  • Proved By: Percy Alexander MacMahon, Lead sentence, attribution
    discovered by Percy MacMahon
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.