The Quasi-Holonomic Ansatz and Restricted Lattice Walks

Details The Quasi-Holonomic Ansatz and Restricted Lattice Walks The Quasi-Holonomic Ansatz and Restricted Lattice Walks

2008-06-26

arxiv.org/abs/0806.4318v1

Mathematics

Combinatorics

A One-Line Proof of Kreweras' Quarter-Plane Walk Theorem. See: http://www.math.rutgers.edu/~zeilberg/tokhniot/oKreweras

Scientific paper

The great enumerator Germain Kreweras empirically discovered this intriguing fact, and then needed lots of pages[K], and lots of human ingenuity, to prove it. Other great enumerators, for example, Heinrich Niederhausen[N], Ira Gessel[G1], and Mireille Bousquet-M\'elou[B], found other ingenious, ``simpler'' proofs. Yet none of them is as simple as ours! Our proof (with the generous help of our faithful computers) is ``ugly'' in the traditional sense, since it would be painful for a lowly human to follow all the steps. But according to our humble aesthetic taste, this proof is much more elegant, since it is (conceptually) one-line. So what if that line is rather long (a huge partial-recurrence equation satisfied by the general counting function), it occupies less storage than a very low-resolution photograph.

Affiliated with

Also associated with

No associations

Rating

The Quasi-Holonomic Ansatz and Restricted Lattice Walks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Quasi-Holonomic Ansatz and Restricted Lattice Walks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Quasi-Holonomic Ansatz and Restricted Lattice Walks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-246498