Special Lattice Paths

For discussing Olympiad Level Combinatorics problems
Kiriti
Posts:27
Joined:Mon May 13, 2013 5:05 pm
Location:401/1 South Paik Para, Kalyanpur, Mirpur, Dhaka-1216
Special Lattice Paths

Unread post by Kiriti » Wed May 22, 2013 4:32 pm

Let \(S\) be the set of { (1,0),(0,1),(1,1),(1,−1),(−1 1)}-lattice path which begin at (1,1), do not use the same vertex twice, and never touch either the x-axis or the y-axis.

Let \(P_x\),\(_y\)be the number of paths in \(S\) which end at x,y. Determine \(P_2\),\(_4\).


Details and assumptions


A lattice path is a path in the Cartesian plane between points with integer coordinates.

A step in a lattice path is a single move from one point with integer coordinates to another.

The size of the step from \((x_1\),\(y_1)\) to \((x_2\),\(y_2)\) is \((x_2 − x_1\),\(y_2 − y_1)\)

The length of a lattice path is the number of steps in the path.

For a set \(S =\) {(x\(_i\),y\(_i\))}\(^ k _{i=1}\) an \(S\)-lattice path is a lattice path where every step has size which is a member of \(S\). :roll:

Post Reply