Enumerating and constructing essentially equivalent lattice paths
The paper considers lattice paths from \((0,0)\) to \((m,n)\). The following problem is studied: what is the maximum size of a set of such lattice paths, such that any two lattice paths share at most \(k\) edges? The following conjecture is found: a maximum size set is achieved, if all lattice paths are listed in reverse lexicographic order, and one selects paths from this list with a greedy algorithm. (Denoting a step up by N, and a step to the right by E, the reverse lexicographic order of lattice paths from \((0,0)\) to \((2,2)\) is NNEE, NENE, NEEN, ENNE, ENEN, EENN.) Some partial results are given which support this conjecture.
- Lattice path enumeration by formal schema
- On the edge set of graphs of lattice paths
- scientific article; zbMATH DE number 1498640 (Why is no real title available?)
- scientific article; zbMATH DE number 2094512 (Why is no real title available?)
- scientific article; zbMATH DE number 815885 (Why is no real title available?)
- A new scheme for enumerating connected diagrams on the lattice
- A Combinatorial Bijection between Ordered Trees and Lattice Paths
- k-distinct lattice paths
This page was built for publication: Enumerating and constructing essentially equivalent lattice paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2765090)
