Towards a human proof of Gessel's conjecture

Details Towards a human proof of Gessel's conjecture Towards a human proof of Gessel's conjecture

2009-02-13

arxiv.org/abs/0902.2329v1

Journal of Integer Sequences, 12 (2009), 09.4.2

Mathematics

Combinatorics

16 pages

Scientific paper

We interpret walks in the first quadrant with steps {(1,1),(1,0),(-1,0), (-1,-1)} as a generalization of Dyck words with two sets of letters. Using this language, we give a formal expression for the number of walks in the steps above beginning and ending at the origin. We give an explicit formula for a restricted class of such words using a correspondance between such words and Dyck paths. This explicit formula is exactly the same as that for the degree of the polynomial satisfied by the square of the area of cyclic n-gons conjectured by Dave Robbins although the connection is a mystery. Finally we remark on another combinatorial problem in which the same formula appears and argue for the existence of a bijection.

Affiliated with

Also associated with

No associations

Rating

Towards a human proof of Gessel's conjecture 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 Towards a human proof of Gessel's conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Towards a human proof of Gessel's conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-357478