Proof of a Conjecture on the Slit Plane Problem

Details Proof of a Conjecture on the Slit Plane Problem Proof of a Conjecture on the Slit Plane Problem

2003-04-14

arxiv.org/abs/math/0304178v2

Discrete Mathematics, Vol 282/1-3 pp 281-287, 2004

Mathematics

Combinatorics

7 pages

Scientific paper

10.1016/j.disc.2004.01.004

Let $a_{i,j}(n)$ denote the number of walks in $n$ steps from $(0,0)$ to $(i,j)$, with steps $(\pm 1,0)$ and $(0,\pm 1)$, never touching a point $(-k,0)$ with $k\ge 0$ after the starting point. \bous and Schaeffer conjectured a closed form for the number $a_{-i,i}(2n)$ when $i\ge 1$. In this paper, we prove their conjecture, and give a formula for $a_{-i,i}(2n)$ for $i\le -1$.

Affiliated with

Also associated with

No associations

Rating

Proof of a Conjecture on the Slit Plane Problem 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 Proof of a Conjecture on the Slit Plane Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Proof of a Conjecture on the Slit Plane Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-548077