If I consider only Dyck Paths, I can do write something like this:
DWS=DyckWords(3).list()
for D in DWS:
print(D.height())
to obtain the height of all Dyck paths of length $3$. However, I would like to do the same thing but using $NE$-lattice paths from $(0,0)$ to $(m,n)$. Is there an easy way to do this in Sage?
I fixed this myself but in case anyone is interested I will leave this as an answer.
I decided to use the kbits from this thread to generate all binary strings of length $n$ with $m$ ones. Such strings are in a natural bijection with $NE$-lattice paths from $(0,0)$ to $(n,m)$. After that, I can get the heights of all the paths by writing
Paths = WordPaths('01', steps=[(1,-1),(1,1)])
for b in kbits(m+n,m):
print(Paths(b).ymax())
Note: Sage has a "height" function on words, but this is not what I am looking for. In the definition of height that I am using, the height of an $NE$-path is geometrically the biggest distance that the path is away from the main diagonal.
Asked: 2019-04-11 08:50:27 +0100
Seen: 446 times
Last updated: Apr 11 '19
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
You could try using a bijection with something that is in Sage, e.g. see Ferrers diagram of a partition.