A combinatorial proof for Cayley's identity
Combinatorics
2013-09-27 v1
Abstract
In a recent paper, Caracciolo, Sokal and Sportiello presented, inter alia, an algebraic/combinatorial proof for Cayley's identity. The purpose of the present paper is to give a "purely combinatorial" proof for this identity; i.e., a proof involving only combinatorial arguments together with a generalization of Laplace's Theorem, for which a "purely combinatorial" proof is already known.
Cite
@article{arxiv.1309.6801,
title = {A combinatorial proof for Cayley's identity},
author = {Markus Fulmek},
journal= {arXiv preprint arXiv:1309.6801},
year = {2013}
}