Commit b01f963c authored by Nick Ham's avatar Nick Ham

made some changes

parent 71b86541
No preview for this file type
......@@ -60,5 +60,11 @@
When the number of lattice paths for a given step-set is equal to the number of objects for another structure, let $X$ and $Y$ be the computationally/algorithmically dearer and cheaper algorithms respectively for enumerating the lattice paths and enumerating the other objects. Any algorithm that uses $X$ may be made more efficient by instead using $Y$.
There wasn't anything that special mathematically to finding them (that's an attitude from someone at the research level, it would be very impressive from people at most lower levels depending on what audience ends up reading this), just coming up with example step-sets and doing a bit of relatively simple programming to spout some numbers out.
I was going to clean it up a bit but am rather busy with other stuff at the moment, it would be interesting to see what different people are able to come up with in regards to explaining it to other people at lower levels (maybe even writing up their own version of what the conjectures are, and what approaches people might take when playing with it, including trying to prove some of the conjectures or identify more interesting conjectures), which arguments people are able to come up with to prove the various conjectures, what applications may arise for example with bijections between lattice paths and other objects, so on and so forth, maybe even trying to create some kind of dictionary/encyclopaedia for different aspects (eg. step-sets, sequences that arise, etc.), discussing what the correct term is would be quite useful as well.
Enumerating the lattice paths/walks using Euclid's orchard as a step-set is kind of interesting too, it would be awesome if someone managed to find a connection to any sequence arising from enumerating paths/walks using a step-set that is a subset of Euclid's orchard (or a generalisation of it).
\ No newline at end of file
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment