Proofs that Really Count: The Art of Combinatorial Proof

By Arthur T. Benjamin, Jennifer J. Quinn. 2003

400 citations recorded by the source corpus.

Subfields: Geometry and Topology, Statistical and Nonlinear Physics, Theoretical Computer Science

View Paper: https://www.semanticscholar.org/paper/055c6da16bae76e96256a12af4f51fcf69506c79

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Geometry and Topology

1. Mahmut Akyigit
2. Yuval Peres
3. Hidayet Hüda Kösal
4. David A. Levin
5. M. Tosun
6. Pablo Shmerkin
7. Manjunath Krishnapur
8. Michael Hochman

In Statistical and Nonlinear Physics

1. Mahmut Akyigit
2. Yuval Peres
3. Hidayet Hüda Kösal
4. Hamed Haddadi
5. David A. Levin
6. M. Tosun
7. Mohammad Malekzadeh
8. Pablo Shmerkin

In Theoretical Computer Science

1. Mahmut Akyigit
2. Yuval Peres
3. Hidayet Hüda Kösal
4. David A. Levin
5. M. Tosun

Citations in the corpus

• Fibonacci Generalized Quaternions (2014, methodology): “For the Lucas generalized quaternion Tn, using the identities of the Lucas numbers Ln−1Ln+1 −Ln = 5(−1) (see [2]) and Ln+2 = Ln+1 +Ln (see [13]), and similar argument applies as the Fibonacci generalized quaternions, we obtain”
• Markov Chains and Mixing Times: Second Edition (2017, background): “Benjamin and Quinn (2003) use combinatorial interpretations to prove Fibonacci identities (and many other things).”
• Privacy-Preserving Bandits (2019, background): “First, it is possible to precisely enumerate all possible contexts according to the stars and bars pattern in combinatorics (Benjamin & Quinn, 2003).”
• Markov Chains and Mixing Times (2008, background): “Benjamin and Quinn (2003) use combinatorial interpretations to prove Fibonacci identities (and many other things).”