Cylindrical lattice paths and the Loehr-Warrington 10^n conjecture

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

This is a strongly revised version with the same mathematical content but a more attractive presentation

Scientific paper

The following special case of a conjecture by Loehr and Warrington was proved recently by Ekhad, Vatter, and Zeilberger: There are 10^n zero-sum words of length 5n in the alphabet {+3,-2} such that no zero-sum consecutive subword that starts with +3 may be followed immediately by -2. We give a simple bijective proof of the conjecture in its original and more general setting. To do this we reformulate the problem in terms of cylindrical lattice paths.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Cylindrical lattice paths and the Loehr-Warrington 10^n 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 Cylindrical lattice paths and the Loehr-Warrington 10^n conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cylindrical lattice paths and the Loehr-Warrington 10^n conjecture will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-503631

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.